An iterated local search algorithm for the travelling salesman problem with pickups and deliveries

Journal of the Operational Research Society

Volumn 64, Issue 3, 2013, Pages 402-409

  Subramanian, A ^a   Battarra, M ^b  

^a FEDERAL UNIVERSITY OF PARAÍBA   (Brazil)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Heuristics; Iterated local search; Pickup and delivery; Travelling salesman

Indexed keywords

LOCAL SEARCH (OPTIMIZATION); PICKUPS;

COMPUTATIONAL TIME; HEURISTICS; HIGH-QUALITY SOLUTIONS; ITERATED LOCAL SEARCH; PICKUP AND DELIVERY; TRAVELLING SALESMAN; TRAVELLING SALESMAN PROBLEM; VARIABLE NEIGHBOURHOOD DESCENT;

TRAVELING SALESMAN PROBLEM;

EID: 84873911958     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.24     Document Type: Article

References (31)

1. Altinel. IK and Ö ncan T (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society 56(8): 954-961
2. Anily S and Mosheiov G (1994). The traveling salesman problem with delivery and back-hauls. Operations Research Letters 16(1): 11-18
3. Applegate DL, Bixby RE, Chvá tal V and Cook WL (2007). The Traveling Salesman Problem: A Computational Study. Princeton University Press: Princeton, NJ.
4. Baldacci R, Hadjiconstantinou E and Mingozzi A (2003). An exact algorithm for the traveling salesman problem with deliveries and collections. Networks 42(1): 26-41
5. Battarra M, Benedettini S and Roli A (2011). Leveraging savingbased algorithms by master-slave genetic algorithms. Engineering Applications of Artificial Intelligence 24(4): 555-566
6. Berbeglia G, Cordeau J-F, Gribkovskaia I and Laporte G (2007). Static pickup and delivery problems: A classification scheme and survey. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 15(1): 1-31
7. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. Journal of the Operational Research Society 53(5): 512-522
8. Croes GA (1958). A method for solving traveling-salesman problems. Operations Research 6(6): 791-812
9. Dongarra J (2010). Performance of various computers using standard linear equations software. (Linpack Benchmark Report). Technical report, University of Tennessee Computer Science, CS-89-85
10. Erdog an G, Cordeau J-F and Laporte G (2009). The pickup and delivery traveling salesman problem with first-infirst- out loading. Computers. *Operations Research 36(6): 1800-1808
11. Erdogan G, Battarra M, Laporte G and Vigo D (2012). Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Computers. *Operations Research 39(5): 1074-1086
12. Finke G, Claus A and Gunn E (1984). A two-commodity network flow approach to the traveling salesman problem. Congressus Numerantium 41(1): 167-178
13. Fischetti M and Lodi A (2003). Local branching. Mathematical Programming 98(1): 23-47
14. Gaskell TJ (1967). Bases for vehicle fleet scheduling. Operational Research Quarterly 18(3): 281-295
15. Gavish B (1991). Topological design of telecommunication networks- local access design methods. Annals of Operations Research 33(1): 17-71
16. Gendreau M, Laporte G and Vigo D (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers.Operations Research 26(7): 699-714
17. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Computers.Operations Research 5(5): 533-549
18. Gribkovskaia I, Laporte G and Shyshou A (2008). The single vehicle routing problem with deliveries and selective pickups. Computers.Operations Research 35(9): 2908-2924
19. Hernández-Pérez H and Salazar-González J-J (2003). The onecommodity pickup-and-delivery travelling salesman problem. In: Jünger M, Reinelt G, and Rinaldi G (eds). Combinatorial Optimization - Eureka, you Shrink. Springer-Verlag: New York, pp 89-104
20. Herna'ndez-Pe'rez H and Salazar-González J-J (2004). Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 38(2): 245-255
21. Herna'ndez-Pe'rez H and Salazar-González J-J (2007). The onecommodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50(4): 258-272
22. Ladany SP and Mehrez A (1984). Optimal routing of a single vehicle with loading and unloading constraints. Transportation Planning and Technology 8(4): 301-306
23. Lourenco HR, Martin OC and Stutzle T (2003). Iterated local search. In: Glover F and Kochenberger GA (eds). Handbook of Metaheuristics. Kluwer: Boston, MA, pp 321-353
24. Martin O, Otto SW and Felten EW (1991). Large-step Markov chains for the traveling salesman problem. Complex Systems 5(3): 299-326
25. Mosheiov G (1994). The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 79(2): 299-310
26. Or I (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD Thesis, Northwestern University
27. Penna PHV, Subramanian A and Ochi LS (2011). An iterated local search heuristic for the heterogenous fleet vehicle routing problem. Journal of Heuristics, http://dx.doi.org/10.1007/s10732- 011-9186-y, published online 8 September
28. Pisinger D and Ropke S (2007). A general heuristic for vehicle routing problems. Computers.Operations Research 34(8): 2403-2435
29. Ropke S and Pisinger D (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 171(3): 750-775
30. Subramanian A, Uchoa E and Ochi L (2010). New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. In: Festa P (ed). Experimental Algorithms. Vol. 6049 of Lecture Notes in Computer Science. Springer: Berlin, Heidelberg, pp 276-287
31. Zhao F-G, Sun J-S, Li S-J and Liu W-M (2009). A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery. International Journal of Automation and Computing 6(1): 97-102