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

András Király, János Abonyi

Research output: Chapter in Book/Report/Conference proceedingChapter

18 Citations (Scopus)


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 publicationComputational Intelligence in Engineering
EditorsImre Rudas
Number of pages11
Publication statusPublished - Nov 3 2010

Publication series

NameStudies in Computational Intelligence
ISSN (Print)1860-949X



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

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 I. Rudas (Ed.), Computational Intelligence in Engineering (pp. 141-151). (Studies in Computational Intelligence; Vol. 313). https://doi.org/10.1007/978-3-642-15220-7_12