Variable Neighborhood Search: 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings (Theoretical Computer Science and General Issues)

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
A Hybrid VNS for the Multi-product Maritime Inventory Routing Problem
	1 Introduction
	2 Literature Review
	3 Problem Description
	4 Hybrid VNS Approach
		4.1 Mathematical Formulation
	5 Computational Experiments
		5.1 Instances Details
		5.2 General Results
		5.3 Violations Analysis
	6 Conclusions
	References
Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem
	1 Introduction
	2 Railway Arrival and Departure Paths Assignment Problem (ADPA Problem)
	3 The Maximum Independent Set in the ADPA Problem
	4 Extended Simplicial Vertex Test with Interchange Step (ESVTwICS)
		4.1 Computational Results
	5 Conclusion
	References
Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search
	1 Introduction
	2 Problem Definition
	3 Solution Methods
		3.1 General Variable Neighborhood Search
		3.2 Neighborhood Structures
		3.3 Dynamic Version
	4 Computational Experiments
		4.1 Benchmark Instances
		4.2 Computational Results
	5 Concluding Remarks
	References
A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows
	1 Motivation
	2 Related Work
	3 Problem and Complexity
		3.1 Formulation
		3.2 Hardness
	4 Solution
		4.1 Construction Phase
		4.2 Local Search Phase - VND
	5 Numerical Results
	6 Conclusions and Trends for Future Work
	References
Using K-Means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles
	1 Introduction
	2 Related Work
	3 Methods and Data
		3.1 Data
		3.2 Methods
	4 Results
	5 Conclusion
	References
BVNS Approach for the Order Processing in Parallel Picking Workstations
	1 Introduction
	2 Problem Definition
	3 Mathematical Formulation
	4 Heuristic Approaches
		4.1 Constructive Heuristic
		4.2 Basic Variable Neighborhood Search
	5 Computational Results
		5.1 Results on Synthetic Data
		5.2 Results on Realistic Data
	6 Conclusion
	References
Author Index