The multi depot one-to-one pickup and delivery problem with distance constraints: Real world application and heuristic solution approach

Abstract

This paper presents the development of the multi depot oneto- one pickup and delivery problem with distance constraints problem. This problem involve routing vehicles in a multi depot network topology to satisfy a set of pickup and delivery requests subject to a maximum allowable distance constraint. A problem definition is given and a real world application is proposed for that problem. An approximate solution approach which divides the problem into several subproblems and solve them to optimality is also proposed. Computational experiments show that the proposed solution approach reach good quality solutions is a reasonable computational time.