The pickup and delivery problem with cross-docking opportunity

Authors:
Hanne L. Petersen;Stefan Ropke
Affiliations:
Technical University of Denmark, Department of Transport, Kgs. Lyngby;Technical University of Denmark, Department of Transport, Kgs. Lyngby
Venue:
ICCL'11 Proceedings of the Second international conference on Computational logistics
Year:
2011

Citing 10
Cited 1

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
A general heuristic for vehicle routing problems

Computers and Operations Research
Vehicle routing scheduling for cross-docking in the supply chain

Computers and Industrial Engineering - Special issue: Logistics and supply chain management
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Transportation Science
A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

Operations Research
Guided ejection search for the pickup and delivery problem with time windows

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.