A kind of equal-task multiple traveling salesman problem (ET-mTSP) was proposed based on the mTSP and its corresponding mathematical model was constructed; Then, a series of discrete operations for firefly algorithm (FA) were conducted to solve this problem; Finally, the results and analysis of experiments showed that the improved algorithm was efficient and suitable for solving such ET-mTSP.
CITATION STYLE
Ma, J., Li, M., Zhang, Y., & Zhou, H. (2014). Firefly algorithm solving equal-task multiple traveling salesman problem. Communications in Computer and Information Science, 472, 304–307. https://doi.org/10.1007/978-3-662-45049-9_49
Mendeley helps you to discover research relevant for your work.