EUVIMEDEUVIMED entdecken
Crossref

Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems

Yiping Liu, Liting Xu, Yuyan Han, Xiangxiang Zeng, Gary G. Yen, Hisao Ishibuchi

IEEE Transactions on Evolutionary Computation · 2024-04 · 28 (2) · 516-530

DOI: 10.1109/tevc.2023.3239546 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2024-04. Verfasst von Yiping Liu und 5 weiteren Autor:innen. Die Arbeit wurde bisher 67-mal zitiert (Crossref) und nennt 55 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Hunan Province of China, Fundamental Research Funds for the Central Universities.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Multimodal multiobjective optimization problems (MMOPs) are commonly seen in real-world applications. Many evolutionary algorithms have been proposed to solve continuous MMOPs. However, little effort has been made to solve combinatorial (or discrete) MMOPs. Searching for equivalent Pareto-optimal solutions in the discrete decision space is challenging. Moreover, the true Pareto-optimal solutions of a combinatorial MMOP are usually difficult to know, which has limited the development of its optimizer. In this article, we first propose a test problem generator for multimodal multiobjective traveling salesman problems (MMTSPs). It can readily generate MMTSPs with known Pareto-optimal solutions. Then, we propose a novel evolutionary algorithm to solve MMTSPs. In our proposed algorithm, we develop two new edge assembly crossover operators, which are specialized in searching for superior solutions to MMTSPs. Moreover, the proposed algorithm uses a new environmental selection operator to maintain a good balance between the objective space diversity and decision space diversity. We compare our algorithm with five state-of-the-art designs. Experimental results convincingly show that our algorithm is powerful in solving MMTSPs.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Hunan Province of China
  • Fundamental Research Funds for the Central Universities
  • Guangyue Young Scholar Innovation Team of Liaocheng University
  • Guangdong Provincial Key Laboratory
  • Program for Guangdong Introducing Innovative and Enterpreneurial Teams
  • Stable Support Plan Program of Shenzhen Natural Science Fund
  • Shenzhen Science and Technology Program

Zitieren

APA

Liu, Y., Xu, L., Han, Y., Zeng, X., Yen, G. G., & Ishibuchi, H. (2024). Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems. IEEE Transactions on Evolutionary Computation, 28(2), 516-530. https://doi.org/10.1109/tevc.2023.3239546

Vancouver

Liu Y, Xu L, Han Y, Zeng X, Yen GG, Ishibuchi H. Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems. IEEE Transactions on Evolutionary Computation. 2024;28(2):516-530. doi:10.1109/tevc.2023.3239546

BibTeX
@article{Liu2024,
  author = {Liu, Yiping and Xu, Liting and Han, Yuyan and Zeng, Xiangxiang and Yen, Gary G. and Ishibuchi, Hisao},
  title = {Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2024},
  volume = {28},
  number = {2},
  pages = {516--530},
  doi = {10.1109/tevc.2023.3239546}
}
Kostenlos starten →