DC FieldValueLanguage
dc.contributor.authorPei, Junen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.contributor.authorBrimberg, Jacken
dc.contributor.authorLiu, Xinbaoen
dc.date.accessioned2020-05-01T20:13:51Z-
dc.date.available2020-05-01T20:13:51Z-
dc.date.issued2020-01-01en
dc.identifier.issn0020-0255en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1757-
dc.description.abstractThe Traveling Repairman Problem with profits generalizes the Traveling Repairman Problem, by taking into account the variability of the repairman's profit over different time steps in order to maximize the total profit. In this paper, we first analyze the complexities of several neighborhood structures and the efficient updating of objective values of solutions from those neighborhoods. Then we present a new heuristic based on General variable neighborhood search, that uses a local search that combines those neighborhoods in an effective way. Detailed experiments on benchmark instances show that our new method outperforms all previous heuristics. Out of 60 instances tested, it was able to replicate the best known solutions in 20 of them and find new best solutions in the remaining 40.en
dc.publisherElsevier-
dc.relationNational Natural Science Foundation of China (nos. 71871080, 71601065, 71690235, 71521001)-
dc.relationDevelopment of information technologies and systems for stimulation of personality’s sustainable development as one of the bases of development of digital Kazakhstan, Grant BR05236839-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relationDevelopment 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.ispartofInformation Sciencesen
dc.subjectCombinatorial optimization | Heuristics | Traveling repairman problem with profits | Variable neighborhood searchen
dc.titleSolving the traveling repairman problem with profits: A Novel variable neighborhood search approachen
dc.typeArticleen
dc.identifier.doi10.1016/j.ins.2019.08.017en
dc.identifier.scopus2-s2.0-85070791509en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage108en
dc.relation.lastpage123en
dc.relation.volume507en
dc.description.rankM21a-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.fundingProgramNATIONAL HEART, LUNG, AND BLOOD INSTITUTE-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04-
Show simple item record

SCOPUSTM   
Citations

41
checked on Jun 12, 2024

Page view(s)

107
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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