A clustering approach to solve the multiple travelling salesmen problem

International Journal of Industrial and Systems Engineering

Volumn 1, Issue 3, 2006, Pages 372-387

  Chandran, Nishanth ^a   Narendran, T T ^b   Ganesh, K ^b  

^a University of California   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

clustering; logistics; multiple travelling salesman problem

Indexed keywords

EID: 39149095383     PISSN: 17485037     EISSN: 17485045     Source Type: Journal    
DOI: 10.1504/IJISE.2006.009794     Document Type: Article

References (46)

1. Anderberg, M.R. (1973) Cluster Analysis for Applications, Academic press, New York.
2. Angel, R.D., Caudle, W.L., Noonan, R. and Whinston, A. (1972) ‘Computer assisted school bus scheduling’, Management Science, Vol. 18, pp.279–288.
3. Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A., Naddef, D. and Rinaldi, G. (1995) Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Research Report 949-M, Université Joseph Fourier, Grenoble, France.
4. Basu, A., Elnagar, A. and Al-Hajj, A. (2000) ‘Efficient coordinated motion’, Mathematical and Computer Modelling, Vol. 31, pp.39–53.
5. Bedeian, A.W. and Mossholder, K.W. (2000) ‘On the use of the coefficient of variation as a measure of diversity’, Organizational Research Methods, Vol. 3, No. 3, pp.285–297.
6. Bektas, T. (2006) ‘The multiple traveling salesman problem: an overview of formulations and solution procedures’, Omega, Vol. 34, pp.209–219, Corrected Proof, Available online www.sciencedirect.com.
7. Bellmore, M. and Hong, S. (1974) ‘Transformation of multisalesmen problem to the standard traveling salesman problem’, Journal of the Association Computer Machinery, Vol. 21, pp.500–550.
8. Berenguer, X. (1979) ‘A characterization of linear admissible transformations for the m-travelling salesmen problem’, European Journal of Operational Research, Vol. 3, No. 3, pp.232–238.
9. Bezalel, G. and Kizhanathan, S. (1986) ‘An optimal solution method for large-scale multiple traveling salesmen problems’, Operations Research, Vol. 34, No. 5, pp.698–718.
10. Brummit, B. and Stentz, A. (1996) ‘Dynamic mission planning for multiple mobile robots’, Proceedings of the IEEE International Conference on Robotics and Automation, pp.2396–2401.
11. Brummit, B. and Stentz, A. (1998) ‘GRAMMPS: a generalized mission planner for multiple mobile robots’, Proceedings of the IEEE International Conference on Robotics and Automation, Lueven, Belgium.
12. Calvo, R.W. and Cordone, R. (2003) ‘A heuristic approach to the overnight security service problem’, Computers and Operations Research, Vol. 30, pp.1269–1287.
13. Carter, A.E. and Ragsdale, C.T. (2002) ‘Scheduling pre-printed newspaper advertising inserts using genetic algorithms’, Omega, Vol. 30, pp.415–421.
14. Conley, W.C. (1990) ‘Calculating the shortest air freight routes in Illinois’, Mathematical and Computer Modelling, Vol. 4, pp.268–273.
15. Gelinas, S., Desrochers, M., Desrosiers, J. and Solomon, M.M. (1995) ‘A new branching strategy for time constrained routing problems with application to backhauling’, Annals of Operations Research, Vol. 61, pp.91–109.
16. Gilbert, K.C. and Hofstra, R.B. (1992) ‘A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem’, Decision Sciences, Vol. 23, pp.250–259.
17. Golden, B.L., Laporte, G. and Taillard, E.D. (1997) ‘An adaptive memory heuristic for a class of vehicle routing problems with minmax objective’, Computers and Operations Research, Vol. 24, No. 5, pp.445–452.
18. Gorenstein, S. (1970) ‘Printing press scheduling for multi-edition periodicals’, Management Science, Vol. 16, No. 6, pp.373–383.
19. Jacques, D., Michel, S. and François, S. (1988) ‘Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows’, Management Science, Vol. 34, No. 8, pp.1005–1023.
20. Jean-Yves, P. (1993) ‘The traveling salesman problem: a neural network perspective’, ORSA Journal on Computing, Vol. 5, No. 4, pp.328–348.
21. Kara, I. and Bektas, T. (2005) ‘Integer linear programming formulations of multiple salesman problems and its variations’, European Journal of Operational Research, Corrected Proof, Available online, 13 th June, www.sciencedirect.com.
22. Kim, K.H. and Park, Y. (2004) ‘A crane scheduling method for port container terminals’, European Journal of Operational Research, Vol. 156, pp.752–768.
23. Laporte, G. and Nobert, Y. (1980) ‘A cutting planes algorithms for the m-salesmen problem’, Operations Research Quarterly, Vol. 31, pp.1017–1023.
24. Laporte, G. and Osman, I.H. (1995) ‘Routing problems: a bibliography’, Annals of Operational Research, Vol. 61, pp.227–262.
25. Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R. and Shmoys, D.B. (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester.
26. Lenstra, J.K. and Kan, A.H.G.R. (1975) ‘Some simple applications of the traveling salesman problem’, Operational Research Quarterly, Vol. 26, pp.717–733.
27. Lin, S. (1965) ‘Computer solutions of the traveling salesman problem’, The Bell System, Technical Journal, Vol. 44, pp.2245–2269.
28. Lo, Z.P. and Bavarian, B. (1993) ‘Multiple job scheduling with artificial neural networks’, Computers and Electrical Engineering, Vol. 19, No. 2, pp.87–101.
29. Mitrović-Minić, S. and Krishnamurti, R. (2006) ‘The multiple TSP with time windows: vehicle bounds based on precedence graphs’, Operations Research Letters, Vol. 34, pp.111–120, Corrected Proof, Available Online, www.sciencedirect.com.
30. Modares, A., Somhom, S. and Enkawa, T. (1999) ‘A self organizing neural network approach for the multiple traveling salesmen and vehicle routing problems’, International Transactions in Operational Research, Vol. 6, pp.591–606.
31. Okonjo-Adigwe, C. (1988) ‘An effective method of balancing the workload amongst salesmen’, Omega, Vol. 16, No. 2, pp.159–163.
32. Park, Y.B. (2001) ‘A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines’, International Journal of Productions Economics, Vol. 73, No. 2, pp.175–188.
33. Radharamanan, R. and Choi, L.I. (1986) ‘A branch and bound algorithm for the travelling salesman and the transportation routing problems’, Computers and Industrial Engineering, Vol. 11, Nos. 1–4, pp.236–240.
34. Reinelt (1991) ‘TSPLIB-A traveling salesman problem library’, ORSA Journal on Computing, Vol. 3, pp.376–384.
35. Ryan, J.L., Bailey, T.G., Moore, J.T. and Carlton, W.B. (1998) ‘Reactive Tabu search in unmanned aerial reconnaissance simulations’, Proceedings of the 1998 Winter Simulation Conference, Washington, DC, USA, Vol. 1, pp.873–879.
36. Saleh, H.A. and Chelouah, R. (2004) ‘The design of the global navigation satellite system surveying networks using genetic algorithms’, Engineering Applications of Artificial Intelligence, Vol. 17, pp.111–122.
37. Saman, H. and Manfred, W.P. (1977) ‘A note on the symmetric multiple traveling salesman problem with fixed charges’, Operations Research, Vol. 25, No. 5, pp.871–875.
38. Shechtman, O. (1999) ‘Is the coefficient of variation a valid measure for detecting sincerity of effort of grip strength?’, Work, Vol. 13, pp.163–169.
39. Solomon, M.M. and Jacques, D. (1988) ‘Time window constrained routing and scheduling problems’, Transportation Science, Vol. 22, No. 1, pp.1–14.
40. Somhom, S., Modares, A. and Enkawa, T. (1999) ‘Competition-based neural network for the multiple travelling salesmen problem with minmax objective’, Computers and Operations Research, Vol. 26, No. 4, pp.395–407.
41. Svestka, J.A. and Huckfeldt, V.E. (1973) ‘Computational experience with an m-salesman traveling salesman algorithm’, Management Science, Vol. 19, No. 7, pp.790–799.
42. Tang, L., Liu, J., Rong, A. and Yang, Z. (2000) ‘A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex’, European Journal of Operational Research, Vol. 124, No. 2, pp.267–282.
43. Torki, A., Somhon, S. and Enkawa, T. (1997) ‘A competitive neural network algorithm for solving vehicle routing problem’, Computers and Industrial Engineering, Vol. 33, Nos. 3–4, pp.473–476.
44. Wang, X. and Regan, A.C. (2002) ‘Local truckload pickup and delivery with hard time window constraints’, Transportation Research Part B, Vol. 36, pp.97–112.
45. Yu, Z., Jinhai, L., Guochang, G., Rubo, Z. and Haiyan, Y. (2002) ‘An implementation of evolutionary computation for path planning of cooperative mobile robots’, Proceedings of the Fourth World Congress on Intelligent Control and Automation, Shanghai, China, Vol. 3, pp.1798–802.
46. Zhang, T., Gruver, W.A. and Smith, M.H. (1999) ‘Team scheduling by genetic search’, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials, Honolulu, Hawaii, Vol. 2, pp.839–844.