This research focuses on the multi-objective optimization of the Traveling Salesman Problem (TSP) considering the cities of Iran. The objective is to minimize both the length of the path and the traffic congestion. To achieve this, a Feasibility-Enhanced Particle Swarm Optimization (FEPSO) algorithm is implemented. The FEPSO algorithm incorporates a feasibility-based approach to enhance the performance of the traditional Particle Swarm Optimization (PSO) algorithm in handling multiple objectives. The algorithm is designed to find optimal routes for salespeople visiting all cities in Iran while considering the shortest path, traffic congestion, safety, and facility. The results demonstrate the effectiveness of the FEPSO algorithm in obtaining well-balanced solutions in terms of path length and traffic congestion for the TSP.
Multi-objective Routing Optimization of the Traveling Salesman Problem Using Feasibility-Enhanced Particle Swarm Optimization Algorithm
eng. Optimization: Methods & Applications
Optimization Techniques for Sustainable Environment Under Uncertainty ; Chapter : 7 ; 115-134
2025-04-13
20 pages
Article/Chapter (Book)
Electronic Resource
English
Studying Solutions of Traveling Salesman Problem with Hybrid Particle Swarm Optimization
British Library Conference Proceedings | 2008
|A Novel Particle Swarm Optimization for Multi-Objective Vehicle Routing Problem
British Library Online Contents | 2016
|Improved multi-objective particle swarm optimization algorithm
British Library Online Contents | 2013
|Swarm Intelligence for Solving a Traveling Salesman Problem
German Aerospace Center (DLR) | 2020
|The m-Traveling Salesman Problem with Minmax Objective
Online Contents | 1995
|