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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1007/978-3-642-24264-9_8 | ICCL |
Keywords | Field | DocType |
customers site,cross-docking opportunity,large neighborhood search,pickup request,direct delivery,pickup-and-delivery request,industry application,final destination,delivery request,delivery problem | Truck,Computer science,Simulation,Computer network,Theoretical computer science,Cross-docking,Pickup,Large neighborhood search | Conference |
Volume | ISSN | Citations |
6971 | 0302-9743 | 16 |
PageRank | References | Authors |
0.69 | 14 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hanne L. Petersen | 1 | 101 | 5.00 |
Stefan Ropke | 2 | 1347 | 55.90 |