A branch and cut algorithm for the multi-vehicle one-to-one pickup and delivery problem with split loads
Öncan, Temel and Tüzün Aksu, Dilek and Şahin, Güvenç and Şahin, Mustafa (2011) A branch and cut algorithm for the multi-vehicle one-to-one pickup and delivery problem with split loads. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2011), Singapore
This is the latest version of this item.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/IEEM.2011.6118238
In this work we deal with the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads (MPDPSL). This problem is a generalization of the one-to-one Pickup and Delivery Problem (PDP) where each load can be served by multiple stops by the same vehicle. In practice split deliveries is a viable option in many settings such as courier services of third party logistics operators. We propose a branch-and-cut algorithm which employs valid inequalities devised for special cases of the MPDPSL, such as the Dial-a-Ride Problem, PDP and Split Delivery Vehicle Routing Problem. According to our computational experiments with randomly generated test instances, we may claim that the proposed algorithm can be used for small sized instances.
Available Versions of this Item
Repository Staff Only: item control page