Authors: Hanafi, Saïd
Lazić, Jasmina
Mladenović, Nenad 
Title: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
Journal: Electronic Notes in Discrete Mathematics
Volume: 36
Issue: C
First page: 759
Last page: 766
Issue Date: 1-Aug-2010
ISSN: 1571-0653
DOI: 10.1016/j.endm.2010.05.096
In this paper we propose a new method for finding an initial feasible solution for Mixed integer programs. We call it "Variable neighborhood pump", since it combines ideas of Variable neighborhood branching and Feasibility pump heuristics. The proposed heuristic was tested on an established set of 83 benchmark problems proven to be difficult to solve to feasibility. The results are compared with those of IBM ILOG CPLEX 11.1, which already includes standard feasibility pump as a primal heuristic. With our approach we managed to obtain better initial objective function values than CPLEX on 63 test instances, within similar average computational time.
Keywords: 0-1 Mixed Integer Programming | Constructive Heuristics | CPLEX | Feasibility Pump | Variable Neighbourhood Search
Publisher: Elsevier

Show full item record


checked on May 28, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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