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

Hernández-Pérez, Hipólito; Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José

doi:10.1016/j.cor.2008.03.008

Cited by 71 publications

(73 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

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%

“…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%

“…In this model the authors assume that the depot (the source and the sink node) has infinite capacity. This problem and its variants have received significant attention in the last few years because of their application to many logistics problems Salazar-Perez 2004a, b, 2007;Hernandez-Perez et al 2009;Louveaux and Salazar-Gonzalez 2008).…”

Section: Introductionmentioning

confidence: 98%

See 2 more Smart Citations

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

2015

View full text Add to dashboard Cite

In this paper we study the one commodity pickup-and-delivery traveling salesman problem with restricted depot (1-PDTSP-RD), which is a generalization of the classical traveling salesman problem (TSP). We first introduce a polynomial size integer programming formulation for the problem and then study the feasibility issue which is shown to be N P-complete by itself. In particular, we prove sufficient conditions for the feasibility of the problem and provide a polynomial algorithm to find a feasible solution. We also develop a bound on the cost of the 1-PDTSP-RD solution in terms of the cost of the TSP solution. Based on this bound, we provide a heuristic algorithm to solve the 1PDTSP-RD. Extensive numerical experiments are performed to evaluate the efficiency of both the exact and approximation algorithms.

show abstract

Section: Computational Experimentscontrasting

confidence: 58%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

2015

View full text Add to dashboard Cite

show abstract

“…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%

Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

Zhao

Sun

et al. 2009

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…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%

A DSS Based on Hybrid Meta-Heuristic ILS-VND for Solving the 1-PDTSP

Yahyaoui¹,

Krichen²

2015

Artificial Intelligence and Soft Computing

View full text Add to dashboard Cite

Abstract. The one-commodity pickup-and-delivery travelling salesman problem is a well known combinatorial optimization problem applied in numerous practical situations. It consists of a set of customers dispersed on a geographical area and a vehicle with a predefined capacity that must not be exceeded. The vehicle starts from a depot, and should visit each customer only once then end at at the depot. The objective is to minimize the total length of the traveled path way. As the 1-PDTSP is known to be NP-hard, meta-heuristics perform well when generating solutions in a reasonable computation time. In this paper, we propose a hybrid-meta-heuristic Iterated Local search with Variable Neighborhood Descent (ILS-VND). In order to demonstrate the performance of the proposed approach in term of solution quality, we apply it on benchmark instances. Our approach is also applied in a real case on the city of Jendouba in the north west of Tunisia. The results are then highlighted in a cartographic format using Google Maps.

show abstract

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

Cited by 71 publications

References 12 publications

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

A DSS Based on Hybrid Meta-Heuristic ILS-VND for Solving the 1-PDTSP

Contact Info

Product

Resources

About