2009
DOI: 10.1016/j.cor.2008.03.008
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
69
2

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 72 publications
(73 citation statements)
references
References 12 publications
2
69
2
Order By: Relevance
“…Note that since we require that the vehicle leave and return to the depot without any bike, our problem is different to the problem considered in previous study (Hernandez-Perez and Salazar-Gonzalez 2002, 2004a, 2007Hernandez-Perez et al 2009;Louveaux and Salazar-Gonzalez 2008;Wang et al 2006;Zhao et al 2009), therefore our numerical results are not comparable to the results provided therein.…”
Section: Computational Experimentscontrasting
confidence: 58%
See 2 more Smart Citations
“…Note that since we require that the vehicle leave and return to the depot without any bike, our problem is different to the problem considered in previous study (Hernandez-Perez and Salazar-Gonzalez 2002, 2004a, 2007Hernandez-Perez et al 2009;Louveaux and Salazar-Gonzalez 2008;Wang et al 2006;Zhao et al 2009), therefore our numerical results are not comparable to the results provided therein.…”
Section: Computational Experimentscontrasting
confidence: 58%
“…In Zhao et al (2009), a genetic algorithm was applied to the 1-PDTSP problem. In Hernandez-Perez et al (2009), a hybrid greedy randomized adaptive search procedure with a variable neighborhood decent strategy (GRASP/VND) for the 1-PDTSP problem was studied. The latest study of the 1-PDTSP in Mladenovíc et al (2012) shows interesting results by taking combinations of variable neighborhood search.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Hernán-dez-Pérez and Salazar González (2007) presented new inequalities for the 1-PDTSP, and implemented an improved branch-and-cut algorithm for it. Hernández-Pérez, Rodríguez-Martín, and Salazar González (2008) proposed a new heuristic that combines the greedy randomized search procedure (GRASP) with variable neighborhood descent (VND) metaheuristics, and found some new best solutions for benchmark instances.…”
Section: Introductionmentioning
confidence: 99%
“…The experiments were tried on the benchmark instances of 1-PDTSP published by Hernandez-Perez in [4] available at http://webpages.ull.es/users/hhperez/PDsite/#XM94. The proposed benchmark instances are randomly generated in the following way.…”
Section: Experimental Designmentioning
confidence: 99%