DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorTodosijević, Racaen
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:55Z-
dc.date.available2020-05-01T20:13:55Z-
dc.date.issued2012-12-01en
dc.identifier.issn1571-0653-
dc.description.abstractAlthough GVNS is shown to be powerful and robust method for solving traveling salesman and vehicle routing problems, its efficient implementation may play significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving TSPTW. It uses more efficient data structure, different neighborhoods, new efficient feasibility checking procedure, for example, than a recent GVNS method [Da Silva, R. F., and S. Urrutia, A General VNS heuristic for the traveling salesman problem with time windows, Discrete Optimization 7 (2010), 203-211.], that may be considered as a state-of-the-art heuristic. As a result, our GVNS is significantly faster than previous GVNS and therefore is able to improve 14 out of 25 best known solutions for large test instances from the literature.en
dc.publisherElsevier-
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen
dc.subjectGVNS | Time window | Traveling Salesman Problemen
dc.titleAn efficient GVNS for solving Traveling Salesman Problem with Time Windowsen
dc.typeArticleen
dc.identifier.doi10.1016/j.endm.2012.10.012en
dc.identifier.scopus2-s2.0-84870266749en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage83en
dc.relation.lastpage90en
dc.relation.volume39en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

11
checked on Nov 28, 2022

Page view(s)

38
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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