Using the ε-constraint method to solve the multicriteria path planning problem
Veekeong Saw, Saw Hin, Amirah Rahman, Wen Eng Ong · AIP conference proceedings · 2019
A common situation in a multicriteria path planning problem is the existence of non-dominating solution paths known as the Pareto-optimal solution set. As the number of Pareto-optimal solutions increase with the problem size, it is hard for the decision maker to make decisions that reflect their needs without prior knowledge. A common approach that takes into account user preferences is the ε-Constraint Method, which searches for the best solution in the Pareto frontier. In this work, we test our solution method on 2-objective and 3-objective grid based traveling salesman path problems.