Authors: Duarte, Abraham
Pantrigo, Juan
Pardo, Eduardo
Mladenović, Nenad 
Title: Multi-objective variable neighborhood search: an application to combinatorial optimization problems
Journal: Journal of Global Optimization
Volume: 63
Issue: 3
First page: 515
Last page: 536
Issue Date: 1-Nov-2015
Rank: M21
ISSN: 0925-5001
DOI: 10.1007/s10898-014-0213-z
Solutions to real-life optimization problems usually have to be evaluated considering multiple conflicting objectives. These kind of problems, known as multi-objective optimization problems, have been mainly solved in the past by using evolutionary algorithms. In this paper, we explore the adaptation of the Variable Neighborhood Search (VNS) metaheuristic to solve multi-objective combinatorial optimization problems. In particular, we describe how to design the shake procedure, the improvement method and the acceptance criterion within different VNS schemas (Reduced VNS, Variable Neighborhood Descent and General VNS), when two or more objectives are considered. We validate these proposals over two multi-objective combinatorial optimization problems.
Keywords: Antibandwidth | Cutwidth | Knapsack | Multi-objective optimization | Multi-objective VNS
Publisher: Springer Link

Show full item record


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