An Electric Vehicle Routing Problem With Intermediate Nodes for Shuttle Fleets

Hülagü Kılıç S., Çelikoğlu H. B.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, vol.23, no.2, pp.1223-1235, 2022 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 23 Issue: 2
  • Publication Date: 2022
  • Doi Number: 10.1109/tits.2020.3023673
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, Compendex, INSPEC, Metadex, Civil Engineering Abstracts
  • Page Numbers: pp.1223-1235
  • Keywords: Routing, Roads, Batteries, Vehicle routing, Vehicle dynamics, Green products, Electric vehicles, vehicle routing, network theory (graphs), integer linear programming, optimization, TIME WINDOWS, SEARCH, SYSTEM
  • Istanbul Technical University Affiliated: Yes


In this article, we propose a variant of the electric vehicle routing problem considering explicitly the intermediate nodes. Ultimately aiming to provide an optimal routing plan for the shuttle fleet that serves to a university settlement internally, we consider a real road network by explicitly taking into account in the formulation the entire intersections existing and the time-varying passenger demand at shuttle stops, as well as the vehicle dynamics, battery, and recharging features. On purpose, a mathematical program to obtain the joint minimization of a number of objectives in terms of cost, i.e., vehicle operating, battery recharging, and recharging station purchasing, is formulated. Solutions employing an exact method are sought using models of mixed integer program within scenarios involving a number of features including the campus-wide passenger demand, seat capacity of shuttles, battery capacity of shuttles, and recharging station location. Further solutions to our model formulation have been obtained using a benchmark set of instances designed for a large-scale real network. Our findings show that considering a real road network as it is, is significant in exact routing solutions despite the fact that the level of network complexity is an issue. We suggest that a trade-off among the actuality of the network topology and the consequent computational load should be carefully made in order to obtain solutions using exact methods. As is shown, there is room to investigate further in details the dynamics of routing considering especially the effects of changes in flow conditions at intermediate nodes using our formulation.