DC FieldValueLanguage
dc.contributor.authorMatijević, Lukaen_US
dc.contributor.authorDavidović, Tatjanaen_US
dc.contributor.authorIlin, Vladimiren_US
dc.contributor.authorPardalos, Panosen_US
dc.date.accessioned2020-12-16T10:41:35Z-
dc.date.available2020-12-16T10:41:35Z-
dc.date.issued2019-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4508-
dc.description.abstractThe 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.en_US
dc.publisherFaculty of Transport and Traffic Engineering, University of Belgradeen_US
dc.subjectCombinatorial optimization | Routing of homogeneous vehicles | Single depot | Minimization of total distance | Metaheuristicsen_US
dc.titleGeneral Variable Neighborhood Search for Asymmetric Vehicle Routing Problemen_US
dc.typeConference Paperen_US
dc.relation.conferenceXLVI Symposium on Operational Research, SYMOPIS 2019, Kladovo, Sept. 15-18, 2019en_US
dc.identifier.urlhttp://www.mi.sanu.ac.rs/~tanjad/AVRP-SYMOPIS2019-Final.pdf-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage185-
dc.relation.lastpage190-
dc.description.rankM63-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-4575-6720-
crisitem.author.orcid0000-0001-9561-5339-
Show simple item record

Page view(s)

93
checked on May 9, 2024

Google ScholarTM

Check


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