DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorTodosijević, Racaen
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:54Z-
dc.date.available2020-05-01T20:13:54Z-
dc.date.issued2014-12-01en
dc.identifier.issn0305-0548en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1783-
dc.description.abstractAttractive traveling salesman problem (AtTSP) consists of finding maximal profit tour starting and ending at a given depot after visiting some of the facilities. Total length of the tour must not exceed the given maximum distance. Each facility achieves profit from the customers, based on the distance between the facility and customers as well as on the attractiveness of that facility. Total profit of a tour is equal to a sum of profits of all visited facilities. In this paper, we develop a new variant of Variable neighborhood search, called 2-level General variable neighborhood search (2-GVNS) for solving AtTSP. At the second level, we use General variable neighborhood search in the local search lor building neighboring solution and checking its feasibility. Our 2-GVNS heuristic outperforms tabu search heuristic, the only one proposed in the literature so far, in terms of precision and running times. In addition, 2-GVNS finds all optimal known solutions obtained by Branch and cut algorithm and offers several new best known solutions.en
dc.publisherElsevier-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relation.ispartofComputers and Operations Researchen
dc.subject2-level GVNS | Demand allocation | Demand attraction | Traveling salesman problem | Variable neighborhood searchen
dc.titleTwo level General variable neighborhood search for Attractive traveling salesman problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2013.04.015en
dc.identifier.scopus2-s2.0-84938677547en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage341en
dc.relation.lastpage348en
dc.relation.volume52en
dc.description.rankM21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
Show simple item record

SCOPUSTM   
Citations

24
checked on Jun 20, 2024

Page view(s)

67
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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