A novel approach to solve multiple traveling salesmen problem by genetic algorithm

András Király, J. Abonyi

Research output: Chapter in Book/Report/Conference proceedingChapter

16 Citations (Scopus)

Abstract

The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall minimum route cost which service all the demands. Because of the fact that TSP is already a complex, namely an NP-complete problem, heuristic optimization algorithms, like genetic algorithms (GAs) need to take into account. The extension of classical GA tools for mTSP is not a trivial problem, it requires special, interpretable encoding to ensure efficiency. The aim of this paper is to review how genetic algorithms can be applied to solve these problems and propose a novel, easily interpretable representation based GA.

Original languageEnglish
Title of host publicationStudies in Computational Intelligence
Pages141-151
Number of pages11
Volume313
DOIs
Publication statusPublished - 2010

Publication series

NameStudies in Computational Intelligence
Volume313
ISSN (Print)1860949X

Fingerprint

Traveling salesman problem
Genetic algorithms
Combinatorial optimization
Computational complexity
Costs

Keywords

  • genetic algorithm
  • mTSP
  • multi-chromosome
  • optimization
  • VRP

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Király, A., & Abonyi, J. (2010). A novel approach to solve multiple traveling salesmen problem by genetic algorithm. In Studies in Computational Intelligence (Vol. 313, pp. 141-151). (Studies in Computational Intelligence; Vol. 313). https://doi.org/10.1007/978-3-642-15220-7_12

A novel approach to solve multiple traveling salesmen problem by genetic algorithm. / Király, András; Abonyi, J.

Studies in Computational Intelligence. Vol. 313 2010. p. 141-151 (Studies in Computational Intelligence; Vol. 313).

Research output: Chapter in Book/Report/Conference proceedingChapter

Király, A & Abonyi, J 2010, A novel approach to solve multiple traveling salesmen problem by genetic algorithm. in Studies in Computational Intelligence. vol. 313, Studies in Computational Intelligence, vol. 313, pp. 141-151. https://doi.org/10.1007/978-3-642-15220-7_12
Király A, Abonyi J. A novel approach to solve multiple traveling salesmen problem by genetic algorithm. In Studies in Computational Intelligence. Vol. 313. 2010. p. 141-151. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-642-15220-7_12
Király, András ; Abonyi, J. / A novel approach to solve multiple traveling salesmen problem by genetic algorithm. Studies in Computational Intelligence. Vol. 313 2010. pp. 141-151 (Studies in Computational Intelligence).
@inbook{c33f75375b6240b6827f4b80c7a9872a,
title = "A novel approach to solve multiple traveling salesmen problem by genetic algorithm",
abstract = "The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall minimum route cost which service all the demands. Because of the fact that TSP is already a complex, namely an NP-complete problem, heuristic optimization algorithms, like genetic algorithms (GAs) need to take into account. The extension of classical GA tools for mTSP is not a trivial problem, it requires special, interpretable encoding to ensure efficiency. The aim of this paper is to review how genetic algorithms can be applied to solve these problems and propose a novel, easily interpretable representation based GA.",
keywords = "genetic algorithm, mTSP, multi-chromosome, optimization, VRP",
author = "Andr{\'a}s Kir{\'a}ly and J. Abonyi",
year = "2010",
doi = "10.1007/978-3-642-15220-7_12",
language = "English",
isbn = "9783642152191",
volume = "313",
series = "Studies in Computational Intelligence",
pages = "141--151",
booktitle = "Studies in Computational Intelligence",

}

TY - CHAP

T1 - A novel approach to solve multiple traveling salesmen problem by genetic algorithm

AU - Király, András

AU - Abonyi, J.

PY - 2010

Y1 - 2010

N2 - The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall minimum route cost which service all the demands. Because of the fact that TSP is already a complex, namely an NP-complete problem, heuristic optimization algorithms, like genetic algorithms (GAs) need to take into account. The extension of classical GA tools for mTSP is not a trivial problem, it requires special, interpretable encoding to ensure efficiency. The aim of this paper is to review how genetic algorithms can be applied to solve these problems and propose a novel, easily interpretable representation based GA.

AB - The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall minimum route cost which service all the demands. Because of the fact that TSP is already a complex, namely an NP-complete problem, heuristic optimization algorithms, like genetic algorithms (GAs) need to take into account. The extension of classical GA tools for mTSP is not a trivial problem, it requires special, interpretable encoding to ensure efficiency. The aim of this paper is to review how genetic algorithms can be applied to solve these problems and propose a novel, easily interpretable representation based GA.

KW - genetic algorithm

KW - mTSP

KW - multi-chromosome

KW - optimization

KW - VRP

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

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

U2 - 10.1007/978-3-642-15220-7_12

DO - 10.1007/978-3-642-15220-7_12

M3 - Chapter

AN - SCOPUS:78049303195

SN - 9783642152191

VL - 313

T3 - Studies in Computational Intelligence

SP - 141

EP - 151

BT - Studies in Computational Intelligence

ER -