Authors: Hansen, Pierre
Mladenović, Nenad 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Variable neighborhood search and local branching
Journal: Computers and Operations Research
Volume: 33
Issue: 10
First page: 3034
Last page: 3045
Issue Date: 1-Jan-2006
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.02.033
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. Neighborhoods around the incumbent solution are defined by adding constraints to the original problem, as suggested in the recent local branching (LB) method of Fischetti and Lodi (Mathematical Programming Series B 2003;98:23-47). Both LB and VNS use the same tools: CPLEX and the same definition of the neighborhoods around the incumbent. However, our VNS is simpler and more systematic in neighborhood exploration. Consequently, within the same time limit, we were able to improve 14 times the best known solution from the set of 29 hard problem instances used to test LB.
Keywords: CPLEX | Local branching | Mixed integer programming | Variable neighborhood search
Publisher: Elsevier

Show full item record


checked on Jun 20, 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.