DOI

We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems. We apply to the bi-ATSP the axiomatic approach of the Pareto set reduction proposed by V. Noghin. We identify series of “quanta of information” that guarantee the reduction of the Pareto set for particular cases of the bi-ATSP. An approximation of the Pareto set to the bi-ATSP is constructed by a new multi-objective genetic algorithm. The experimental evaluation carried out in this paper shows the degree of reduction of the Pareto set approximation for various “quanta of information” and various structures of the bi-ATSP instances generated randomly.

Original languageEnglish
Title of host publicationOptimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers
EditorsMichael Khachay, Yury Kochetov, Anton Eremeev, Panos Pardalos, Panos Pardalos
PublisherSpringer Nature
Pages93-105
Number of pages13
ISBN (Print)9783319937991
DOIs
StatePublished - 1 Jan 2018
Event7th International Conference on Optimization Problems and Their Applications, OPTA 2018 - Omsk, Russian Federation
Duration: 8 Jun 2018 → 14 Jun 2018

Publication series

NameCommunications in Computer and Information Science
Volume871
ISSN (Print)1865-0929

Conference

Conference7th International Conference on Optimization Problems and Their Applications, OPTA 2018
Country/TerritoryRussian Federation
CityOmsk
Period8/06/18 → 14/06/18

    Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

    Research areas

  • Computational experiment, Multi-objective genetic algorithm, Reduction of the pareto set

ID: 38399939