A Comparative Analysis of Traveling Salesman Solutions from Geographic Information Systems

Transactions in GIS

Volumn 18, Issue 2, 2014, Pages 286-301

  Curtin, Kevin M ^a   Voicu, Gabriela ^b   Rice, Matthew T ^a   Stefanidis, Anthony ^a  

^a GEORGE MASON UNIVERSITY   (United States)

^b Medical Center of McKinney   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INFORMATION SYSTEMS; INFORMATION USE; LINEAR PROGRAMMING; OPTIMAL SYSTEMS; TRAVELING SALESMAN PROBLEM;

COMPARATIVE ANALYZES; COMPUTATIONAL RESULTS; CONTRAST-OPTIMAL; OPTIMAL SOLUTIONS; OPTIMALITY; PROBLEM SIZE; SCHOOL BUS ROUTING; SOLUTION PROCEDURE; SYSTEM PACKAGE; TRAVELLING SALESMAN;

GEOGRAPHIC INFORMATION SYSTEMS;

BUS TRANSPORT; COMPARATIVE STUDY; GIS; MATHEMATICAL ANALYSIS; OPTIMIZATION; SOFTWARE;

EID: 84896090242     PISSN: 13611682     EISSN: 14679671     Source Type: Journal    
DOI: 10.1111/tgis.12045     Document Type: Article

References (69)

1. Angel R, Caudle W, Noonan R, and Whinston A 1972 Computer assisted school bus scheduling. Management Science 18: 279-288
2. Applegate D, Bixby R, Chvatal V, and Cook W 1998 On the solution of traveling salesman problems. Documenta Mathematica 3: 645-656
3. Applegate D, Bixby R, Chvátal V, and Cook W 2003 Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming 97: 91-153
4. Archetti C, Speranza M, and Hertz A 2006 A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 40: 64-73
5. Balas E and Guinard M 1979 Branch and bound/implicit enumeration. Annual Discrete Mathemathics 5: 185-191
6. Bektas T 2006 The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega 34: 209-219
7. Bektas T and Elmastas S 2007 Solving school bus routing problems through integer programming. Journal of the Operational Research Society 58: 1599-1604
8. Bhargava H and Tettelbach C 1997 A web-based decision support system for waste disposal and recycling. Computers, Environment and Urban Systems 21: 47-65
9. Black P 2009 Metaheuristic. WWW document, http://xlinux.nist.gov/div897/sqg/dads/HTML/metaheuristic.html
10. Bodin L 1990 Twenty years of routing and scheduling. Operations Research 38: 571-579
11. Bodin L, Golden B, Assad A, and Ball M 1983 Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research 10(2): 65-211
12. Bowerman R, Hall B, and Calamai P 1995 A multi-objective optimization approach to urban school bus routing: Formulation and solution method. Transportation Research: Part A, Policy and Practice 29: 107-123
13. Church R L 2002 Geographical information systems and location science. Computers and Operations Research 29: 541-562
14. Church R L and Sorenson P 1994 Integrating Normative Location Models into GIS: Problems and Prospects with p-median Model. Santa Barbara, CA, National Center for Geographic Information and Analysis Technical Report No: 94-95
15. Cordeau J, Gendreau M, and Laporte G 1997 A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119
16. Cordeau J, Laporte G, and Mercier A 2001 A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52: 928-936
17. Cote J and Potvin J 2009 A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research 198: 464-469
18. Curtin K M 2007 Network analysis in geographic information science: Review, assessment, and projections. Cartography and Geographic Information Science 34: 103-111
19. Curtin K M 2008 Network data structures. In Kemp K (ed.) The Encyclopedia of Geographic Information Science. Thousand Oaks, CA, Sage: 314-317
20. Curtin K M, Hayslett-McCall K, and Qiu F 2010 Determining optimal police patrol areas with maximal covering and backup covering location models. Networks and Spatial Economics 10: 145-165
21. Dantzig G, Fulkerson D, and Johnson S 1954 Solution of a large scale traveling salesman problem. Journal of the Operations Research Society of America 2: 393-410
22. Evans J and Minieka E 1992 Optimization Algorithms for Networks and Graphs (Second Edition). New York, Marcel Dekker
23. Fiechter C 1994 A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51: 243-267
24. Fischer M 2004 GIS and network analysis. In Hensher D, Button K, Haynes K, and Stopher P (eds) Handbook of Transport Geography and Spatial Systems. Amsterdam, Elsevier: 391-408
25. Flood M 1956 The traveling-salesman problem. Operations Research 4: 61-75
26. Fugenschuh A 2009 Solving a school bus scheduling problem with Integer programming. European Journal of Operational Research 193: 867-884
27. Gamboa D, Rego C, and Glover F 2006 Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers and Operations Research 33: 1154-1172
28. Gendreau M 2003 An introduction to tabu search. In Glover F (ed.) Handbook of Metaheuristics. Dordrecht, Germany, Springer: 37-54
29. Gendreau M, Guertin F, Potvin J, and Taillard E 1999 Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33: 381-390
30. Gendreau M, Laporte G, and Seguin R 1996 A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44: 469-477
31. Glover F 1990 Tabu search: A tutorial. Interfaces 20: 74-94
32. Golden B, Bodin L, Doyle T, and Stewart J 1980 Approximate traveling salesman algorithms. Operations Research 28: 694-711
33. Golden B, Bodin L, and Goodwin T 1986 Microcomputer-based vehicle routing and scheduling software. Computers and Operations Research 13: 277-285
34. Goodchild M F 1992 Geographical information science. International Journal of Geographical Information Systems 6: 31-45
35. Gribkovskaia I, Laporte G, and Shlopak A 2008 A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms. Journal of the Operational Research Society 59: 1449-1459
36. Gutin G and Holloway R 2004 Traveling salesman problems. In Gross J and Yellen J (eds) Handbook of Graph Theory. Boca Raton, FL, CRC Press: 279-299
37. Gutin G and Punnen A 2002 The Traveling Salesman Problem and Its Variations (Volume 12). Dordrecht, Germany, Kluwer
38. Hoffman A and Wolfe P 1985 History. In Lawler E L, Lenstra J L, Rinnooy Kan A H G, and Shmoys D B (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester, John Wiley and Sons: 1-17
39. Hoffman K and Padberg M 2001 Traveling salesman problem. In Gass S L and Harris C M (eds) Encyclopedia of Operations Research and Management Science. Boston, MA, Kluwer: 849-852
40. Hollis M, Thompson R, and Baillie K 1985 Heuristic determination of postal delivery routes. Computers, Environment and Urban Systems 10: 57-67
41. Jung H, Lee K, and Chun W 2006 Integration of GIS, GPS, and optimization technologies for the effective control of parcel delivery service. Computers and Industrial Engineering 51: 154-162
42. Junger M, Reinelt G, and Rinaldi G 1997 The traveling salesman problem. In Martello S, Dell'Amico M, and Maffioli F (eds) Annotated Bibliographies in Combinatorial Optimization. Chichester, John Wiley and Sons: 199-221
43. Knox J 1994 Tabu search performance on the symmetrical traveling salesman problem. Computers and Operations Research 21: 867-876
44. Lawler E 2001 Combinatorial Optimization: Networks and Matroids. Mineola, NY, Dover Publications
45. Li L and Fu Z 2002 The school bus routing problem: A case study. Journal of the Operational Research Society 53: 552-558
46. Marinakis Y, Migdalas A, and Pardalos P 2005 A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10: 311-326
47. Marinakis Y, Migdalas A, and Pardalos P 2008 Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem. Optimization Letters 2: 351-361
48. Miller H and Shaw S 2001 Geographic Information Systems for Transportation. New York, Oxford University Press
49. Niemeier D and Beard M 1993 GIS and transportation planning: A case study. Computers, Environment and Urban Systems 17: 31-43
50. Niizuma D, Yasuda K, and Ishigame A 2006 Multi-point tabu search for traveling salesman problems. IEEJ Transactions on Electrical and Electronic Engineering 1: 126-129
51. Osman I 1993 Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41: 421-451
52. Punnen A 2002 The traveling salesman problem: Applications, formulations and variations. In Gutin G and Punnen A (eds) The Traveling Salesman Problem and Its Variations (Volume 12). Dordrecht, Germany, Kluwer: 1-28
53. Sandhu J 2001 GISList: Network Analyst (Vol. 2006). WWW document, http://spatialnews.geocomm.com/community/lists/viewmessage.phtml?id=9242
54. Sandhu J 2006 TSP Algorithm (Vol. 2006). Redlands, CA, Esri
55. Schrijver A 2005 On the history of combinatorial optimization (Till 1960). Discrete Optimization 12: 1-68
56. Simkowitz H 1988 Transportation applications of geographic information systems. Computers, Environment and Urban Systems 12: 253-271
57. Skiena S 2008 The Algorithm Design Manual (Second Edition). London, Springer-Verlag
58. Slavin H 2004 The role of GIS in land use and transport planning. In Hensher D, Button K, Haynes K, and Stopher P (eds) Handbook of Transport Geography and Spatial Systems. Amsterdam, Elsevier: 329-356
59. Sutton J and Visser J 2004 The role of GIS in routing and logistics. In Hensher D, Button K, Haynes K, and Stopher P (eds) Handbook of Transport Geography and Spatial Systems. Amsterdam, Elsevier: 357-374
60. Tsubakitani S and Evans J 1998 Optimizing tabu list size for the traveling salesman problem. Computers and Operations Research 25: 91-97
61. Vajda S 1961 Mathematical Programming. Reading, MA, Addison-Wesley
62. Vogt L, Poojari C, and Beasley J 2007 A tabu search algorithm for the single vehicle routing allocation problem. Journal of the Operational Research Society 58: 467-480
63. Voudouris C and Tsang E 1999 Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113: 469-499
64. Wassan N, Wassan A, and Nagy G 2008 A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization 15: 368-386
65. Waters N 1999 Transportation GIS: GIS-T. In Longley P A, Goodchild M F, Maguire D J, and Rhind D W (eds) Geographical Information Systems: Principles, Techniques, Management and Applications (Second Edition). Hoboken, NJ, John Wiley and Sons: 827-844
66. Weigel D and Cao B 1999 Applying GIS and OR techniques to solve Sears technician-dispatching and home delivery problems. Interfaces 29: 112-130
67. Wilson R 1996 Introduction to Graph Theory. Harlow, Essex, Longman
68. Xu J and Kelly J 1996 A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30: 379-393
69. Zachariadis E, Tarantilis C, and Kiranoudis C 2009 A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195: 729-743