Solving Route Planning Using Euler Path Transform

Abstract

This paper presents a method to solve route planning problem in maze game and waste collection using Euler path transform, the core technique is mixed-integer linear programming (MILP). There are three issues are considered in the transformation, including, the direction of edge, the limited number of edge, and the user-defined starting and ending vertices. The experiment results show that the proposed method is capable of finding the optimal result for route planning.