|Title:||New variable neighbourhood search based 0-1 MIP heuristics||Journal:||Yugoslav Journal of Operations Research||Volume:||25||Issue:||3||First page:||343||Last page:||360||Issue Date:||1-Jan-2015||Rank:||M51||ISSN:||0354-0243||DOI:||10.2298/YJOR140219014H||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.
|Keywords:||0-1 Mixed integer programming | Convergence | Matheuristics,Variable neighbourhood search | Pseudo-cuts||Publisher:||Faculty of Organizational Sciences, University of Belgrade|
Show full item record
checked on Apr 14, 2021
checked on Apr 15, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.