Applying K-means Clustering and Genetic Algorithm for Solving MTSP-Reference-Cited by-同舟云学术

Applying K-means Clustering and Genetic Algorithm for Solving MTSP

Published:2016 Issue: Volume: Page:278-284
ISSN:1865-0929
Container-title:Bio-inspired Computing – Theories and Applications
language:
Short-container-title:

Author:

Lu Zhanqing,Zhang Kai,He Juanjuan,Niu Yunyun

Publisher

Springer Singapore

Link

http://link.springer.com/content/pdf/10.1007/978-981-10-3614-9_34

Reference20 articles.

1. Jin, S.: The model and algorithm of city vehicles logistic tours. Comput. Eng. Appl. 22, 38–40 (2002)

2. Lawler, E.L., Lenstra, J.K., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, Chichester (1985)

3. Alves, R.M.F., Lopes, C.R.: Using genetic algorithms to minimize the distance and balance the routes for the multiple traveling salesman problem. Evol. Comput. 41, 44–51 (2015). IEEE

4. Shengping, J.: A hybrid genetic algorithm to solve TSP and MTSP. J. Wuhan Univ. Technol. 26, 839–842 (2002)

5. Wang, C.: The modelling of the optimal routes for the disaster inspection. J. An-hui Inst. Mech. Electr. Eng. (2000)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the Multiple Travelling Salesman Problem using Gaussian Mixture Model and Artificial Neural Network;2023 24th International Arab Conference on Information Technology (ACIT);2023-12-06

2. Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems;Mathematics;2023-07-06

3. Matrix-Based Ant Colony Optimization for Large-Scale Balanced Multiple Traveling Salesmen Problem;2023 15th International Conference on Advanced Computational Intelligence (ICACI);2023-05-06

4. Microgrid Loads Clustering in an Electricity Feeder using Genetic Algorithm with Applied DBSCAN Techniques;2022 6th International Conference on Information Technology (InCIT);2022-11-10

5. An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem;Computers & Operations Research;2022-07