New variable neighbourhood search based 0-1 MIP heuristics - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles Yugoslav Journal of Operations Research Year : 2015

New variable neighbourhood search based 0-1 MIP heuristics

Said Hanafi
  • Function : Author
  • PersonId : 1129059
Jasmina Lazic
  • Function : Author
Nenad Mladenovic
  • Function : Author
  • PersonId : 952650
Christophe Wilbaut
Igor Crevits
  • Function : Author
  • PersonId : 974522

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.
Fichier principal
Vignette du fichier
Hanafi et al. - 2015 - New variable neighbourhood search based 0-1 MIP he.pdf (104.79 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03401572 , version 1 (15-07-2022)

Identifiers

Cite

Said Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crevits. New variable neighbourhood search based 0-1 MIP heuristics. Yugoslav Journal of Operations Research, 2015, 25 (3), pp.343-360. ⟨10.2298/YJOR140219014H⟩. ⟨hal-03401572⟩

Collections

UNIV-VALENCIENNES
33 View
14 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More