Abstract
Automated Transit Networks (ATN) are innovative transportation systems where fully driverless vehicles offer an exclusive on-demand transportation service. Within this context of ATN, this study tries to deal with a specific routing problem arising in the context of a ATN's network with a multiple depot topology. More specifically, we present an optimization routing model for automated transit networks which can be used to strategically evaluate depots locations. Our model extends the basic Multi-depot Vehicle Routing Problem (MDVRP). In this paper, the proposed model is tackled using an heuristic approach as the proposed problem is NP-Hard. Experiments are run on a carefully generated instances based on the works from the literature. The numerical results show that the proposed algorithm is competitive as it founds a small gap relative to a lower bound values from the literature.