- -

A new genetic algorithm for the asymmetric traveling salesman problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A new genetic algorithm for the asymmetric traveling salesman problem

Show full item record

Yuichi Nagata; Soler Fernández, D. (2012). A new genetic algorithm for the asymmetric traveling salesman problem. Expert Systems with Applications. 39(10):8947-8953. doi:10.1016/j.eswa.2012.02.029

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/36442

Files in this item

Item Metadata

Title: A new genetic algorithm for the asymmetric traveling salesman problem
Author: Yuichi Nagata Soler Fernández, David
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
The asymmetric traveling salesman problem (ATSP) is one of the most important combinatorial optimization problems. It allows us to solve, either directly or through a transformation, many real-world problems. We present ...[+]
Subjects: Asymmetric traveling salesman problem , Crossover operator , Genetic algorithm , Metaheuristics , Combinatorial optimization problems , Optimal solutions , Real-world problem , Combinatorial optimization , Heuristic methods
Copyrigths: Reserva de todos los derechos
Source:
Expert Systems with Applications. (issn: 0957-4174 )
DOI: 10.1016/j.eswa.2012.02.029
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.eswa.2012.02.029
Thanks:
This work has been partially supported by the Ministerio de Educacion y Ciencia of Spain (Project No. TIN2008-06441-C02-01).
Type: Artículo

This item appears in the following Collection(s)

Show full item record