A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

In Chan Choi, Seong In Kim, Hak Soo Kim

Research output: Contribution to journalArticle

83 Citations (Scopus)

Abstract

This paper presents a genetic algorithm to solve the asymmetric traveling salesman problem. The genetic algorithm proposed in this study extends search space by purposefully generating and including infeasible solutions in the population. Instead of trying to maintain feasibility with crossover operations, it searches through both feasible and infeasible regions for good quality solutions. It is also shown in the article that the size of the infeasible region defined by solutions with subtours dominates that of a feasible region in the asymmetric traveling salesman problem. A comparative computational study using benchmark problems shows that the proposed genetic algorithm is a viable option for hard asymmetric traveling salesman problems. The asymmetric traveling salesman problem appears in various applications, such as vehicle routing problems, mixed Chinese postman problems, and scheduling problems with sequence dependent setups. Although there exist several heuristic procedures and branch and bound algorithms for it, the problem is still a difficult combinatorial optimization problem. The main purpose of the paper is to present a new genetic algorithm for the problem and to show its effectiveness. To give a justification for the algorithm, the paper also analyses the sizes of feasible and infeasible regions in the asymmetric traveling salesman problem. This analysis provides a basis for the choice of the solution representation (coding) scheme adopted in the genetic algorithm. The genetic operators that are well suited for this representation scheme are then identified for the problem.

Original languageEnglish
Pages (from-to)773-786
Number of pages14
JournalComputers and Operations Research
Volume30
Issue number5
DOIs
Publication statusPublished - 2003 Apr 1

Fingerprint

Asymmetric Traveling Salesman Problem
salesman
Traveling salesman problem
Genetic algorithms
Genetic Algorithm
Sequence-dependent Setups
Chinese Postman Problem
Vehicle routing
Genetic Operators
Feasible region
Vehicle Routing Problem
Combinatorial optimization
Mixed Problem
Branch and Bound Algorithm
Combinatorial Optimization Problem
Justification
Search Space
Crossover
Mathematical operators
Scheduling Problem

Keywords

  • Asymmetric traveling salesman problems
  • Combinatorial optimization
  • Genetic algorithm
  • Heuristic procedure
  • Mixed region search

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. / Choi, In Chan; Kim, Seong In; Kim, Hak Soo.

In: Computers and Operations Research, Vol. 30, No. 5, 01.04.2003, p. 773-786.

Research output: Contribution to journalArticle

@article{487b268a6d1747838534813d258dac7d,
title = "A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem",
abstract = "This paper presents a genetic algorithm to solve the asymmetric traveling salesman problem. The genetic algorithm proposed in this study extends search space by purposefully generating and including infeasible solutions in the population. Instead of trying to maintain feasibility with crossover operations, it searches through both feasible and infeasible regions for good quality solutions. It is also shown in the article that the size of the infeasible region defined by solutions with subtours dominates that of a feasible region in the asymmetric traveling salesman problem. A comparative computational study using benchmark problems shows that the proposed genetic algorithm is a viable option for hard asymmetric traveling salesman problems. The asymmetric traveling salesman problem appears in various applications, such as vehicle routing problems, mixed Chinese postman problems, and scheduling problems with sequence dependent setups. Although there exist several heuristic procedures and branch and bound algorithms for it, the problem is still a difficult combinatorial optimization problem. The main purpose of the paper is to present a new genetic algorithm for the problem and to show its effectiveness. To give a justification for the algorithm, the paper also analyses the sizes of feasible and infeasible regions in the asymmetric traveling salesman problem. This analysis provides a basis for the choice of the solution representation (coding) scheme adopted in the genetic algorithm. The genetic operators that are well suited for this representation scheme are then identified for the problem.",
keywords = "Asymmetric traveling salesman problems, Combinatorial optimization, Genetic algorithm, Heuristic procedure, Mixed region search",
author = "Choi, {In Chan} and Kim, {Seong In} and Kim, {Hak Soo}",
year = "2003",
month = "4",
day = "1",
doi = "10.1016/S0305-0548(02)00050-3",
language = "English",
volume = "30",
pages = "773--786",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

AU - Choi, In Chan

AU - Kim, Seong In

AU - Kim, Hak Soo

PY - 2003/4/1

Y1 - 2003/4/1

N2 - This paper presents a genetic algorithm to solve the asymmetric traveling salesman problem. The genetic algorithm proposed in this study extends search space by purposefully generating and including infeasible solutions in the population. Instead of trying to maintain feasibility with crossover operations, it searches through both feasible and infeasible regions for good quality solutions. It is also shown in the article that the size of the infeasible region defined by solutions with subtours dominates that of a feasible region in the asymmetric traveling salesman problem. A comparative computational study using benchmark problems shows that the proposed genetic algorithm is a viable option for hard asymmetric traveling salesman problems. The asymmetric traveling salesman problem appears in various applications, such as vehicle routing problems, mixed Chinese postman problems, and scheduling problems with sequence dependent setups. Although there exist several heuristic procedures and branch and bound algorithms for it, the problem is still a difficult combinatorial optimization problem. The main purpose of the paper is to present a new genetic algorithm for the problem and to show its effectiveness. To give a justification for the algorithm, the paper also analyses the sizes of feasible and infeasible regions in the asymmetric traveling salesman problem. This analysis provides a basis for the choice of the solution representation (coding) scheme adopted in the genetic algorithm. The genetic operators that are well suited for this representation scheme are then identified for the problem.

AB - This paper presents a genetic algorithm to solve the asymmetric traveling salesman problem. The genetic algorithm proposed in this study extends search space by purposefully generating and including infeasible solutions in the population. Instead of trying to maintain feasibility with crossover operations, it searches through both feasible and infeasible regions for good quality solutions. It is also shown in the article that the size of the infeasible region defined by solutions with subtours dominates that of a feasible region in the asymmetric traveling salesman problem. A comparative computational study using benchmark problems shows that the proposed genetic algorithm is a viable option for hard asymmetric traveling salesman problems. The asymmetric traveling salesman problem appears in various applications, such as vehicle routing problems, mixed Chinese postman problems, and scheduling problems with sequence dependent setups. Although there exist several heuristic procedures and branch and bound algorithms for it, the problem is still a difficult combinatorial optimization problem. The main purpose of the paper is to present a new genetic algorithm for the problem and to show its effectiveness. To give a justification for the algorithm, the paper also analyses the sizes of feasible and infeasible regions in the asymmetric traveling salesman problem. This analysis provides a basis for the choice of the solution representation (coding) scheme adopted in the genetic algorithm. The genetic operators that are well suited for this representation scheme are then identified for the problem.

KW - Asymmetric traveling salesman problems

KW - Combinatorial optimization

KW - Genetic algorithm

KW - Heuristic procedure

KW - Mixed region search

UR - http://www.scopus.com/inward/record.url?scp=0037394108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037394108&partnerID=8YFLogxK

U2 - 10.1016/S0305-0548(02)00050-3

DO - 10.1016/S0305-0548(02)00050-3

M3 - Article

VL - 30

SP - 773

EP - 786

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 5

ER -