Variable Neighborhood Search: The power of change and simplicity

被引：47

作者：

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

共 132 条

[1]

Abdelkhalek O., 2015, Electron. Notes Discrete Math., V47, P189

[2] A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization [J].

Akbay, Mehmet Anil ;

Kalayci, Can B. ;

Polat, Olcay .

KNOWLEDGE-BASED SYSTEMS, 2020, 198

[3] A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems [J].

Alicastro, Mirko ;

Ferone, Daniele ;

Festa, Paola ;

Fugaro, Serena ;

Pastore, Tommaso .

COMPUTERS & OPERATIONS RESEARCH, 2021, 131

[4]

[Anonymous], 2010, Electron. Notes Discrete Math.

[5]

[Anonymous], 2015, Electron. Notes Discrete Math.

[6]

[Anonymous], 2010, Electron. Notes Discret. Math.

[7]

[Anonymous], 2016, Yugosl J Oper Res

[8]

[Anonymous], 2015, Electron. Notes Discrete Math, DOI DOI 10.1016/J.ENDM.2014.11.027

[9] A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty [J].

Antoniadis, Nikolaos ;

Cordy, Maxime ;

Sifaleras, Angelo ;

Le Traon, Yves .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (04) :2172-2200

[10] A green multi-facilities open location-routing problem with planar facility locations and uncertain customer [J].

Araghi, Mohammad Ebrahim Tayebi ;

Tavakkoli-Moghaddam, Reza ;

Jolai, Fariborz ;

Molana, Seyyed Mohammad Hadji .

JOURNAL OF CLEANER PRODUCTION, 2021, 282

← 1 2 3 4 5 6 7 8 9 10 →