Authors: Matijević, Luka 
Davidović, Tatjana 
Ilin, Vladimir
Pardalos, Panos
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: General Variable Neighborhood Search for Asymmetric Vehicle Routing Problem
First page: 185
Last page: 190
Conference: XLVI Symposium on Operational Research, SYMOPIS 2019, Kladovo, Sept. 15-18, 2019
Issue Date: 2019
Rank: M63
The minimization of total distance in an asymmetric vehicle routing problem with a hard time window for serving all the customers is considered. This problem is used to model a real-life problem of delivering perishable and non-perishable goods to multiple customers. All the customers should be visited exactly ones with one among a limited number of homogeneous vehicles (with the same capacity and speed). Having in mind that the problem is NP-hard, we developed a General Variable Neighborhood Search (GVNS) approach and tested it on a set of available real-life instances. Our computational results show that the proposed GVNS is able to generate high quality solutions within reasonably short CPU time.
Keywords: Combinatorial optimization | Routing of homogeneous vehicles | Single depot | Minimization of total distance | Metaheuristics
Publisher: Faculty of Transport and Traffic Engineering, University of Belgrade

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.