DC FieldValueLanguage
dc.contributor.authorLazić, Jasminaen
dc.contributor.authorHanafi, Saïden
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:56Z-
dc.date.available2020-05-01T20:13:56Z-
dc.date.issued2010-06-01en
dc.identifier.issn0305-0548en
dc.description.abstractIn this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver. We perform systematic hard variable fixing (or diving) following the variable neighbourhood search rules. The variables to be fixed are chosen according to their distance from the corresponding linear relaxation solution values. If there is an improvement, variable neighbourhood descent branching is performed as the local search in the whole solution space. Numerical experiments have proven that exploiting boundary effects in this way considerably improves solution quality. With our approach, we have managed to improve the best known published results for 8 out of 29 instances from a well-known class of very difficult MIP problems. Moreover, computational results show that our method outperforms the CPLEX MIP solver, as well as three other recent most successful MIP solution methods.en
dc.publisherElsevier-
dc.relation.ispartofComputers and Operations Researchen
dc.subject0-1 mixed integer programming | CPLEX | Metaheuristics | Variable neighbourhood searchen
dc.titleVariable neighbourhood decomposition search for 0-1 mixed integer programsen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2009.09.010en
dc.identifier.scopus2-s2.0-71849088764en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage1055en
dc.relation.lastpage1067en
dc.relation.issue6en
dc.relation.volume37en
dc.description.rankM21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-8635-4330-
Show simple item record

SCOPUSTM   
Citations

52
checked on Dec 1, 2021

Page view(s)

7
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric

Altmetric


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