A new genetic algorithm for the asymmetric traveling salesman problem

Authors:
Yuichi Nagata;David Soler
Affiliations:
Tokyo Institute of Technology, Kanagawa, Japan;Institut Universitari de Matemítica Pura i Aplicada, Universitat Politècnica de València, València, Spain
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 16
Cited 1

Modeling and solving several classes of arc routing problems as traveling salesman problems

Computers and Operations Research
Experiments on traveling salesman heuristics

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Rural Postman Problem on mixed graphs with turn penalties

Computers and Operations Research
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Journal of Heuristics
New Results on the Mixed General Routing Problem

Operations Research
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Computers and Operations Research
A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem

Engineering Applications of Artificial Intelligence
Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms

Expert Systems with Applications: An International Journal
Parallelized genetic ant colony systems for solving the traveling salesman problem

Expert Systems with Applications: An International Journal
The mixed capacitated general routing problem with turn penalties

Expert Systems with Applications: An International Journal
New EAX crossover for large TSP instances

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Fast EAX algorithm considering population diversity for traveling salesman problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
The capacitated general windy routing problem with turn penalties

Operations Research Letters
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Operations Research Letters
Transformations of generalized ATSP into ATSP

Operations Research Letters

Short communication: Comments on "Albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320": A proposal of good practice

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

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 in this paper a new competitive genetic algorithm to solve this problem. This algorithm has been checked on a set of 153 benchmark instances with known optimal solution and it outperforms the results obtained with previous ATSP heuristic methods.