Fişli elektrikli araçlar için hız optimizasyonu ile enerji tüketimini enazlayan yol bulma

Given an origin-destination pair over a directed network, the problem of determining a path joining origin and destination, the speed of a plug-in electric vehicle on each road segment, i.e., arc, along the path, the charging stations the vehicle will stop by, and how much to recharge at each stop so as to minimize the total amount energy consumption of the vehicle is considered. There are speed limits on each road segment, and the vehicle has to arrive at the destination on or before a given time-limit. For this problem, firstly, a mixed-integer second order cone programming formulation is proposed. Secondly, to be able to solve larger size instances, a matheuristic is developed. Lastly, a variable neighborhood search (VNS) heuristic is designed for this problem. Solution quality and computation times of the heuristics and the exact algorithm are compared on different instances.