An Heuristic Approach to Solving the one-to-one Pickup and Delivery Problem with Three-dimensional Loading Constraints

摘要

A mathematical model and a solving strategy for the Pickup and Delivery Problem with three-dimensional loading constraints regarding a combinatorial configuration instead of a traditional approach that utilizes Boolean variables is proposed. A traditional one-to-one Pickup and Delivery Problem in a combination with a problem of packing transported items into vehicles by means of the proposed combinatorial generation algorithm is solved.