This paper introduces a novel type of a problem in which two travelling salespersons are competing, where each of them has two conflicting objectives. This problem is categorized as a Multi-Objective Game (MOG). It is solved by a non-utility approach, which has recently been introduced. According to this method all rationalizable strategies are initially found, to support posteriori decision on a strategy. An evolutionary algorithm is proposed to search for the set of rationalizable strategies. The applicability of the suggested algorithm is successfully demonstrated on the presented new type of problem.
CITATION STYLE
Matalon-Eisenstadt, E., Moshaiov, A., & Avigad, G. (2016). The competing travelling salespersons problem under multi-criteria. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9921 LNCS, pp. 463–472). Springer Verlag. https://doi.org/10.1007/978-3-319-45823-6_43
Mendeley helps you to discover research relevant for your work.