Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Reduction of the pareto set in bicriteria asymmetric traveling salesman problem. / Zakharov, Aleksey O.; Kovalenko, Yulia V.
Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. ed. / Michael Khachay; Yury Kochetov; Anton Eremeev; Panos Pardalos; Panos Pardalos. Springer Nature, 2018. p. 93-105 (Communications in Computer and Information Science; Vol. 871).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Reduction of the pareto set in bicriteria asymmetric traveling salesman problem
AU - Zakharov, Aleksey O.
AU - Kovalenko, Yulia V.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - 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.
AB - 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.
KW - Computational experiment
KW - Multi-objective genetic algorithm
KW - Reduction of the pareto set
UR - http://www.scopus.com/inward/record.url?scp=85049684216&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-93800-4_8
DO - 10.1007/978-3-319-93800-4_8
M3 - Conference contribution
AN - SCOPUS:85049684216
SN - 9783319937991
T3 - Communications in Computer and Information Science
SP - 93
EP - 105
BT - Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers
A2 - Khachay, Michael
A2 - Kochetov, Yury
A2 - Eremeev, Anton
A2 - Pardalos, Panos
A2 - Pardalos, Panos
PB - Springer Nature
T2 - 7th International Conference on Optimization Problems and Their Applications, OPTA 2018
Y2 - 8 June 2018 through 14 June 2018
ER -
ID: 38399939