Business Commons^™

A Metaheuristic For The Pickup And Delivery Problem With Split-Loads And Its Extension, Dai Yao

Dissertations and Theses Collection (Open Access)

In this dissertation, we study improvements in the Pickup and Delivery Problem that can be achieved by allowing multiple vehicle trips to serve a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be served by only one vehicle trip. Specifically, we investigate the problem of routing vehicles to serve loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may serve at a time. We develop a metaheuristic to solve large scale practical size problems in this form and apply …