New Imperialist Competitive Algorithm to solve the travelling salesman problem

References

• Angel , R. D. , Caudle , W. L. , Noonan , R. and Whinston , A. 1972 . Computer assisted school bus scheduling . Manag. Sci. , 18 : 279 – 288 . (doi:10.1287/mnsc.18.6.B279)
   Web of Science ®Google Scholar
• Atashpaz-Gargari , E. , Hashemzadeh , F. , Rajabioun , R. and Lucas , C. 2008 . Colonial Competitive Algorithm, a novel approach for PID controller design in MIMO distillation column process . Int. J. Intell. Comput. Cybernet. , 1 ( 3 ) : 337 – 355 . (doi:10.1108/17563780810893446)
   Google Scholar
• Biabangard-Oskouyi , A. , Atashpaz-Gargari , E. , Soltani , N. and Lucas , C. 2009 . Application of imperialist competitive algorithm for materials property characterization from sharp indentation test . Int. J. Eng. Simul. , 10 ( 1 ) : 1 – 8 .
   Google Scholar
• 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.
   Google Scholar
• Carpaneto , G. and Toth , P. 1980 . Some new branching and bounding criteria for the asymmetric travelling salesman problem . Manag. Sci. , 26 : 736 – 743 . (doi:10.1287/mnsc.26.7.736)
   Web of Science ®Google Scholar
• Chen , S. M. and Chien , C. Y. 2011 . Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques . Expert Syst. Appl. , 38 : 14439 – 14450 . (doi:10.1016/j.eswa.2011.04.163)
   Web of Science ®Google Scholar
• Choi , I. C. , Kim , S. I. and Kim , H. S. 2003 . A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem . Comput. Oper. Res. , 30 ( 5 ) : 773 – 786 . (doi:10.1016/S0305-0548(02)00050-3)
   Web of Science ®Google Scholar
• Christofides , N. , Mingozzi , A. and Toth , P. 1979 . “ The vehicle routing problem ” . In Combinatorial Optimization , Edited by: Christofides , N. , Mingozzi , A. , Toth , P. and Sandi , C. 315 – 338 . Chichester , , UK : John Wiley & Sons .
   Google Scholar
• Clarke , G. and Wright , J. W. 1964 . Scheduling of vehicles from a central depot to a number of delivery points . Oper. Res. , 12 : 568 – 581 . (doi:10.1287/opre.12.4.568)
   Web of Science ®Google Scholar
• Cordeau , J. F. , Dell'Amico , M. and Iori , M. 2010 . Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading . Comput. Oper. Res. , 37 ( 5 ) : 970 – 980 . (doi:10.1016/j.cor.2009.08.003)
   Web of Science ®Google Scholar
• Dorigo , M. and Stutzle , T. 2003 . “ The ant colony optimization metaheuristic: Algorithm, applications, and advances ” . In Handbook of Metaheuristics , Edited by: Glover , F. and Kochenberger , G. A. 55 – 82 . Boston : Kluwer Academic Publishers .
   Google Scholar
• Dorigo , M. and Stutzle , T. 2004 . Ant Colony Optimization , Cambridge , MA : The MIT Press .
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco : W.H. Freeman .
   Google Scholar
• Ghafurian , S. and Javadian , N. 2011 . An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems . Appl. Soft Comput. , 11 ( 1 ) : 1256 – 1262 . (doi:10.1016/j.asoc.2010.03.002)
   Web of Science ®Google Scholar
• Gilbert , K. C. and Hofstra , R. B. 1992 . A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem . Decision Sci. , 23 : 250 – 259 . (doi:10.1111/j.1540-5915.1992.tb00387.x)
   Web of Science ®Google Scholar
• Gillett , B. E. and Miller , L. R. 1974 . A heuristic algorithm for the vehicle dispatch problem . Oper. Res. , 22 : 340 – 349 . (doi:10.1287/opre.22.2.340)
   Web of Science ®Google Scholar
• Gorenstein , S. 1970 . Printing press scheduling for multi-edition periodicals . Manag. Sci. , 16 ( 6 ) : 373 – 383 . (doi:10.1287/mnsc.16.6.B373)
   Web of Science ®Google Scholar
• Homaifar , A. , Guan , S. and Gunar , E. 1992 . Liepins. Schema analysis of the traveling salesman problem using genetic algorithms . Complex Syst. , 6 ( 2 ) : 183 – 217 .
   Google Scholar
• Kaveh , A. and Talatahari , S. 2010 . Optimum design of skeletal structures using imperialist competitive algorithm . Comput. Struct. , 88 : 1220 – 1229 . (doi:10.1016/j.compstruc.2010.06.011)
   Web of Science ®Google Scholar
• Kureichik , V. V. and Kureichik , V. M. 2006 . A genetic algorithm for finding a salesman's route . J. Comput. Syst. Sci. Int. , 45 ( 1 ) : 89 – 95 . (doi:10.1134/S1064230706010102)
   Web of Science ®Google Scholar
• Lucas , C. , Nasiri-Gheidari , Z. and Tootoonchian , F. 2010 . Application of an imperialist competitive algorithm to the design of a linear induction motor . Energy Convers. Manage. , 51 : 1407 – 1411 . (doi:10.1016/j.enconman.2010.01.014)
   Web of Science ®Google Scholar
• Masutti , T. A.S. and Castro , L. N.D. 2009 . A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem . Inform. Sci. , 179 ( 10 ) : 1454 – 1468 . (doi:10.1016/j.ins.2008.12.016)
   Web of Science ®Google Scholar
• Michalewicz , Z. 1994 . “ Genetic Algorithms + Data Structures = Evolution Programs ” . New York : Springer . 2nd (extended) ed.
   Google Scholar
• Rajabioun , R. , Atashpaz-Gargari , E. and Lucas , C. 2008 . Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement . Lecture Notes in Comput. Sci. , 5073 : 680 – 695 . (doi:10.1007/978-3-540-69848-7_55)
   Google Scholar
• 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.
   Google Scholar
• 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.
   Google Scholar
• Shokrollahpour , E. , Zandieh , M. and Dorri , B. 2010 . A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem . Int. J. Product. Res. , : 1 – 17 .
   Google Scholar
• Tang , L. , Liu , J. , Rong , A. and Yang , Z. 2000 . A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex . European J. Oper. Res. , 124 : 267 – 282 . (doi:10.1016/S0377-2217(99)00380-X)
   Web of Science ®Google Scholar
• 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.
   Google Scholar
• Wroblewski , J. 1996 . Theoretical foundations of order-based genetic algorithms . Fund. Inform. , 28 ( 3–4 ) : 423 – 430 .
   Google Scholar
• Yadlapalli , S. , Malik , W. A. , Darbha , S. and Pachter , M. 2009 . A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem . Nonlinear Anal. Real World Appl. , 10 ( 4 ) : 1990 – 1999 . (doi:10.1016/j.nonrwa.2008.03.014)
   Web of Science ®Google Scholar
• 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.
   Google Scholar