Variable Neighborhood Search: The power of change and simplicity

被引：37

作者：

Brimberg, Jack ^{[1
]}

Salhi, Said ^{[2
]}

Todosijevic, Raca ^{[3
,4
]}

Urosevic, Dragan ^{[5
]}

机构：

[1] Royal Mil Coll Canada, Dept Math & Comp Sci, Kingston, ON, Canada

[2] Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat CLHO, Canterbury, England

[3] Univ Polytech Hauts De France, CNRS, UMR 8201, LAMIH, F-59313 Valenciennes, France

[4] INSA Hauts De France, F-59313 Valenciennes, France

[5] Serbian Acad Arts & Sci, Math Inst, Knez Mihajlova 36, Belgrade, Serbia

来源：

COMPUTERS & OPERATIONS RESEARCH | 2023年 / 155卷

关键词：

Metaheuristic; Variable neighborhood search; Less-is-More; Variable formulation space; VEHICLE-ROUTING PROBLEM; DECOMPOSITION SEARCH; TABU SEARCH; ALGORITHM; LESS; OPTIMIZATION; HEURISTICS; DRONES;

D O I：

10.1016/j.cor.2023.106221

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This review discusses and analyses three main contributions championed by Professor Mladenovic. These include variable neighborhood search (VNS), variable formulation space (VFS), and finally, the less-is-more approach (LIMA). These three methodologies share two important ingredients, namely, simplicity and change. Given that Professor Mladenovic is widely known for VNS, we will focus mainly on this methodology and its developments as well as a sampling of successful applications. This is followed by a shorter discussion covering VFS and LIMA. We introduce several remarks throughout the text to highlight certain aspects while also suggesting challenging research areas to examine.

引用

页数：12

共 50 条

[21] Topic Modeling with Variable Neighborhood Search
Toleu, Alymzhan
Tolegen, Gulmira
Mussabayev, Rustam
ADVANCES IN COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2024, PT II, 2024, 2166 : 234 - 246
[22] A variable neighborhood search for graph coloring
Avanthay, C
Hertz, A
Zufferey, N
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) : 379 - 388
[23] Variable neighborhood search and local branching
Hansen, P
Mladenovic, N
Urosevic, D
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (10) : 3034 - 3045
[24] Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
Lai, Xiangjing
Hao, Jin-Kao
Fu, Zhang-Hua
Yue, Dong
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (03) : 1067 - 1086
[25] .Modularity maximization in networks by variable neighborhood search
Aloise, Daniel
Caporossi, Gilles
Hansen, Pierre
Liberti, Leo
Perron, Sylvain
Ruiz, Manuel
GRAPH PARTITIONING AND GRAPH CLUSTERING, 2013, 588 : 113 - +
[26] Preface to the special issue on variable neighborhood search
Nenad Mladenović
Panos M. Pardalos
Angelo Sifaleras
Rachid Benmansour
Optimization Letters, 2022, 16 : 1 - 4
[27] Partitioning with Variable Neighborhood Search: A bioinspired approach
Bernabe Loranca, Maria Beatriz
Gonzalez Velazquez, Rogelio
Olivares Benitez, Elias
Pinto Avendano, David
Ramirez Rodriguez, Javier
Martinez Flores, Jose Luis
PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 150 - 155
[28] Variable neighborhood search for harmonic means clustering
Alguwaizani, Abdulrahman
Hansen, Pierre
Mladenovic, Nenad
Ngai, Eric
APPLIED MATHEMATICAL MODELLING, 2011, 35 (06) : 2688 - 2694
[29] Variable neighborhood search for the linear ordering problem
Garcia, Carlos G.
Perez-Brito, Dionisio
Campos, Vicente
Marti, Rafael
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3549 - 3565
[30] Gaussian variable neighborhood search for continuous optimization
Carrizosa, Emilio
Drazic, Milan
Drazic, Zorica
Mladenovic, Nenad
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2206 - 2213

← 1 2 3 4 5 →