Abstract
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.
Cite
CITATION STYLE
Petersen, H. L., & Ropke, S. (2011). The pickup and delivery problem with cross-docking opportunity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6971 LNCS, pp. 101–113). https://doi.org/10.1007/978-3-642-24264-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
