2006
DOI: 10.1287/trsc.1050.0135
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Abstract: The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup is performed before the corresponding delivery. The routes must also satisfy time window and capacity constraints. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
1,308
1
19

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 1,754 publications
(1,331 citation statements)
references
References 22 publications
3
1,308
1
19
Order By: Relevance
“…Acceptance criteria: The accept criteria used in this paper is borrowed from Ropke and Pisinger [2006] and is bases on Simulated Annealing (SA). A solution, x is always accepted if c(x) > c(x best ).…”
Section: Algorithm Setupmentioning
confidence: 99%
See 2 more Smart Citations
“…Acceptance criteria: The accept criteria used in this paper is borrowed from Ropke and Pisinger [2006] and is bases on Simulated Annealing (SA). A solution, x is always accepted if c(x) > c(x best ).…”
Section: Algorithm Setupmentioning
confidence: 99%
“…The general idea of Shaw removal heuristic is to remove parts of the solution which are somewhat related, as it is expected that they then are reasonably easy to reshu e, and then creating a new, perhaps better solution (Shaw [1997], Ropke and Pisinger [2006]). Let the relatedness measure between meeting i and j be de ned by M (i; j) ∈ [0; 1], where a high level corresponds to much relatedness between i and j. Algorithm 2 present a pseudo code for the Shaw Removal heuristic for the ECSS.…”
Section: Shaw Removal Heuristicmentioning
confidence: 99%
See 1 more Smart Citation
“…In the destruction phase of the LNS algorithm, different heuristics similar to those presented in Ropke and Pisinger (2006) are used to determine the vertices to be removed from the routes of the current solution. The reconstruction phase applies either TS or CG.…”
Section: Literature Reviewmentioning
confidence: 99%
“…If the two segments have a cumulative duration of more than 13 hours, then not considering the 13-hour rule in stage 2 would lead to an illegal driver route. In both stages, we apply an implementation of a large neighborhood search heuristic, see Shaw (1997), Ropke and Pisinger (2006), Pisinger and Ropke (2007). Essentially, in such methods, elements of a solution are alternately removed (destruction step) and reinserted (reconstruction step) in order to improve a given solution.…”
Section: Stage 2 Problem: Vehicle Routing Problem With Time Windows Amentioning
confidence: 99%