2007
DOI: 10.1007/s10878-007-9090-4
|View full text |Cite
|
Sign up to set email alerts
|

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
38
0
6

Year Published

2008
2008
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(44 citation statements)
references
References 28 publications
0
38
0
6
Order By: Relevance
“…Some authors (Salhi and Nagy [2], Dethloff [4], Ropke and Pisinger [10]) have tested these instances including the drop time, while Montané and Galvão [8] did not include it in their work. Recently, Wassan et al [14] admitted both situations. On the other hand, Nagy and Salhi [3] treated the problem including drop times but allowing two visits to the same client.…”
Section: Computational Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Some authors (Salhi and Nagy [2], Dethloff [4], Ropke and Pisinger [10]) have tested these instances including the drop time, while Montané and Galvão [8] did not include it in their work. Recently, Wassan et al [14] admitted both situations. On the other hand, Nagy and Salhi [3] treated the problem including drop times but allowing two visits to the same client.…”
Section: Computational Resultsmentioning
confidence: 99%
“…Wassan et al [14] made use of a constructive procedure based on the sweep algorithm and propose a reactive tabu search with the following neighborhood structures: reallocation of a client (shift), exchanging two clients between two different routes (exchange) and reversing the route direction (reverse). They also dealt with the VRPSPDTL.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Dethloff [14] proposed a series of constructive heuristics for that purpose, while Nagy and Salhi [39] developed a local neighborhood algorithm with promising performance. Tabu search has been widely applied to the VRPSPD, often combined with local search algorithms [12,9,38,46,52]. Dell'Amico et al [13] introduced a method for obtaining exact solutions for the VRPSPD by combining dynamic programming, column generation and the branch-and-bound method.…”
Section: Solution Methodsmentioning
confidence: 99%
“…Bianchessi and Righini (2007) presented and compared several heuristic algorithms for the VRPSDP, in particular greedy insertion, local search, and tabu search procedures. Wassan, Wassan, and Nagy (2008) designed a reactive tabu search metaheuristic where an initial solution is constructed using a modification of the sweep algorithm (Gillett and Miller 1974 • set-partitioning or set-covering formulations containing a binary variable for every potential vehicle route as well as…”
Section: Literature Reviewmentioning
confidence: 99%