A novel imperialist competitive algorithm for generalized traveling salesman problems

Applied Soft Computing Journal

Volumn 26, Issue , 2015, Pages 546-555

  Ardalan, Zaniar ^a   Karimi, Sajad ^a   Poursabzi, Omid ^a   Naderi, B ^a  

^a KHARAZMI UNIVERSITY   (Iran)

Author keywords

Generalized traveling salesman problem; Imperialist competitive algorithm; Metaheuristic

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; TAGUCHI METHODS;

DEVELOPMENT PLANS; ENCODING SCHEMES; GENERALIZED TRAVELING SALESMAN PROBLEM; IMPERIALIST COMPETITIVE ALGORITHM (ICA); IMPERIALIST COMPETITIVE ALGORITHMS; META-HEURISTIC METHODS; METAHEURISTIC; SOLUTION QUALITY;

TRAVELING SALESMAN PROBLEM;

EID: 84912101196     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.08.033     Document Type: Article

References (46)

1. G. Laporte, A. Asef-Vaziri, and C. Sriskandarajah Some applications of the generalized travelling salesman problem J. Oper. Res. Soc. 47 12 1996 1461 1467
2. A. Henry-Labordere The record balancing problem - a dynamic programming solution of a generalized traveling salesman problem Revue Francaise D Informatique De Recherche Operationnelle 3 NB2 1969 43 49
3. C.E. Noon The generalized traveling salesman problem (Ph.D. thesis) 1988 University of Michigan
4. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, and A. Zverovitch Process planning for rotational parts using the generalized traveling salesman problem Int. J. Prod. Res. 41 11 2003 2581 2596
5. J.P. Saskena Mathematical model of scheduling clients through welfare agencies J. Can. Oper. Res. Soc. 8 1970 185 200
6. S.S. Srivastava, S. Kumar, R.C. Garg, and P. Sen Generalized traveling salesman problem through n sets of nodes CORS J. 7 1969 97 101
7. A. Henry-Labordere The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem RAIRO B2 1969 43 49
8. G. Laporte, and Y. Nobert Generalized travelling salesman problem through n sets of nodes: an integer programming approach INFOR 31 1984 61 75
9. G. Laporte, H. Mercure, and Y. Nobert Generalized travelling salesman problem through n sets of nodes: the asymmetrical case Discr. Appl. Math. 18 1984 185 197
10. M. Fischetti, J.J. Salazar-Gonzalez, and P. Toth The symmetrical generalized traveling salesman poly tope Networks 26 2 1995 113 123
11. M. Fischetti, J.J. Salazar-González, and P. Toth A branch-and-cut algorithm for the symmetric generalized travelling salesman problem Oper. Res. 45 3 1997 378 394
12. C.E. Noon, and J.C. Bean An efficient transformation of the generalized traveling salesman problem INFOR 31 1993 39 44
13. Y.N. Lien, E. Ma, and B. Wah Transformation of the generalized traveling-salesman problem into the standard traveling salesman problem Inform. Sci. 74 1993 177 189
14. G. Laporte, and F. Semet Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem INFOR 37 1999 114 120
15. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, and A. Zverovitch Transformations of generalized ATSP into ATSP Oper. Res. Lett. 31 2003 357 365
16. J. Renaud, and F.F. Boctor An efficient composite heuristic for the symmetric generalized traveling salesman problem Eur. J. Oper. Res. 108 3 1998 571 584
17. J. Renaud, F.F. Boctor, and G. Laporte A fast composite heuristic for the symmetric traveling salesman problem INFORMS J. Comput. 4 1996 134 143
18. L.V. Snyder, and M.S. Daskin A random-key genetic algorithm for the generalized traveling salesman problem Eur. J. Oper. Res. 174 2006 38 53
19. J. Silberholz, and B. Golden The generalized traveling salesman problem: a new genetic algorithm approach. Extending the horizons Adv. Comput. Optim. Decis. Technol. 37 2007 165 181
20. M.F. Tasgetiren, P.N. Suganthan, and Q.K. Pan A discrete particle swarm optimization algorithm for the generalized traveling salesman problem Proceedings of the Ninth Annual Conference on Genetic and Evolutionary Computation (GECCO'2007) London, UK 2007 158 167
21. M.F. Tasgetiren, P.N. Suganthan, Q.K. Pan, and Y.C. Liang A genetic algorithm for the generalized traveling salesman problem Proceeding of the World Congress on Evolutionary Computation (CEC2007) Singapore 2007 2382 2389
22. M. Fatih Tasgetiren, P.N. Suganthan, and P. Quan-Ke An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem Appl. Math. Comput. 215 2010 3356 3368
23. C. B. Bontouxa, D. Artiguesb, and A. Feilletc Memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem Comp. Oper. Res. 37 2010 1844 1852
24. I. Chaparro, and F. Valdez Variants of ant colony optimization: a metaheuristic for solving the traveling salesman problem Recent Adv. Hybrid Intell. Syst. 451 2013 323 331
25. H. Neyoy, O. Castillo, and J. Soria Dynamic fuzzy logic parameter tuning for ACO and its application in TSP problems Recent Adv. Hybrid Intell. Syst. 451 2013 259 271
26. F. Valdez, P. Melin, and O. Castillo An improved evolutionary method with fuzzy logic for combining particle swarm optimization and genetic algorithms Appl. Soft Comput. 11 2 2011 2625 2632
27. R. Fierro, and O. Castillo Design of fuzzy control systems with different PSO variants Recent Adv. Hybrid Intell. Syst. 4 2013 81 88
28. A. Sombra, F. Valdez, P. Melin, and O. Castillo A new gravitational search algorithm using fuzzy logic to parameter adaptation IEEE Congr. Evol. Comput. 106 2013 8 107 4
29. P. Melin, F. Olivas, O. Castillo, F. Valdez, J. Soria, and J.M.G. Valdez Optimal design of fuzzy classification systems using PSO with dynamic parameter adaptation through fuzzy logic Expert Syst. Appl. 40 8 2013 3196 3206
30. F. Valdez, P. Melin, and O. Castillo Fuzzy control for dynamical parameter adaptation in a parallel evolutionary method combining particle swarm optimization and genetic algorithms Soft Comput. Intell. Control Mobile Robot. 318 2011 161 178
31. E. Lizárraga, O. Castillo, and J. Soria A method to solve the traveling salesman problem using ant colony optimization variants with ant set partitioning Recent Adv. Hybrid Intell. Syst. 451 2013 237 246
32. E. Atashpaz-Gargari, and C. Lucas Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, in CEC IEEE Congress on Evolutionary Computation 2007
33. B. Mohammadi-ivatloo, A. Rabiee, A. Soroudi, and M. Ehsan Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch Energy 44 2012 228 240
34. A. Rahimi, H. Karimi, and B. Afshar-Nadjafi Using meta-heuristics for project scheduling under mode identity constraints Appl. Soft Comput. 13 4 2013 2124 2135
35. M. Mohammadi, S.A. Torabi, and R. Tavakkoli-Moghaddam Sustainable hub location under mixed uncertainty Transport. Res. E 62 2014 89 115
36. K. Devika, A. Jafarian, and V. Nourbakhsh Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques Eur. J. Oper. Res. 235 3 2014 594 615
37. M. Ghasemi, S. Ghavidel, S. Rahmani, A. Roosta, and H. Falah A novel hybrid algorithm of imperialist competitive algorithm and teaching learning algorithm for optimal power flow problem with non-smooth cost functions Eng. Appl. Artif. Intell. 29 2014 54 69
38. H. Linzhi, D. Haibin, and W. Yin Hybrid bio-inspired lateral inhibition and imperialist competitive algorithm for complicated image matching Optik Int. J. Light Electron Opt. 125 2014 414 418
39. R. Ruiz, and T. Stutzle A simple and effective iterated greedy algorithm for the permutation flow-shop scheduling problem Eur. J. Oper. Res. 174 2006 38 53
40. L. Davis Applying adaptive algorithms to epistatic domains Proceedings of the International Joint Conference on Artificial Intelligence 1985 162 164
41. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper. Res. 21 1973 498 516
42. V.P. Nguyen, C. Prins, and C. Prodhon A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem Eng. Appl. Artif. Intell. 25 2012 56 71
43. D.C. Montgomery Design and Analysis of Experiments 5th ed. 2000 Wiley New York
44. B. Naderi, M. Zandieh, and S.M.T. Fatemi-Ghomi Scheduling job shop problems with sequence dependent setup times Int. J. Prod. Res. 47 21 2009 5959 5976
45. G. Taguchi, Introduction to quality engineering, White Plains, Asian Productivity Organization/UNIPUB 2000.
46. B. Naderi, S.M.T. Fatemi-Ghomi, and M. Aminnayeri A high performing metaheuristic for job shop scheduling with sequence-dependent setup times Appl. Soft Comput. 10 2010 703 710