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 条

[61] A Double-Adaptive General Variable Neighborhood Search algorithm for the solution of the Traveling Salesman Problem [J].

Karakostas, Panagiotis ;

Sifaleras, Angelo .

APPLIED SOFT COMPUTING, 2022, 121

[62] Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem [J].

Karakostas, Panagiotis ;

Sifaleras, Angelo ;

Georgiadis, Michael C. .

EXPERT SYSTEMS WITH APPLICATIONS, 2020, 153

[63] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .1. P-CENTERS [J].

KARIV, O ;

HAKIMI, SL .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) :513-538

[64] CONFIGURATION SPACE ANALYSIS OF TRAVELING SALESMAN PROBLEMS [J].

KIRKPATRICK, S ;

TOULOUSE, G .

JOURNAL DE PHYSIQUE, 1985, 46 (08) :1277-1292

[65] A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances [J].

Kizys, Renatas ;

Doering, Jana ;

Juan, Angel A. ;

Polat, Onur ;

Calvet, Laura ;

Panadero, Javier .

COMPUTERS & OPERATIONS RESEARCH, 2022, 139

[66] The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach [J].

Kocaturk, Fatih ;

Tutuncu, G. Yazgi ;

Salhi, Said .

ANNALS OF OPERATIONS RESEARCH, 2021, 307 (1-2) :277-302

[67] Variable neighbourhood decomposition search for 0-1 mixed integer programs [J].

Lazic, Jasmina ;

Hanafi, Said ;

Mladenovic, Nenad ;

Urosevic, Dragan .

COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) :1055-1067

[68] Variable neighborhood search for two-agent flow shop scheduling problem [J].

Lei, Deming .

COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 80 :125-131

[69] A variable neighborhood decomposition search method for supply chain management planning problems [J].

Lejeune, M. A. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) :959-976

[70] A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem [J].

Li, Jun-qing ;

Pan, Quan-ke ;

Wang, Fa-tao .

APPLIED SOFT COMPUTING, 2014, 24 :63-77

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