Variable Neighborhood Search

8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings

AvNenad Mladenovic,Andrei Sleptchenko

Häftad, Engelska, 2021

Del 12559 i serien Lecture Notes in Computer Science

644 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2021-02-18
Mått:155 x 235 x 12 mm
Vikt:318 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:191
Förlag:Springer Nature Switzerland AG
ISBN:9783030696245

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach.- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet.- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing.- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability.- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic.- Scheduling in parallel machines with two servers: the restrictive case.- Reduced Variable Neighbourhood Search for the generation of controlled circular data.- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe.- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem.- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem.- Scheduling of Patients in Emergency Departments with a Variable NeighborhoodSearch.- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows.- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles.- BVNS approach for the Order Processing in Parallel Picking Workstations .