Authors: Matijević, Luka 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: General Variable Neighborhood Search for Electric Vehicle Routing Problem
Related Publication(s): Book of Abstract
Conference: ICVNS Abu Dhabi, U.A.E., October, 25-28, 2022
Issue Date: 2022
Rank: M34
This paper focuses on the Electric Vehicle Routing Problem with soft time windows and time-dependent speeds. The goal is to minimize the total distance traveled and the penalty for arriving early or late at the customers’ locations. We present a Mixed Integer Linear Program (MILP) formulation and propose a General Variable Neighborhood Search (GVNS) metaheuristic as a solution approach. We tested the model and GVNS against the Adaptive Large Neighborhood Search (ALNS) algorithm, using a set of benchmark instances. Experimental evaluation indicates that GVNS can find better quality solutions than MILP and ALNS or the same quality solution in less time.

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.