The Pickup and Delivery Problem with Cross-Docking Opportunity

Petersen, Hanne Løhmann; Røpke, Stefan

doi:10.1007/978-3-642-24264-9_8

Cited by 25 publications

(17 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…up to 8%). In addition, Petersen and Røpke (2011) investigate the PDP with crossdocking opportunities (PDPCD). The authors propose a large neighbourhood search heuristic for the PDPCD.…”

Section: Literature Reviewmentioning

confidence: 99%

The pickup and delivery problem with time windows and scheduled lines

Ghilas

Demir

Woensel

2016

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

Integrating freight flows with scheduled public transportation services creates attractive business opportunities as the same transportation needs can be met with fewer operating costs. The pickup and delivery problem with time windows and scheduled lines (PDPTW-SL) aims at routing a given set of vehicles to transport freight requests from their origins to their corresponding destinations, where the requests can use scheduled passenger transportation services as a part of their journeys. We describe the PDPTW-SL as an arc-based mixed-integer program. Computational results on a set of small-size instances provide a clear understanding of the benefits of using scheduled line services as a part of freight's journey.

show abstract

“…up to 8%). In addition, Petersen and Røpke (2011) investigate the PDP with crossdocking opportunities (PDPCD). The authors propose a large neighbourhood search heuristic for the PDPCD.…”

Section: Literature Reviewmentioning

confidence: 99%

The pickup and delivery problem with time windows and scheduled lines

Ghilas

Demir

Woensel

2016

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

show abstract

“…Another important difference between these two models is related to the objective considered: PDPCD is aimed at minimizing the total travel costs, whereas the PDPTWT usually calls for the maximization of user convenience (i.e., minimize passenger ride time). The first study on a practical PDPCD application with time windows is presented by Petersen and Ropke (2011). A Large Neighborhood Search metaheuristic algorithm is developed to minimize the total travel costs for real-life problem instances of 500-1,000 requests.…”

Section: Related Workmentioning

confidence: 99%

Moving products between location pairs: Cross-docking versus direct-shipping

Nikolopoulou

Repoussis

Tarantilis

et al. 2017

European Journal of Operational Research

View full text Add to dashboard Cite

“…Their objective is to minimize the makespan. Petersen and Ropke [20] present an ALNS for a pickup and delivery problem with a single transfer point, concerning the transportation of flowers in Denmark. The algorithm is evaluated on real-life instances containing up to 982 requests.…”

Section: Related Workmentioning

confidence: 99%

The Dial-A-Ride Problem with Transfers

Masson

Lehuédé

Péton

2014

Computers & Operations Research

133

View full text Add to dashboard Cite

The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8% on real-life instances.

show abstract

The Pickup and Delivery Problem with Cross-Docking Opportunity

Cited by 25 publications

References 18 publications

The pickup and delivery problem with time windows and scheduled lines

The pickup and delivery problem with time windows and scheduled lines

Moving products between location pairs: Cross-docking versus direct-shipping

The Dial-A-Ride Problem with Transfers

Contact Info

Product

Resources

About