Three-dimensional one-to-one pickup and delivery routing problem with loading constraints

Abstract

We propose mathematical model and solving strategy for PDP with 3D loading constraints in terms of combinatorial configuration instead of traditional approach that uses boolean variables. We solve traditional one-to-one Pickup and Delivery Problem in combination with problem of packing delivered items into vehicles by means of proposed combinatorial generation algorithm.