Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm
MATEC Web Conf., 100 (2017) 02025
Published online: 2017-03-08
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
An adaptive coarse-to-fine framework for automatic first article inspection of flexographic printing labels
Pan Xiao, Shule Yan, Jinliang Long, Jianfa Lin, Meng Xiao, Nian Cai, Xindu Chen and Jiewu LengExpert Systems with Applications 227 120241 (2023)
https://doi.org/10.1016/j.eswa.2023.120241
A Hybrid Tabu Search and 2-opt Path Programming for Mission Route Planning of Multiple Robots under Range Limitations
Meng-Tse Lee, Bo-Yu Chen and Ying-Chih LaiElectronics 9 (3) 534 (2020)
https://doi.org/10.3390/electronics9030534
Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system
Rodrigo S. de Moraes and Edison P. de FreitasExpert Systems with Applications 136 392 (2019)
https://doi.org/10.1016/j.eswa.2019.04.023
Failure-Robot Path Complementation for Robot Swarm Mission Planning
Meng-Tse Lee, Bo-Yu Chen and Wen-Chi LuApplied Sciences 9 (18) 3756 (2019)
https://doi.org/10.3390/app9183756