Welcome to the InfoSci Platform
Reference Hub1
Three-Step Metaheuristic for the Multiple Objective Multiple Traveling Salesmen Problem

Three-Step Metaheuristic for the Multiple Objective Multiple Traveling Salesmen Problem

Youssef Harrath
Copyright: © 2020 |Volume: 11 |Issue: 4 |Pages: 19
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799802877|DOI: 10.4018/IJAMC.2020100107
Cite Article Cite Article

MLA

Harrath, Youssef. "Three-Step Metaheuristic for the Multiple Objective Multiple Traveling Salesmen Problem." IJAMC vol.11, no.4 2020: pp.130-148. http://doi.org/10.4018/IJAMC.2020100107

APA

Harrath, Y. (2020). Three-Step Metaheuristic for the Multiple Objective Multiple Traveling Salesmen Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 11(4), 130-148. http://doi.org/10.4018/IJAMC.2020100107

Chicago

Harrath, Youssef. "Three-Step Metaheuristic for the Multiple Objective Multiple Traveling Salesmen Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 11, no.4: 130-148. http://doi.org/10.4018/IJAMC.2020100107

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this article, the multiple objective multiple Traveling Salesman Problem is considered. m salesmen have to visit n cities to perform some tasks each taking a given processing time. Two objectives are considered: balance the working loads of different salesmen and minimize their total traveled distance. To solve this NP-hard problem, a 3-phase metaheuristic was developed. In the first 2 phases, the principle of center of mass and a neighborhood search technique are used to assign the n cities to the m salesmen. In the third phase, a TSP solver was used to generate an optimal tour to every salesman using its assigned cities in phase 2. The metaheuristic was tested using TSP benchmarks of different sizes. The obtained results showed almost optimal load balancing for all tested instances and optimal tours in term of total traveled distances. A conducted comparison study showed that the proposed metaheuristic outperforms a recently published clustering algorithm for the workload objective.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.