DC Field | Value | Language |
---|---|---|
dc.contributor.author | Matijević, Luka | en_US |
dc.contributor.author | Ilin, Vladimir | en_US |
dc.contributor.author | Davidović, Tatjana | en_US |
dc.contributor.author | Jakšić Kruger, Tatjana | en_US |
dc.contributor.author | Pardalos, Panos M. | en_US |
dc.date.accessioned | 2024-06-26T10:37:42Z | - |
dc.date.available | 2024-06-26T10:37:42Z | - |
dc.date.issued | 2024-07-01 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/5323 | - |
dc.description.abstract | We consider a real-life transportation problem from a hypermarket company in Serbia that consists of delivering online ordered and possibly perishable goods from a single depot to multiple customers. It can be modeled as an asymmetric vehicle routing problem that requires visiting and serving all customers using a limited number of homogeneous vehicles and taking into account time and capacity constraints. The objective function to be minimized is the total distance traveled. We provide a mixed-integer programming (MIP) formulation of the problem and develop several Local Search based metaheuristic methods exploring combinatorial formulation of the considered problem: Multistart Local Search (MLS), Greedy Randomized Adaptive Search Procedure (GRASP), and several variants of General Variable Neighborhood Search (GVNS) methods. All methods are compared on real-life instances provided by the hypermarket company and benchmark instances from the relevant literature. The obtained results show the superiority of GVNS-based methods with respect to both solution quality and running time, confirming that systematic search procedures have more success when dealing with hard optimization problems. | en_US |
dc.publisher | Elsevier | en_US |
dc.relation | Project no. 451-03-47/2023-01/200156 “Innovative scientific and artistic research from the FTS (activity) domain ” and Contract No. 451-03-47/2023-01/ 200029 | en_US |
dc.relation.ispartof | Computers and Operations Research | en_US |
dc.subject | Local search | Metaheuristics | Minimization of total distance | Multiple neighborhoods | Routing homogeneous vehicles | Single depot | en_US |
dc.title | General VNS for asymmetric vehicle routing problem with time and capacity constraints | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.cor.2024.106630 | - |
dc.identifier.scopus | 2-s2.0-85189859235 | - |
dc.contributor.affiliation | Computer Science | en_US |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | en_US |
dc.relation.firstpage | 106630 | - |
dc.relation.volume | 167 | - |
dc.description.rank | ~M21 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0002-4575-6720 | - |
crisitem.author.orcid | 0000-0001-9561-5339 | - |
crisitem.author.orcid | 0000-0001-6766-4811 | - |
SCOPUSTM
Citations
1
checked on Sep 16, 2024
Page view(s)
6
checked on Sep 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.