Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://hdl.handle.net/11701/15250
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Zakharov, Aleksey O. | - |
dc.contributor.author | Kovalenko, Yulia V. | - |
dc.date.accessioned | 2019-01-16T16:05:23Z | - |
dc.date.available | 2019-01-16T16:05:23Z | - |
dc.date.issued | 2018-12 | - |
dc.identifier.citation | 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. | en_GB |
dc.identifier.other | 10.21638/11702/spbu10.2018.410 | - |
dc.identifier.uri | http://hdl.handle.net/11701/15250 | - |
dc.description.abstract | 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. | en_GB |
dc.description.sponsorship | 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). | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | St Petersburg State University | en_GB |
dc.relation.ispartofseries | Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 14; Issue 4 | - |
dc.subject | reduction of the Pareto set | en_GB |
dc.subject | decision maker preferences | en_GB |
dc.subject | multiobjective genetic algorithm | en_GB |
dc.subject | computational experiment | en_GB |
dc.title | Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria | en_GB |
dc.type | Article | en_GB |
Располагается в коллекциях: | Issue 4 |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
10-Zakharov.pdf | 364,29 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.