Integer Programming for Cooperative Route Optimization

Abstract

Cooperation among vehicles is essential for MaaS. In previous work, we developed a new cooperation concept, named delegation, using different types of vehicles. Further, we formalized a new route optimization problem enabling delegation. A fundamental approach to solve the problem is to define IP instances representing the optimization problem, and to solve the instances using a modern IP solver (e.g., Gurobi). However, the performance of solver-based methods highly depends on the instances and a subset of decision variables is not fully-used in optimization. In this paper, we develop a new IP instance of the optimization problem, evaluate them through numerical experiments, and discuss the instances and their features.