Citations (90)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (3)
Doo-Hyun Cho, Dae-Sung Jang & Han-Lim Choi. (2020) Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks. International Journal of Systems Science 51:4, pages 608-630.
Read now
Read now
Youssef Harrath, Abdul Fattah Salman, Abdulla Alqaddoumi, Hesham Hasan & Ahmed Radhi. (2019) A novel hybrid approach for solving the multiple traveling salesmen problem. Arab Journal of Basic and Applied Sciences 26:1, pages 103-112.
Read now
Read now
Maichel M. Aguayo, Subhash C. Sarin & Hanif D. Sherali. (2018) Solving the single and multiple asymmetric Traveling Salesmen Problems by generating subtour elimination constraints from integer solutions. IISE Transactions 50:1, pages 45-53.
Read now
Read now
Articles from other publishers (87)
Rocsildes Canoy, Victor Bucarey, Jayanta Mandi, Maxime Mulamba, Yves Molenbruch & Tias Guns. (2024) Probability estimation and structured output prediction for learning preferences in last mile delivery. Computers & Industrial Engineering 189, pages 109932.
Crossref
Crossref
Shayathri Linganathan & Purusotham Singamsetty. (2024) Genetic algorithm to the bi-objective multiple travelling salesman problem. Alexandria Engineering Journal 90, pages 98-111.
Crossref
Crossref
Murat Aslan & Mario Pavone. (2023) MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem. Neural Computing and Applications 36:5, pages 2573-2595.
Crossref
Crossref
Irfan Farda & Arit Thammano. (2023) A Novel Discrete Differential Evolution Algorithm for Solving the Traveling Salesman Problem. A Novel Discrete Differential Evolution Algorithm for Solving the Traveling Salesman Problem.
Víctor Hugo Pacheco-Valencia, Nodari Vakhania & José Alberto Hernández-Aguilar. (2023) An Algorithm to Solve the Euclidean Single-Depot Bounded Multiple Traveling Salesman Problem. An Algorithm to Solve the Euclidean Single-Depot Bounded Multiple Traveling Salesman Problem.
José Alejandro Cornejo-Acosta, Jesús García-Díaz, Julio César Pérez-Sansalvador & Carlos Segura. (2023) Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems. Mathematics 11:13, pages 3014.
Crossref
Crossref
Tian Zhang, Yongquan Zhou, Guo Zhou, Wu Deng & Qifang Luo. (2023) Discrete Mayfly Algorithm for spherical asymmetric traveling salesman problem. Expert Systems with Applications 221, pages 119765.
Crossref
Crossref
Gilang Kusuma Jati, Garry Kuwanto, Tahir Hashmi & Herman Widjaja. (2023) Discrete komodo algorithm for traveling salesman problem. Applied Soft Computing 139, pages 110219.
Crossref
Crossref
Karuna Panwar & Kusum Deep. (2022) Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem. Applied Intelligence 53:10, pages 11420-11438.
Crossref
Crossref
Rong Zheng, Hongtai Yang, Lanzhen Jiang, Jinghai Huo, Xiaoqian Lu & Malik Muneeb Abid. (2023) Optimizing the Cleaning and Disinfection Scheme for Dockless Shared Bikes. Journal of Advanced Transportation 2023, pages 1-12.
Crossref
Crossref
Farhad Soleimanian Gharehchopogh, Benyamin Abdollahzadeh & Bahman Arasteh. (2023) An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem. Computer Modeling in Engineering & Sciences 135:3, pages 1981-2006.
Crossref
Crossref
Poria Pirozmand, Ali Asghar Rahmani Hosseinabadi, Maedeh Jabbari Chari, Faezeh Pahlavan, Seyedsaeid Mirkamali, Gerhard-Wilhelm Weber, Summera Nosheen & Ajith Abraham. (2023) D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm. IEEE Access 11, pages 106544-106566.
Crossref
Crossref
Mihaela Breaban, Raluca Necula, Dorel Lucanu & Daniel Stamate. (2023) Joint Decision Making in Ant Colony Systems for Solving the Multiple Traveling Salesman Problem. Procedia Computer Science 225, pages 3498-3507.
Crossref
Crossref
Radu Bilbiie, Dumitru Popescu, Catalin Dimon, Marius Teme & Pierre Borne. (2023) Game theory system optimization in a supplier-customer transport network. Procedia Computer Science 221, pages 1036-1043.
Crossref
Crossref
Wei Li, Cancan Wang, Ying Huang & Yiu-ming Cheung. (2023) Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem. Applied Soft Computing 133, pages 109943.
Crossref
Crossref
Ali Maktabifard, Dávid Földes & Bendegúz Dezső Bak. 2023. Computational Logistics. Computational Logistics
450
466
.
Narinder Singh, Essam H. Houssein, Seyedali Mirjalili, Yankai Cao & Ganeshsree Selvachandran. (2022) An efficient improved African vultures optimization algorithm with dimension learning hunting for traveling salesman and large‐scale optimization applications. International Journal of Intelligent Systems 37:12, pages 12367-12421.
Crossref
Crossref
Benyamin Abdollahzadeh, Saeid Barshandeh, Hatef Javadi & Nicola Epicoco. (2021) An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem. Engineering with Computers 38:S4, pages 3423-3444.
Crossref
Crossref
Sukmin Yoon, Haggi Do & Jinwhan Kim. (2022) Robust Task Allocation for Multiple Cooperative Robotic Vehicles Considering Node Position Uncertainty. Journal of Intelligent & Robotic Systems 106:1.
Crossref
Crossref
Pengfei He & Jin-Kao Hao. (2022) Hybrid search with neighborhood reduction for the multiple traveling salesman problem. Computers & Operations Research 142, pages 105726.
Crossref
Crossref
Farhad Soleimanian Gharehchopogh & Benyamin Abdollahzadeh. (2021) An efficient harris hawk optimization algorithm for solving the travelling salesman problem. Cluster Computing 25:3, pages 1981-2005.
Crossref
Crossref
Zhen Zhang & Yang Han. (2022) Discrete sparrow search algorithm for symmetric traveling salesman problem. Applied Soft Computing 118, pages 108469.
Crossref
Crossref
Catalin Dimon, Dumitru Popescu & Radu Bîlbîie. (2022) Efficient and Collaborative Decisions for Supplier-Customer Services Management. Procedia Computer Science 214, pages 1144-1151.
Crossref
Crossref
Beyza GUNESEN & Muzaffer KAPANOĞLU. (2021) Hasta Ergonomisi Açısından Servis Güzergâhlarının İyileştirilmesi. Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi 13:3, pages 98-108.
Crossref
Crossref
Karuna Panwar & Kusum Deep. (2021) Transformation operators based grey wolf optimizer for travelling salesman problem. Journal of Computational Science 55, pages 101454.
Crossref
Crossref
Lennart Baardman, Kees Jan Roodbergen, Héctor J. Carlo & Albert H. Schrotenboer. (2021) A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems. Transportation Science 55:5, pages 1151-1169.
Crossref
Crossref
Khalid Mekamcha, Mehdi Souier, Hakim Nadhir Bessenouci & Mohammed Bennekrouf. (2019) Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case. Operational Research 21:3, pages 1641-1661.
Crossref
Crossref
Karuna Panwar & Kusum Deep. (2021) Discrete Grey Wolf Optimizer for symmetric travelling salesman problem. Applied Soft Computing 105, pages 107298.
Crossref
Crossref
Mesut Gunduz & Murat Aslan. (2021) DJAYA: A discrete Jaya algorithm for solving traveling salesman problem. Applied Soft Computing 105, pages 107275.
Crossref
Crossref
Beyza GUNESEN & Muzaffer KAPANOĞLU. (2021) İki Amaçlı Çoklu Gezgin Satıcı Problemi için Üç Aşamalı Çözüm Yaklaşımı. European Journal of Science and Technology.
Crossref
Crossref
Korhan Karabulut, Hande Öztop, Levent Kandiller & M. Fatih Tasgetiren. (2021) Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach. Computers & Operations Research 129, pages 105192.
Crossref
Crossref
Henan Liu, Huili Zhang & Yi Xu. (2021) The m-Steiner Traveling Salesman Problem with online edge blockages. Journal of Combinatorial Optimization 41:4, pages 844-860.
Crossref
Crossref
Ping Lou, Kun Xu, Junwei Yan & Zheng Xiao. (2021) An Improved Partheno-Genetic Algorithm for Open Path Multi-Depot Multiple Traveling Salesmen Problem. Journal of Physics: Conference Series 1848:1, pages 012002.
Crossref
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
Crossref
José Luis Santos & André Oliveira. 2021. Progress in Industrial Mathematics: Success Stories. Progress in Industrial Mathematics: Success Stories
131
144
.
Manolis N. Kritikos & Pantelis Z. Lappas. 2021. Advances in Core Computer Science-Based Technologies. Advances in Core Computer Science-Based Technologies
325
367
.
Maha Ata Al-Furhud & Zakir Hussain Ahmed. (2020) Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem. Mathematical Problems in Engineering 2020, pages 1-13.
Crossref
Crossref
Ahmet Cevahir Cinar, Sedat Korkmaz & Mustafa Servet Kiran. (2020) A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Engineering Science and Technology, an International Journal 23:4, pages 879-890.
Crossref
Crossref
Behire Yesim Yilmaz & Sueda Nur Denizer. (2020) Multi UAV Based Traffic Control in Smart Cities. Multi UAV Based Traffic Control in Smart Cities.
M. Bruglieri, S. Mancini & O. Pisacane. (2019) The green vehicle routing problem with capacitated alternative fuel stations. Computers & Operations Research 112, pages 104759.
Crossref
Crossref
Amir Ahmadi-Javid & Nasrin Ramshe. (2018) Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm. 4OR 17:4, pages 373-400.
Crossref
Crossref
Sukmin Yoon & Jinwhan Kim. (2019) Fleet size optimization and collaborative route planning for multi-vehicle task allocation. Fleet size optimization and collaborative route planning for multi-vehicle task allocation.
Furqan Essani & Sajjad Haider. (2018) An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets. Algorithms 11:10, pages 143.
Crossref
Crossref
Kim Rioux-Paradis & Claude-Guy Quimper. 2018. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Integration of Constraint Programming, Artificial Intelligence, and Operations Research
495
511
.
Tahir Majeed, Michael Handschuh & René Meier. 2018. Distributed Computing and Artificial Intelligence, 14th International Conference. Distributed Computing and Artificial Intelligence, 14th International Conference
309
317
.
Yongbo Chen, Zhenyue Jia, Xiaolin Ai, Di Yang & Jianqiao Yu. (2017) A modified two-part wolf pack search algorithm for the multiple traveling salesmen problem. Applied Soft Computing 61, pages 714-725.
Crossref
Crossref
K. L. Yeh, J. W. S. Liu & E. T. H. Chu. (2017) Tour planning for crowdsourcing sensor data collection. Tour planning for crowdsourcing sensor data collection.
Aritra Pal & Yu Zhang. (2017) Free-floating bike sharing: Solving real-life large-scale static rebalancing problems. Transportation Research Part C: Emerging Technologies 80, pages 92-116.
Crossref
Crossref
Sukmin Yoon & Jinwhan Kim. (2017) Efficient multi-agent task allocation for collaborative route planning with multiple unmanned vehicles. IFAC-PapersOnLine 50:1, pages 3580-3585.
Crossref
Crossref
Mingji Xu, Sheng Li & Jian Guo. (2017) Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. MATEC Web of Conferences 100, pages 02025.
Crossref
Crossref
Kyle E. C. Booth, Tony T. Tran & J. Christopher Beck. 2016. Integration of AI and OR Techniques in Constraint Programming. Integration of AI and OR Techniques in Constraint Programming
55
64
.
Banu Soylu. (2015) A general variable neighborhood search heuristic for multiple traveling salesmen problem. Computers & Industrial Engineering 90, pages 390-401.
Crossref
Crossref
Raluca Necula, Mihaela Breaban & Madalina Raschip. 2015. Hybrid Artificial Intelligent Systems. Hybrid Artificial Intelligent Systems
257
268
.
Anand Jayant Kulkarni, Kang Tai & Ajith AbrahamAnand Jayant Kulkarni, Kang Tai & Ajith Abraham. 2015. Probability Collectives. Probability Collectives
37
60
.
Subhash C. Sarin, Hanif D. Sherali, Jason D. Judd & Pei-Fang (Jennifer) Tsai. (2014) Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. Computers & Operations Research 51, pages 64-89.
Crossref
Crossref
Marco Castro, Kenneth Sörensen, Pieter Vansteenwegen & Peter Goos. (2013) A memetic algorithm for the travelling salesperson problem with hotel selection. Computers & Operations Research 40:7, pages 1716-1728.
Crossref
Crossref
Xiaobin Wang, Daibo Liu & Mengshu Hou. (2013) A novel method for multiple depot and open paths, Multiple Traveling Salesmen Problem. A novel method for multiple depot and open paths, Multiple Traveling Salesmen Problem.
Francesco FerrucciFrancesco Ferrucci. 2013. Pro-active Dynamic Vehicle Routing. Pro-active Dynamic Vehicle Routing
15
79
.
Brian J. Lunday, Hanif D. Sherali & Kevin E. Lunday. (2012) The coastal seaspace patrol sector design and allocation problem. Computational Management Science 9:4, pages 483-514.
Crossref
Crossref
MengShu Hou & DaiBo Liu. (2012) A novel method for solving the multiple traveling salesmen problem with multiple depots. Chinese Science Bulletin 57:15, pages 1886-1892.
Crossref
Crossref
Shih-Hsin Chen & Mu-Chung Chen. (2011) Operators of the Two-Part Encoding Genetic Algorithm in Solving the Multiple Traveling Salesmen Problem. Operators of the Two-Part Encoding Genetic Algorithm in Solving the Multiple Traveling Salesmen Problem.
Riddhi Doshi, Sai Yadlapalli, Sivakumar Rathinam & Swaroop Darbha. (2011) Approximation algorithms and heuristics for a 2‐depot, heterogeneous Hamiltonian path problem. International Journal of Robust and Nonlinear Control 21:12, pages 1434-1451.
Crossref
Crossref
András Király & János Abonyi. 2011. Intelligent Computational Optimization in Engineering. Intelligent Computational Optimization in Engineering
241
269
.
Anand Jayant Kulkarni & Kang Tai. (2010) Probability Collectives: A distributed optimization approach for constrained problems. Probability Collectives: A distributed optimization approach for constrained problems.
Anand J. Kulkarni & K. Tai. (2010) Probability Collectives: A multi-agent approach for solving combinatorial optimization problems. Applied Soft Computing 10:3, pages 759-771.
Crossref
Crossref
András Király & János Abonyi. 2010. Computational Intelligence in Engineering. Computational Intelligence in Engineering
141
151
.
Eli Angela Vitor Toso, Reinaldo Morabito & Alistair Clark. (2008) Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal. Pesquisa Operacional 28:3, pages 423-450.
Crossref
Crossref
ALP USTUNDAG & EMRE CEVİKCAN. (2011) VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM. International Journal of Information Technology & Decision Making 07:04, pages 611-625.
Crossref
Crossref
Fanggeng Zhao, Jinyan Dong, Sujian Li & Xirui Yang. (2008) An improved genetic algorithm for the multiple traveling salesman problem. An improved genetic algorithm for the multiple traveling salesman problem.
Aykagan Ak & Alan L. Erera. (2007) A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands. Transportation Science 41:2, pages 222-237.
Crossref
Crossref
Imdat Kara & Tolga Bektas. (2006) Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research 174:3, pages 1449-1458.
Crossref
Crossref
Tolga Bektas. (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34:3, pages 209-219.
Crossref
Crossref
Michel Gendreau, Gilbert Laporte & Eduardo Morais Guimarães. (2001) A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research 133:1, pages 183-189.
Crossref
Crossref
L. Caccetta & S.P. Hill. (2001) Branch and cut methods for network optimization. Mathematical and Computer Modelling 33:4-5, pages 517-532.
Crossref
Crossref
Louis Caccetta. 2000. Progress in Optimization. Progress in Optimization
21
44
.
Yang GuoXing. (1995) Transformation of multidepot multisalesmen problem to the standard travelling salesman problem. European Journal of Operational Research 81:3, pages 557-560.
Crossref
Crossref
Bernhard Fleischmann. (1988) A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming 40-40:1-3, pages 225-246.
Crossref
Crossref
G. Laporte, Y. Nobert & S. Taillefer. (1987) A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem. Mathematical Modelling 9:12, pages 857-868.
Crossref
Crossref
G. Laporte, Y. Nobert & D. Arpin. (1986) An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research 6:9, pages 291-310.
Crossref
Crossref
Gilbert Laporte, Hélène Mercure & Yves Nobert. (2006) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16:1, pages 33-46.
Crossref
Crossref
Bernhard Fleischmann. (1985) A cutting plane procedure for the travelling salesman problem on road networks. European Journal of Operational Research 21:3, pages 307-317.
Crossref
Crossref
Gilbert Laporte, Martin Desrochers & Yves Nobert. (2006) Two exact algorithms for the distance‐constrained vehicle routing problem. Networks 14:1, pages 161-172.
Crossref
Crossref
Gilbert Laporte & Yves Nobert. (2016) Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach. INFOR: Information Systems and Operational Research 21:1, pages 61-75.
Crossref
Crossref
Gilbert Laporte, Yves Nobert & Paul Pelletier. (1983) Hamiltonian location problems. European Journal of Operational Research 12:1, pages 82-89.
Crossref
Crossref
Samuel Raff. (1983) Routing and scheduling of vehicles and crews. Computers & Operations Research 10:2, pages 63-211.
Crossref
Crossref
Tian Zhang, Yongquan Zhou, Guo Zhou, Wu Deng & Qifang Luo. (2022) Discrete Mayfly Algorithm for Spherical Asymmetric Traveling Salesman Problem. SSRN Electronic Journal.
Crossref
Crossref
Jyoti Gupta & Sangeeta Lal. (2018) Comparison of Some Approximate Algorithms Proposed for Traveling Salesmen and Graph Partitioning Problems. SSRN Electronic Journal.
Crossref
Crossref