ImpactU - Detalle del Producto

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

Acceso Abierto

ID Minciencias: ART-0000305189-13

Ranking: ART-ART_B

Idioma: Inglés

Publicado: 01/01/2015

APC (est): No disponible

Abstract:

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.

Tópico:

Metaheuristic Optimization Algorithms Research

Citaciones:

Citaciones por año:

Altmétricas:

Información de la Fuente:

FuenteDecision Science Letters	Cuartil año de publicaciónNo disponible	Volumen4
Issue4	Páginas559 - 568	pISSN1929-5804
ISSNNo disponible	Perfil OpenAlexhttps://openalex.org/S2738905010

Enlaces e Identificadores:

Minciencias ID	ART-0000305189-13	Scienti ID	0000537004-7	Scienti ID	0000305189-13
Openalex URL	https://openalex.org/W759229525	Scholar URL	https://scholar.google.com/scholar?hl=en&as_sdt=0%2C5&q=info%3A8VrGauaoWw8J%3Ascholar.google.com&btnG=	Scienti URL	http://www.growingscience.com/dsl/Vol4/dsl_2015_21.pdf
Pdf URL	http://growingscience.com/dsl/Vol4/dsl_2015_21.pdf	Scholar citations URL	https://scholar.google.com/scholar?cites=1106663841036917489&as_sdt=2005&sciodt=0,5&hl=en	Open_access URL	https://doi.org/10.5267/j.dsl.2015.5.003
Doi URL	https://doi.org/10.5267/j.dsl.2015.5.003

Artículo de revista