title: Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
metadata.name: dc.contributor.author
metadata.value: Zakharov, Aleksey O.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Kovalenko, Yulia V.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2019-01-16T16:05:23Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2019-01-16T16:05:23Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2018-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Zakharov A. O., Kovalenko Yu. V. Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2018, vol. 14, iss. 4, pp. 378–392.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: 10.21638/11702/spbu10.2018.410
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/15250
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). The optimal
  solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather
  wide in real-world problems. For the first time, 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 multiobjective
  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 or from TSPLIB problems.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This work was supported by Russian Foundation for Basic Research (project N 17-07-00371) and by
  the Ministry of Science and Education of the Russian Federation (under the 5-100 Excellence Programme).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 14; Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: reduction of the Pareto set
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: decision maker preferences
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: multiobjective genetic algorithm
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: computational experiment
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 10-Zakharov.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/15250/1/10-Zakharov.pdf
resources.format: Adobe PDF
resources.size: 364,29 kB