General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows

Summary: This paper studies the Electric Vehicle Routing Problem with time-dependent speeds and soft time windows. The authors formulated a Mixed Integer Linear Program (MILP) and developed a General Variable Neighborhood Search (GVNS) metaheuristic to tackle the problem. Experimental results showed that GVNS can find better quality solutions in less time compared to other methods.