EUVIMEDEUVIMED entdecken
Crossref

A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems

Caitong Yue, Yuxi Shen, Jing Liang, Boyang Qu, Mingyuan Yu

IEEE/CAA Journal of Automatica Sinica · 2026-10 · 13 (10) · 2327-2342

DOI: 10.1109/jas.2026.125924 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE/CAA Journal of Automatica Sinica, 2026-10. Verfasst von Caitong Yue und 4 weiteren Autor:innen. Die Arbeit nennt 59 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Key Research and Development Program of China, Natural Science Foundation of Henan.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In practical applications, the traveling salesman problem (TSP) usually has both multimodal and multiobjective characteristics. The multimodal multiobjective traveling sales-man problem (MMTSP) presents greater challenges than traditional single-objective TSP, owing to the need for simultaneous optimization of conflicting objectives and identification of diverse Pareto-optimal solutions. To address the above challenges, this study investigates MMTSP and proposes a weight-guided multi-modal multiobjective ant colony optimization algorithm (WGACO). First, aiming at optimizing multiple objectives, a solution construction strategy based on weight decomposition is designed. The strategy divides the population into multiple sub-populations based on weights, with each subpopulation sharing a probability matrix, thereby enhancing the diversity of the population. Second, in order to explore more multimodal solutions, the initial population is optimized by combining the 2-opt local search, thereby effectively improving the quality of the solutions and mining multimodal characteristics. Finally, an individual selection mechanism based on dynamic archiving is proposed to optimize the evolutionary direction of pheromone update. This archive utilizes crowding distances to enhance the diversity of the objective space. Meanwhile, the distance in the decision space is measured by evaluating the similarity of edges between different solutions, thereby enhancing the diversity in decision space. Individuals participating in pheromone updates will be screened from this archive. Extensive experiments and validations on 40 test problems of different scales demonstrate that the proposed algorithm demonstrates superior optimization capability in solving MMTSP problems.

Förderung

  • National Natural Science Foundation of China
  • National Key Research and Development Program of China
  • Natural Science Foundation of Henan
  • Science and Technology Innovation Team of Colleges and Universities in Henan Province
  • Key Laboratory of Big Data Intelligent Computing, Chongqing University of Posts and Telecommunications Open Foundation
  • China Postdoctoral Science Foundation

Zitieren

APA

Yue, C., Shen, Y., Liang, J., Qu, B., & Yu, M. (2026). A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems. IEEE/CAA Journal of Automatica Sinica, 13(10), 2327-2342. https://doi.org/10.1109/jas.2026.125924

Vancouver

Yue C, Shen Y, Liang J, Qu B, Yu M. A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems. IEEE/CAA Journal of Automatica Sinica. 2026;13(10):2327-2342. doi:10.1109/jas.2026.125924

BibTeX
@article{Yue2026,
  author = {Yue, Caitong and Shen, Yuxi and Liang, Jing and Qu, Boyang and Yu, Mingyuan},
  title = {A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems},
  journal = {IEEE/CAA Journal of Automatica Sinica},
  year = {2026},
  volume = {13},
  number = {10},
  pages = {2327--2342},
  doi = {10.1109/jas.2026.125924}
}
Kostenlos starten →