DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mladenović, Nenad | en |
dc.contributor.author | Todosijević, Raca | en |
dc.contributor.author | Urošević, Dragan | en |
dc.date.accessioned | 2020-05-01T20:13:55Z | - |
dc.date.available | 2020-05-01T20:13:55Z | - |
dc.date.issued | 2013-08-02 | en |
dc.identifier.issn | 0354-0243 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1787 | - |
dc.description.abstract | General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems. However, its efficient implementation may play a significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving Travelling salesman problem with time windows. It uses different set of neighborhoods, new feasibility checking procedure and a more efficient data structure than the recent GVNS method that can be considered as a state-of-the-art heuristic. As a result, our GVNS is much faster and more effective than the previous GVNS. It is able to improve 14 out of 25 best known solutions for large test instances from the literature. | en |
dc.publisher | Faculty of Organizational Sciences, University of Belgrade | - |
dc.relation | Mathematical Modelas and Optimization Methods on Large-Scale Systems | - |
dc.relation | Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education | - |
dc.relation.ispartof | Yugoslav Journal of Operations Research | en |
dc.subject | Time windows | Travelling salesman problem | Variable neighborhood search | en |
dc.title | An efficient general variable neighborhood search for large travelling salesman problem with time windows | en |
dc.type | Article | en |
dc.identifier.doi | 10.2298/YJOR120530015M | en |
dc.identifier.scopus | 2-s2.0-84880804478 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 19 | en |
dc.relation.lastpage | 30 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 23 | en |
dc.description.rank | M51 | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0001-6655-0409 | - |
crisitem.author.orcid | 0000-0002-9321-3464 | - |
crisitem.author.orcid | 0000-0003-3607-6704 | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php | - |
crisitem.project.fundingProgram | Directorate for Engineering | - |
crisitem.project.fundingProgram | NATIONAL HEART, LUNG, AND BLOOD INSTITUTE | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103 | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04 | - |
SCOPUSTM
Citations
42
checked on Apr 22, 2024
Page view(s)
73
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.