371
Views
24
CrossRef citations to date
0
Altmetric
Section B

New Imperialist Competitive Algorithm to solve the travelling salesman problem

&
Pages 1495-1505 | Received 18 Jan 2012, Accepted 07 Dec 2012, Published online: 07 Mar 2013

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (4)

Haocheng Yu, Luyao Yang, Jinyu Dai, Baoping Jiang, Zhengtian Wu & Shuxian Zhu. (2023) Fixed-point iterative approach for solving linear Diophantine systems with bounds on the variables. Cyber-Physical Systems 9:4, pages 376-389.
Read now
Jihene Kaabi & Youssef Harrath. (2019) Permutation rules and genetic algorithm to solve the traveling salesman problem. Arab Journal of Basic and Applied Sciences 26:1, pages 283-291.
Read now
Ashkan Hafezalkotob, Mazhar Ansari Ardeh & Zahra Moharrami. (2017) Game of elimination in a shared market: a novel multi-period game approach to competition of supply chains based on simulation. International Journal of Management Science and Engineering Management 12:3, pages 174-185.
Read now
Majid Yousefikhoshbakht, Farzad Didehvar & Farhad Rahmati. (2014) A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery. Journal of Industrial and Production Engineering 31:2, pages 65-75.
Read now

Articles from other publishers (20)

Babak Rezaei, Frederico Gadelha Guimaraes, Rasul Enayatifar & Pauline C. Haddow. (2023) Combining genetic local search into a multi-population Imperialist Competitive Algorithm for the Capacitated Vehicle Routing Problem. Applied Soft Computing 142, pages 110309.
Crossref
Zakir Hussain Ahmed & Majid Yousefikhoshbakht. (2023) A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows. Symmetry 15:2, pages 486.
Crossref
Elias Rotondo & Steffen Heber. (2022) A New Discrete Whale Optimization Algorithm with a Spiral 3-opt Local Search for Solving the Traveling Salesperson Problem. A New Discrete Whale Optimization Algorithm with a Spiral 3-opt Local Search for Solving the Traveling Salesperson Problem.
Karuna Panwar & Kusum Deep. (2021) Discrete Grey Wolf Optimizer for symmetric travelling salesman problem. Applied Soft Computing 105, pages 107298.
Crossref
Abdollahzadeh Benyamin, Soleimanian Gharehchopogh Farhad & Barshandeh Saeid. (2020) Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems. International Journal of Intelligent Systems 36:3, pages 1270-1303.
Crossref
Pengcheng Pan, Chengqing Yuan, Yuwei Sun, Xinping Yan, Mingjian Lu & Richard Bucknall. (2020) Thermo-economic analysis and multi-objective optimization of S-CO2 Brayton cycle waste heat recovery system for an ocean-going 9000 TEU container ship. Energy Conversion and Management 221, pages 113077.
Crossref
Seyed Ali Sharifi & Seyed Morteza Babamir. (2020) The clustering algorithm for efficient energy management in mobile ad-hoc networks. Computer Networks 166, pages 106983.
Crossref
Eneko Osaba, Xin-She Yang & Javier Del Ser. 2020. Nature-Inspired Computation and Swarm Intelligence. Nature-Inspired Computation and Swarm Intelligence 135 164 .
Vageehe Nikkhah, Seyed M. Babamir & Seyed S. Arab. (2019) Estimating Bifurcating Consensus Phylogenetic Trees Using Evolutionary Imperialist Competitive Algorithm. Current Bioinformatics 14:8, pages 728-739.
Crossref
Mohammad Ali Saadatjoo & Seyed Morteza Babamir. (2019) Test-data generation directed by program path coverage through imperialist competitive algorithm. Science of Computer Programming 184, pages 102304.
Crossref
Urszula Boryczka & Krzysztof Szwarc. (2019) The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem. Expert Systems with Applications 122, pages 43-53.
Crossref
Mohammad Norouzifard, Amin Abdollahi Dehkordi, Mohammad Naderi Dehkordi, Hamid Gholamhosseini & Reinhard Klette. (2018) Unsupervised Optic Cup and Optic Disk Segmentation for Glaucoma Detection by ICICA. Unsupervised Optic Cup and Optic Disk Segmentation for Glaucoma Detection by ICICA.
Eneko Osaba, Javier Del Ser, Ali Sadollah, Miren Nekane Bilbao & David Camacho. (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Applied Soft Computing 71, pages 277-290.
Crossref
Xiao-Ning Fan & Bo Zhi. (2017) Design for a Crane Metallic Structure Based on Imperialist Competitive Algorithm and Inverse Reliability Strategy. Chinese Journal of Mechanical Engineering 30:4, pages 900-912.
Crossref
Majid Yousefikhoshbakht, Nasrin Malekzadeh & Mohammad Sedighpour. (2016) Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System. International Journal of Production Management and Engineering 4:2, pages 65.
Crossref
Xiaoning Fan & Zhiyong Cui. (2016) Imperialist competitive algorithm for design optimization of crane metallic Structure. Imperialist competitive algorithm for design optimization of crane metallic Structure.
Nacima Labadie, Christian Prins & Caroline Prodhon. 2016. Metaheuristics for Vehicle Routing Problems. Metaheuristics for Vehicle Routing Problems 149 166 .
Eneko Osaba, Xin-She Yang, Fernando Diaz, Pedro Lopez-Garcia & Roberto Carballedo. (2016) An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. Engineering Applications of Artificial Intelligence 48, pages 59-71.
Crossref
Shuhui Xu, Yong Wang & Aiqin Huang. (2014) Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem. Algorithms 7:2, pages 229-242.
Crossref
Masoud Bagheri & Mahdi Bashiri. (2013) A hybrid genetic and imperialist competitive algorithm approach to dynamic cellular manufacturing system. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 228:3, pages 458-470.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.