A Branch and Price algorithm for the electric capacitated profitable tour problem with mandatory stops
Abstract
In this paper, a generalization of the capacitated profitable tour problem is presented. Since recharging time and driver’s lunch breaks are commonly considered as an idle time, the aim is to synchronize those activities choosing restaurants where electric vehicles can be charged. Due to visiting restaurants has an associated cost, the problem can also be seen as a problem with location issues. This variant is pertinent especially in a city logistics context. A mathematical model is proposed, as well as a Branch-and-Price algorithm which is able to solve instances with up to 100 customers and 13 restaurants.