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

Computers and Operations Research

Volumn 36, Issue 5, 2009, Pages 1639-1645

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

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

GRASP; Hybrid heuristic; Pickup and delivery; Traveling salesman problem; VND

Indexed keywords

CUSTOMER SATISFACTION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PICKUPS; SALES;

APPROXIMATE ALGORITHMS; CAPACITATED VEHICLES; COMPUTATIONAL EXPERIMENTS; GRASP; HYBRID ALGORITHMS; HYBRID HEURISTIC; HYBRID METHODS; INITIAL LOADS; METAHEURISTICS; MINIMUM COSTS; PICKUP AND DELIVERY; SET OF CUSTOMERS; SINGLE PRODUCTS; TRAVELING SALESMAN; VND;

TRAVELING SALESMAN PROBLEM;

EID: 55749095748     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.03.008     Document Type: Article

References (18)

1. Hernández-Pérez H., and Salazar-González J.J. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 38 (2004) 245-255
2. Anily S., and Bramel J. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics 46 (1999) 654-670
3. Chalasani P., and Motwani R. Approximating capacitated routing and delivery problems. SIAM Journal on Computing 28 (1999) 2133-2149
4. Wang F., Lim A., and Xu Z. The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48 (2006) 24-35
5. Hernández-Pérez H. Traveling salesman problems with pickups and deliveries. Dissertation, University of La Laguna, Spain; 2004.
6. Hernández-Pérez H., and Salazar-González J.J. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics 145 (2004) 126-139
7. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 (1995) 17-29
8. Parragh SN, Doerner K, Hartl RF. A survey on pickup and delivery models Part I: transportation between customers and depot. Working paper, Chair of Production and Operations Management, University of Vienna; 2006.
9. Parragh SN, Doerner K, Hartl RF. A survey on pickup and delivery models Part II: transportation between pickup and delivery locations. Working paper, Chair of Production and Operations Management, University of Vienna; 2006.
10. Berbeglia G., Cordeau J.-F., Gribkovskaia I., and Laporte G. Static pickup and delivery problems: a classification scheme and survey. TOP 15 (2007) 45-47
11. Feo T.A., and Resende M.G.C. Greedy randomized adaptative search procedures. Journal of Global Optimization 6 (1995) 109-133
12. Festa P., and Resende M.G.C. GRASP: an annotated bibliography. In: Ribeiro C.C., and Hansen P. (Eds). Essays and surveys in metaheuristics (2002), Kluwer Academic Publishers, Dordrecht
13. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptative search procedures. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics. Kluwer's international series in operations research and management science (2002), Kluwer Academic Publishers, Norwell
14. Mladenović N., and Hansen P. Variable neighborhood search. Computers & Operations Research 24 (1997) 1097-1100
15. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
16. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study in local optimization. In: Aarts E.J.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), Wiley, Chichester, UK
17. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
18. Mosheiov G. The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 79 (1994) 299-310