CONCERTO: Constrained Linear Multi-Objective Routing Path Optimization

Routing through large urban areas is a daily problem for the vast majority of the commuters. In this paper, we consider the extension of the routing problem where we want to find the optimal path for different objectives. Specifically, we consider the problem for finding paths that are quick, safe or efficient in the use of resources. Multi-objective routing path optimization is an active research field in the area of path optimization. We present an efficient technique for finding the optimal path which satisfies user defined constraints. Experimental evaluation leads us to the conclusion that multi-objective routing path optimization can be deployed efficiently in terms of computational cost and solution accuracy. We perform experiments comparing our work with a state of the art technique which concerns the multi-objective shortest path optimization problem.