A Mixed Integer Linear Programming Formulation for Green Vehicle Routing Problem: Case for Shuttle Services

Abstract

In the present study, we focus on a two-stage Green Vehicle Routing Problem that we have formulated to investigate the shuttle routing plan for a relatively small and specific case. We seek in the latter stage the optimal speed profile for a route that is determined according to the shortest paths in the former stage. Our findings from the case, where two shuttles lines serve the internal area of a university campus, reveal that the two-stage formulation we propose is an efficient alternative to be utilized especially for practical applications in real life, where there is a smooth traffic with low speeds and no significant effect of the topography.