Geodesic
Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 14 (2018) no. 4, pp. 378-392

Voir la notice de l'article provenant de la source Math-Net.Ru

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 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 or from TSPLIB problems.
Keywords: reduction of the Pareto set, decision maker preferences, multiobjective genetic algorithm, computational experiment. 
@article{VSPUI_2018_14_4_a9,
     author = {A. O. Zakharov and Yu. V. Kovalenko},
     title = {Construction and reduction of the {Pareto} set in asymmetric travelling salesman problem with two criteria},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {378--392},
     publisher = {mathdoc},
     volume = {14},
     number = {4},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2018_14_4_a9/}
}
TY  - JOUR
AU  - A. O. Zakharov
AU  - Yu. V. Kovalenko
TI  - Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2018
SP  - 378
EP  - 392
VL  - 14
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2018_14_4_a9/
LA  - en
ID  - VSPUI_2018_14_4_a9
ER  - 
%0 Journal Article
%A A. O. Zakharov
%A Yu. V. Kovalenko
%T Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2018
%P 378-392
%V 14
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSPUI_2018_14_4_a9/
%G en
%F VSPUI_2018_14_4_a9
A. O. Zakharov; Yu. V. Kovalenko. Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 14 (2018) no. 4, pp. 378-392. http://geodesic.mathdoc.fr/item/VSPUI_2018_14_4_a9/