Advertisement

Networks and Spatial Economics

, Volume 18, Issue 4, pp 773–801 | Cite as

Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case

  • Haluk YapiciogluEmail author
Article
  • 212 Downloads

Abstract

This study arises from a real world problem. In the problem, a number of university representatives are required to visit a number of exam locations departing from a central location and returning back to the same location. Each location may be visited in one of four different periods; however these visits must be done in pre-specified time windows. Time windows may be different from location to location and across periods for the same location. The problem is modeled as a multi-period multi traveling salesmen problem with time window constraints. Earlier attempts to solve the resulting models using mixed integer linear programming approach proved to be ineffective. Hence two stochastic heuristic search techniques, based on simulated annealing (SA) and robust tabu search (RTS), are used. For this, a new solution representation and associated decoding and encoding mechanisms are developed. Proposed approaches are tested on various problem instances, and performance of the solution approaches are discussed. Finally, a real case is considered for which a method for obtaining travel distance and travel time matrices from Google Distance Matrix API is developed. The results obtained from the real case is also discussed and future research directions are provided.

Keywords

Multi Traveling Salesmen Problem Time Windows Simulated Annealing Robust Tabu Search 

Notes

Acknowledgements

This study was supported by Anadolu University Scientific Research Projects Commission under the grant no: 1506F495. The author would like to thank the anonymous reviewers and the Editor-in-Chief for their helpful and constructive comments that greatly contributed to improving the final version of the paper.

References

  1. Abareshi M, Zaferanieh M, Keramati B (2017) Path Flow Estimator in an Entropy Model Using a Nonlinear L-Shaped Algorithm. Netw Spat Econ 17(1):293–315CrossRefGoogle Scholar
  2. Adler JD, Mirchandani PB, Xue G, Xia M (2016) The Electric Vehicle Shortest-Walk Problem with Battery Exchanges. Netw Spat Econ 16(1):155–173CrossRefGoogle Scholar
  3. Ando N, Taniguchi E (2006) Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows. Netw Spat Econ 6(3):293–311CrossRefGoogle Scholar
  4. Antosiewicz M, Koloch G, Kamiński B (2013) Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed. J Theor Appl Comput Sci 7(1):46–55Google Scholar
  5. Applegate DL, Bixby RE, Chvátal V, Cook WJ (2011) The Traveling Salesman Problem: A Computational Study. Princeton University Press, PrincetonGoogle Scholar
  6. Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209–219CrossRefGoogle Scholar
  7. Boyles SD, Waller ST (2011) Optimal Information Location for Adaptive Routing. Netw Spat Econ 11(2):233–254CrossRefGoogle Scholar
  8. Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur J Oper Res 175(1):246–257CrossRefGoogle Scholar
  9. Chu JC, Yan S, Huang H-J (2017) A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times. Netw Spat Econ 17(1):41–68CrossRefGoogle Scholar
  10. Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. Oper Res 2:393–410Google Scholar
  11. de Grange L, Gonzalez F, Bekhor S (2016) Path Flow and Trip Matrix Estimation Using Link Flow Density. Netw Spat Econ 17(1):173–195CrossRefGoogle Scholar
  12. Du JY, Brunner JO, Kolisch R (2014) Planning towing processes at airports more efficiently. Transport Res E Log 70:293–304CrossRefGoogle Scholar
  13. Escuín D, Millán C, Larrodé E (2012) Modelization of Time-Dependent Urban Freight Problems by Using a Multiple Number of Distribution Centers. Netw Spat Econ 12(3):321–336CrossRefGoogle Scholar
  14. Gilbert KC, Hofstra RB (1992) A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem. Decis Sci 23(1):250–259CrossRefGoogle Scholar
  15. Glover F (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Comput Oper Res 13(5):533–549CrossRefGoogle Scholar
  16. Glover F (1989) Tabu Search - Part 1. ORSA J Comput 1(2):190–206CrossRefGoogle Scholar
  17. Glover F (1990) Tabu Search - Part 2. ORSA J Comput 2(1):4–32CrossRefGoogle Scholar
  18. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, NorwellCrossRefGoogle Scholar
  19. Han L, Luong BT, Ukkusuri T, Tito (2016) An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot. Netw Spat Econ 16(3):743–768CrossRefGoogle Scholar
  20. Hill AV, Benton WC (1992) Modelling Intra-City Time Dependent Travel Speeds for Vehicle Scheduling Problems. J Oper Res Soc 43(4):343–351CrossRefGoogle Scholar
  21. Hsu Y-T, Peeta S (2015) Clearance Time Estimation for Incorporating Evacuation Risk in Routing Strategies for Evacuation Operations. Netw Spat Econ 15(3):743–764CrossRefGoogle Scholar
  22. Jafari E, Boyles SD (2017) Multicriteria Stochastic Shortest Path Problem for Electric Vehicles. Netw Spat Econ.  https://doi.org/10.1007/s11067-017-9358-x
  23. Kara İ, Bektas T (2006) Integer Linear Programming Formulations of Multiple Salesman Problems and its Variations. Eur J Oper Res 174:1449–1458CrossRefGoogle Scholar
  24. Karp RM (1972) Reducibility Among Combinatorial Problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85–103CrossRefGoogle Scholar
  25. Király A, Abonyi J (2011) Optimization of multiple traveling salesmen problem by a novel representation based genetic algorithm. Intell Comput Optim Eng 366:241–269Google Scholar
  26. Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by Simulated Annealing. Science 220(4598):671–680CrossRefGoogle Scholar
  27. Li Q, Nie Y, Vallamsundar S, Lin J, Homem-de-Mello T (2016) Finding Efficient and Environmentally Friendly Paths for Risk-Averse Freight Carriers. Netw Spat Econ 16(1):255–275CrossRefGoogle Scholar
  28. List of largest universities by enrollment (2015) Retrieved from http://en.wikipedia.org/wiki/List_of_largest_universities_by_enrollment. Accessed 06 Nov 2015
  29. Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21(1):59–84CrossRefGoogle Scholar
  30. Menger K (1930) Das botenproblem. In: Menger K (ed) Ergebnisse eines Mathematischen Kolloquiums 2. Teubner, Leipzig, pp 11–12Google Scholar
  31. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulations and traveling salesman problems. J Assoc Comput Mach 7:326–329CrossRefGoogle Scholar
  32. Park YB (2001) A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. Int J Prod Econ 73:175–188CrossRefGoogle Scholar
  33. Reeves CR (1995) Modern heuristic techniques for combinatorial problems. McGraw Hill Book Co., LondonGoogle Scholar
  34. Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13:95–101CrossRefGoogle Scholar
  35. Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4–5):443–455CrossRefGoogle Scholar
  36. Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling schedule in Shanghai Baoshan Iron& Steel Complex. Eur J Oper Res 124:267–282CrossRefGoogle Scholar
  37. Trigui S, Cheikhrouhou O, Koubaa A, Baroudi U, Youssef H (2016) FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems. Soft Comput.  https://doi.org/10.1007/s00500-016-2279-7
  38. Ukkusuri SV, Hasan S, Luong B, Doan K, Zhan X, Murray-Tuite P, Yin W (2017) A-RESCUE: An Agent based regional evacuation simulator coupled with user enriched behavior. Netw Spat Econ 17(1):197–223CrossRefGoogle Scholar
  39. Venkatesh P, Singh A (2015) Two metaheuristic approaches for the multiple traveling salesperson problem. Appl Soft Comput 26:74–89CrossRefGoogle Scholar
  40. Xu X, Yuan H, Liptrott M, Trovati M (2017) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput.  https://doi.org/10.1007/s00500--017-2705-5
  41. Yan S, Hsiao F-Y, Chen Y-C (2015) Inter-School Bus Scheduling Under Stochastic Travel Times. Netw Spat Econ 15(4):1049–1074CrossRefGoogle Scholar
  42. Yapicioglu H (2014) Multiperiod Multi Traveling Salesmen Problem under Time Window Constraints (in Turkish). Anadolu University J Sci Technol A 15(2):113–124CrossRefGoogle Scholar
  43. Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur J Oper Res 228(1):72–82CrossRefGoogle Scholar
  44. Zhang J, Lam WHK, Chen BY (2013) A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service. Netw Spat Econ 13(4):471–496CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017
corrected publication October/2017

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAnadolu UniversityEskisehirTurkey

Personalised recommendations