In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. © 2011 Springer-Verlag.
|Book series||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 2011|
|Event||2nd International Conference on Computational Logistics - Hamburg, Germany|
Duration: 19 Sep 2011 → 22 Sep 2011
Conference number: 2
|Conference||2nd International Conference on Computational Logistics|
|Period||19/09/2011 → 22/09/2011|