A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem

A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem

This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP). In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling salesmen. The problem is formulated as an integer mu...

Full description

Bibliographic Details
Main Authors: Rubén Iván Bolaños, Mauricio Granada Echeverry, John Willmer Escobar
Format: Article
Language:English
Published: Growing Science 2015-06-01
Series:Decision Science Letters
id doaj-1c4a8b9f4a8c49e688f2309419a34645
record_format Article
spelling doaj-1c4a8b9f4a8c49e688f2309419a346452020-11-24T23:18:39ZengGrowing ScienceDecision Science Letters1929-58041929-58122015-06-014455956810.5267/j.dsl.2015.5.003A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman ProblemRubén Iván BolañosMauricio Granada Echeverry John Willmer EscobarThis paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP). In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling salesmen. The problem is formulated as an integer multi-objective optimization model. A non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve the MOmTSP. The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance. Tests on real world instances and instances adapted from the literature show the effectiveness of the proposed algorithm.
collection DOAJ
language English
format Article
sources DOAJ
author Rubén Iván Bolaños
Mauricio Granada Echeverry
John Willmer Escobar
spellingShingle Rubén Iván Bolaños
Mauricio Granada Echeverry
John Willmer Escobar
A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
Decision Science Letters
author_facet Rubén Iván Bolaños
Mauricio Granada Echeverry
John Willmer Escobar
author_sort Rubén Iván Bolaños
title A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
title_short A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
title_full A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
title_fullStr A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
title_full_unstemmed A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
title_sort multiobjective non-dominated sorting genetic algorithm (nsga-ii) for the multiple traveling salesman problem
publisher Growing Science
series Decision Science Letters
issn 1929-5804
1929-5812
publishDate 2015-06-01
description This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP). In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling salesmen. The problem is formulated as an integer multi-objective optimization model. A non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve the MOmTSP. The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance. Tests on real world instances and instances adapted from the literature show the effectiveness of the proposed algorithm.
work_keys_str_mv AT rubenivanbolanos amultiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
AT mauriciogranadaecheverry amultiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
AT johnwillmerescobar amultiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
AT rubenivanbolanos multiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
AT mauriciogranadaecheverry multiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
AT johnwillmerescobar multiobjectivenondominatedsortinggeneticalgorithmnsgaiiforthemultipletravelingsalesmanproblem
_version_ 1725580715970527232

Similar Items