We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
NEW VARIABLE NEIGHBOURHOOD SEARCH BASED 0-1 MIP HEURISTICS.
- Authors
HANAFI, Saïd; LAZIĆ, Jasmina; MLADENOVIĆ, Nenad; WILBAUT, Christophe; CRÉVITS, Igor
- Abstract
In recent years many so-called matheuristics have been proposed for solving Mixed Integer Programming (MIP) problems. Though most of them are very efficient, they do not all theoretically converge to an optimal solution. In this paper we suggest two matheuristics, based on the variable neighbourhood decomposition search (VNDS), and we prove their convergence. Our approach is computationally competitive with the current state-of-the-art heuristics, and on a standard benchmark of 59 0-1 MIP instances, our best heuristic achieves similar solution quality to that of a recently published VNDS heuristic for 0-1 MIPs within a shorter execution time.
- Subjects
INTEGER programming; HEURISTIC algorithms; DECOMPOSITION method
- Publication
Yugoslav Journal of Operations Research, 2015, Vol 25, Issue 3, p343
- ISSN
0354-0243
- Publication type
Article
- DOI
10.2298/yjor140219014h