New imperialist competitive algorithm to solve the travelling salesman problem

International Journal of Computer Mathematics

Volumn 90, Issue 7, 2013, Pages 1495-1505

  Yousefikhoshbakht, Majid ^a   Sedighpour, Mohammad ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Imperialist competitive algorithm; Local search; Order crossover; Travelling salesman problem

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

COMPUTATIONAL ALGORITHM; IMPERIALIST COMPETITIVE ALGORITHM (ICA); IMPERIALIST COMPETITIVE ALGORITHMS; LOCAL SEARCH; META HEURISTIC ALGORITHM; ORDER CROSSOVER; TRAVELLING SALESMAN PROBLEM; TRAVELLING SALESMAN PROBLEM (TSP);

PROBLEM SOLVING;

EID: 84875198092     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160.2012.758362     Document Type: Article

References (32)

1. R.D. Angel, W.L. Caudle, R. Noonan, and A. Whinston, Computer assisted school bus scheduling, Manag. Sci. 18 (1972), pp. 279-288.
2. E. Atashpaz-Gargari, F. Hashemzadeh, R. Rajabioun, and C. Lucas, Colonial Competitive Algorithm, a novel approach for PID controller design in MIMO distillation column process, Int. J. Intell. Comput. Cybernet. 1(3) (2008), pp. 337-355.
3. A. Biabangard-Oskouyi, E. Atashpaz-Gargari, N. Soltani, and C. Lucas, Application of imperialist competitive algorithm for materials property characterization from sharp indentation test, Int. J. Eng. Simul. 10(1) (2009), pp. 1-8.
4. B. Brummit and A. Stentz, GRAMMPS: A Generalized Mission Planner for Multiple Mobile Robots, Proceedings of the IEEE International Conference on Robotics and Automation, Lueven, Belgium, 1998.
5. G. Carpaneto and P. Toth, Some new branching and bounding criteria for the asymmetric travelling salesman problem, Manag. Sci. 26 (1980), pp. 736-743.
6. S.M. Chen and C.Y. Chien, Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques, Expert Syst. Appl. 38 (2011), pp. 14439-14450.
7. I.C. Choi, S.I. Kim, and H.S. Kim, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Comput. Oper. Res. 30(5) (2003), pp. 773-786.
8. N. Christofides, A. Mingozzi, and P. Toth, The vehicle routing problem, in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, eds, JohnWiley & Sons, Chichester, UK, 1979, pp. 315-338.
9. G. Clarke and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964), pp. 568-581.
10. J.F. Cordeau, M. Dell’Amico, and M. Iori, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Comput. Oper. Res. 37(5) (2010), pp. 970-980.
11. M. Dorigo and T. Stutzle, The ant colony optimization metaheuristic: Algorithm, applications, and advances, in Handbook of Metaheuristics, F. Glover and G.A. Kochenberger, eds., Kluwer Academic Publishers, Boston, 2003, pp. 55-82.
12. M. Dorigo and T. Stutzle, Ant Colony Optimization, The MIT Press, Cambridge, MA, 2004.
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
14. S. Ghafurian and N. Javadian, An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems, Appl. Soft Comput. 11(1) (2011), pp. 1256-1262.
15. K.C. Gilbert and R.B. Hofstra, A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem, Decision Sci. 23 (1992), pp. 250-259.
16. B.E. Gillett and L.R. Miller, Aheuristic algorithm for the vehicle dispatch problem, Oper. Res. 22 (1974), pp. 340-349.
17. S. Gorenstein, Printing press scheduling for multi-edition periodicals, Manag. Sci. 16(6) (1970), pp. 373-383.
18. A. Homaifar, S. Guan, and E. Gunar, Liepins. Schema analysis of the traveling salesman problem using genetic algorithms, Complex Syst. 6(2) (1992), pp. 183-217.
19. A. Kaveh and S. Talatahari, Optimum design of skeletal structures using imperialist competitive algorithm, Comput. Struct. 88 (2010), pp. 1220-1229.
20. V.V. Kureichik and V.M. Kureichik, A genetic algorithm for finding a salesman’s route, J. Comput. Syst. Sci. Int. 45(1) (2006), pp. 89-95.
21. C. Lucas, Z. Nasiri-Gheidari, and F. Tootoonchian, Application of an imperialist competitive algorithm to the design of a linear induction motor, Energy Convers. Manage. 51 (2010), pp. 1407-1411.
22. T.A.S. Masutti and L.N.D. Castro, A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem, Inform. Sci. 179(10) (2009), pp. 1454-1468.
23. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 2nd (extended) ed., Springer, New York, 1994.
24. R. Rajabioun, E. Atashpaz-Gargari, and C. Lucas, Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement, Lecture Notes in Comput. Sci. 5073 (2008), pp. 680-695.
25. S. Rathinam and R. Sengupta, Lower and upper bounds for a symmetric multiple depot, multiple travelling salesman problem, Research Report, UCB-ITSRR-2006-2, Institute of Transportation Studies, University of California, Berkeley, 2006.
26. H. Sepehri Rad and C. Lucas, Application of Imperialistic Competition Algorithm in Recommender Systems, Proceedings of the 13th International CSI Computer Conference (CSICC’08), Kish Island, Iran, 2008.
27. E. Shokrollahpour, M. Zandieh, and B. Dorri, A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem, Int. J. Product. Res. (2010), pp. 1-17.
28. L. Tang, J. Liu, A. Rong, and Z. Yang, A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex, European J. Oper. Res. 124 (2000), pp. 267-282.
29. L.P. Wong, M.Y.H. Low, and C.S. Chong, A bee colony optimization algorithm for traveling salesman problem, Second Asia International Conference on Modeling & Simulation (AICMS 08), School of Computer Engineering, Nanyang Technological University, Singapore, 13-15 May, 2008, pp. 818-823.
30. J. Wroblewski, Theoretical foundations of order-based genetic algorithms, Fund. Inform. 28(3-4) (1996), pp. 423-430.
31. S. Yadlapalli, W.A. Malik, S. Darbha, and M. Pachter, A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem, Nonlinear Anal. Real World Appl. 10(4) (2009), pp. 1990-1999.
32. W.-L. Zhong, J. Zhang, and W.-N. Chen, A novel discrete particle swarm optimization to solve traveling salesman problem, IEEE Congress on Evolutionary Computation (CEC), 25-28 Sept, 2007, pp. 3283-3287.