Artificial Intelligence to Solve Travelling Salesman Problem with Weighted Multiobjective
Abstract—This paper examines the Weighted Multiobjective Travelling Salesman Problem (WMTSP), presents particular examples of the problem, and suggests using two local search techniques: Bees Algorithm (BA) and Particle Swarm Optimization (PSO) to identify the best solutions for each strategy. The findings demonstrate that the Exact approach receives closed results from BA and PSO, and that they are closed to one another. Keywords— Bees Algorithm, Particle Swarm Optimization, Travelling Salesman Problem, Artificial Intelligence. Multiobjective Functions.
Authors
- Selmy Awad (ORCID: https://orcid.org/0000-0002-2724-5599)
- Faez Hassan Ali (ORCID: https://orcid.org/0000-0003-2371-069X)
- Safanah Faisal Yousif (ORCID: https://orcid.org/0009-0009-7319-2633)
- Manal Ghassan Ahmed (ORCID: https://orcid.org/0000-0002-9962-1426)
Publication Details
- Published
- 2025-05-15
- DOI
- https://doi.org/10.24086/icafs2025/paper.1765
- Primary Topic
- Data Mining and Machine Learning Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00