A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Authors:
Luciana Buriol;Paulo M. França;Pablo Moscato
Affiliations:
Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, UNICAMP, 13083-970 Campinas, SP, Brazil. buriol@densis.fee.unicamp.br;Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, UNICAMP, 13083-970 Campinas, SP, Brazil. franca@densis.fee.unicamp.br;School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle, 2308 Callaghan, NSW, Australia. moscato@cs.newcastle.edu.a ...
Venue:
Journal of Heuristics
Year:
2004

Citing 16
Cited 16

An introduction to population approaches for optimization and hierarchical objective functions: a discussion on the role of tabu search

Annals of Operations Research - Special issue on Tabu search
A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
Exact solution of large-scale, asymmetric traveling salesman problems

ACM Transactions on Mathematical Software (TOMS)
A polyhedral approach to the asymmetric traveling salesman problem

Management Science
Experiments on traveling salesman heuristics

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Memetic algorithms: a short introduction

New ideas in optimization
Memetic algorithms using guided local search: a case study

New ideas in optimization
The number partitioning problem: an open challenge for evolutionary computation?

New ideas in optimization
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy

Proceedings of the 3rd International Conference on Genetic Algorithms
Repair and Brood Selection in the Traveling Salesman Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Extensions to a Memetic Timetabling System

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Depth-First Branch-and-Bound versus Local Search: A Case Study

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
Editorial: The traveling salesman problem

Discrete Optimization

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem

Proceedings of the 2008 ACM symposium on Applied computing
A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem

Engineering Applications of Artificial Intelligence
A memetic neural network for the Euclidean traveling salesman problem

Neurocomputing
A Vehicle Routing Problem Solved by Agents

HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Phrase-based statistical machine translation as a traveling salesman problem

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Three-tier multi-agent approach for solving traveling salesman problem

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Interaction of culture-based learning and cooperative co-evolution and its application to automatic behavior-based system design

IEEE Transactions on Evolutionary Computation
A parallel memetic algorithm applied to the total tardiness machine scheduling problem

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An efficient memetic algorithm for solving the job shop scheduling problem

Computers and Industrial Engineering
Evolutionary discrete firefly algorithm for travelling salesman problem

ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
An improved multi-agent approach for solving large traveling salesman problem

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms

SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications: An International Journal
Identification of breast cancer subtypes using multiple gene expression microarray datasets

AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Iterative patching and the asymmetric traveling salesman problem

Discrete Optimization
Global optimization using a genetic algorithm with hierarchically structured population

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new memetic algorithm specialized for the asymmetric instances of the traveling salesman problem (ATSP). The method incorporates a new local search engine and many other features that contribute to its effectiveness, such as: (i) the topological organization of the population as a complete ternary tree with thirteen nodes; (ii) the hierarchical organization of the population in overlapping clusters leading to the special selection scheme; (iii) efficient data structures. Computational experiments are conducted on all ATSP instances available in the TSPLIB, and on a set of larger asymmetric instances with known optimal solutions. The comparisons show that the results obtained by our method compare favorably with those obtained by several other algorithms recently proposed for the ATSP.