Authors: Davidović, Tatjana 
Matijević, Luka 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Matheuristics Based on Variable Neighborhood Search
First page: 500
Last page: 505
Conference: XLVII Symposium on Operational Research, SYMOPIS 2020, Virtual conference, Sept. 20-23, 2020
Issue Date: 2020
Rank: M63
Matheuristics represent heuristic optimization methods based on hybridizing exact solvers with metaheuristics. Usually, the exact solvers work on Mathematical Programming (more precisely Mixed Integer Linear Programming, MILP) formulation of the considered problem. Metaheuristic principles are used to define subproblems (e.g., by fixing values for a subset of variables) and exact solver is then invoked to determine values for the remaining variables. The main goal of this paper is to promote three matheuristics that explore Variable Neighborhood Search (VNS) as metaheuristic part. These are Variable Neighborhood Branching (VNB),Variable Neighborhood Decomposition Search for 0-1 MIP problems (VNDS-MIP), and Variable Intensity Neighborhood Search (VINS).
Keywords: Optimization problems | Mixed integer programs | Exact solvers | Metaheuristics | Hybrid methods
Publisher: Faculty of Transport and Traffic Engineering, University of Belgrade

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM


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