| Document Type
|
:
|
BL
|
| Record Number
|
:
|
1050885
|
| Doc. No
|
:
|
bc10440
|
| Language of Document
|
:
|
English
|
| Main Entry
|
:
|
ICVNS (Conference)(8th :2021 :, Abū Ẓaby, United Arab Emirates).
|
| Title & Author
|
:
|
Variable neighborhood search : : 8th international conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21-25, 2021 : proceedings /\ Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar (eds.).
|
| Publication Statement
|
:
|
Cham :: Springer,, [2021]
|
| Series Statement
|
:
|
Lecture notes in computer science ;; 12559
|
|
|
:
|
LNCS sublibrary: SL1 - Theoretical computer science and general issues
|
| Page. NO
|
:
|
1 online resource (202 pages).
|
| ISBN
|
:
|
9783030696252
|
|
|
:
|
: 3030696251
|
|
|
:
|
9783030696245
|
|
|
:
|
3030696243
|
| Notes
|
:
|
International conference proceedings.
|
|
|
:
|
Includes index.
|
|
|
:
|
"Due to the COVID-19 pandemic, the ICVNS 2021 was organized in hybrid (online and offline) mode..."--Preface.
|
| Contents
|
:
|
Intro -- Preface -- Organization -- Contents -- Finding Critical Nodes in Networks Using Variable Neighborhood Search -- 1 Introduction -- 2 Algorithmic Approach -- 2.1 Initial Solution -- 2.2 Shake -- 2.3 Improvement -- 2.4 Neighborhood Change -- 3 Computational Results -- 4 Conclusions -- References -- Variable Neighborhood Descent Branching Applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet -- 1 Introduction -- 2 Problem Statement -- 3 Literature Review -- 4 Variable Neighborhood Descent Branching Framework -- 5 Computational Experiments
|
|
|
:
|
6 Concluding Remarks -- References -- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing -- 1 Introduction -- 2 Problem Definition -- 3 Variable Neighborhood Heuristic -- 4 Experimental Results -- 4.1 Experimental Scenario -- 4.2 Performance Evaluation -- 5 Concluding Remarks -- References -- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability -- 1 Motivation -- 2 Related Work -- 3 Problem and Complexity -- 4 Algorithmic Proposal -- 4.1 General Scheme -- 4.2 Construction Phase -- 4.3 Local Search Phase -- VND
|
|
|
:
|
5 Numerical Results -- 6 Conclusions and Trends for Future Work -- References -- Max-Diversity Orthogonal Regrouping of MBA Students Using a GRASP/VND Heuristic -- 1 Motivation -- 2 Related Work -- 3 Problem -- 3.1 Problem Description -- 3.2 Problem Formulation -- 3.3 Discussion -- 4 Solution -- 4.1 GRASP/VND Methodology for the MDOR -- 4.2 Construction Phase -- 4.3 Insertion -- 4.4 Swap -- 4.5 3-Chain -- 4.6 Shake -- 4.7 Main Algorithm -- 5 Computational Results -- 6 Conclusions and Trends for Future Work -- References -- Scheduling in Parallel Machines with Two Servers: The Restrictive Case
|
|
|
:
|
1 Introduction -- 2 Problem Description -- 2.1 Numerical Example -- 3 Mathematical Formulation of the Restrictive Model -- 4 Variable Neighborhood Search -- 4.1 General Variable Neighborhood Search -- 4.2 Neighborhood Structures -- 4.3 Initial Solution -- 4.4 Evaluation Function -- 5 Computational Results -- 6 Conclusions and Future Work -- References -- Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data -- 1 Introduction and Background -- 2 Problem Formulation -- 3 Optimization Methods -- 3.1 Local Search Algorithm
|
|
|
:
|
3.2 Reduced Variable Neighbourhood Search Heuristic -- 4 Computational Analysis -- 5 Conclusions -- References -- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe -- 1 Introduction -- 2 Scattered-VNS for Nurikabe -- 2.1 Solution Representation -- 2.2 Fitness Function -- 2.3 Initial Solution: Board Construction -- 2.4 Neighborhood Structures -- 2.5 Scattered-VNS -- 3 Parallel Scattered-VNS for Nurikabe -- 4 Experimental Results -- 4.1 Dataset -- 4.2 Parameter Setting -- 4.3 Results -- 5 Conclusion -- References
|
| Abstract
|
:
|
This volume constitutes the proceedings of the 8th International Conference on Variable Neighborhood Search, ICVNS 2021, held in Abu Dhabi, United Arab Emirates, in March 2021. The 14 full papers presented in this volume were carefully reviewed and selected from 27 submissions. The papers describe recent advances in methods and applications of variable neighborhood search. Chapter "Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
|
| Subject
|
:
|
Combinatorial optimization-- Data processing, Congresses.
|
| Subject
|
:
|
Heuristic algorithms, Congresses.
|
| Subject
|
:
|
Combinatorial optimization-- Data processing.
|
| Subject
|
:
|
Heuristic algorithms.
|
| Dewey Classification
|
:
|
519.6/4
|
| LC Classification
|
:
|
QA402.5
|
| Added Entry
|
:
|
Mladenović, Nenad, (Nenad M.)
|
|
|
:
|
Sleptchenko, Andrei
|
|
|
:
|
Sifaleras, Angelo
|
|
|
:
|
Omar, Mohammed
|
| Parallel Title
|
:
|
ICVNS 2021
|