Skip to main content
SpringerLink
Log in

Variable Neighborhood Search

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

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Nenad Mladenovic

    1. Khalifa University, Abu Dhabi, United Arab Emirates

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrei Sleptchenko

    1. Khalifa University, Abu Dhabi, United Arab Emirates

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Angelo Sifaleras

    1. University of Macedonia, Thessaloniki, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Mohammed Omar

    1. Khalifa University, Abu Dhabi, United Arab Emirates

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12559)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICVNS 2021.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 papers)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Finding Critical Nodes in Networks Using Variable Neighborhood Search

    • Iván Martín de San Lázaro, Jesús Sánchez-Oro, Abraham Duarte
    Pages 1-13

  3. Variable Neighborhood Descent Branching Applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet

    • Thiago M. Stehling, Marcone J. Freitas Souza, Sérgio R. de Souza
    Pages 14-27

  4. A Variable Neighborhood Heuristic for Facility Locations in Fog Computing

    • Thiago Alves de Queiroz, Claudia Canali, Manuel Iori, Riccardo Lancellotti
    Pages 28-42

  5. A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability

    • Sebastián Laborde, Franco Robledo, Pablo Romero, Omar Viera
    Pages 43-57

  6. Max-Diversity Orthogonal Regrouping of MBA Students Using a GRASP/VND Heuristic

    • Matías Banchero, Franco Robledo, Pablo Romero, Pablo Sartor, Camilo Servetti
    Pages 58-70

  7. Scheduling in Parallel Machines with Two Servers: The Restrictive Case

    • Rachid Benmansour, Angelo Sifaleras
    Pages 71-82

  8. Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data

    • Sergio Consoli, Domenico Perrotta, Marco Turchi
    Pages 83-98Open Access

  9. Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe

    • Paul Bass, Aise Zulal Sevkli
    Pages 99-110

  10. A Hybrid VNS for the Multi-product Maritime Inventory Routing Problem

    • Nathalie Sanghikian, Rafael Martinelli, Victor Abu-Marrul
    Pages 111-122

  11. Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem

    • Damir Gainanov, Nenad Mladenović, Varvara Rasskazova
    Pages 123-137

  12. Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search

    • Thiago Alves de Queiroz, Manuel Iori, Arthur Kramer, Yong-Hong Kuo
    Pages 138-151

  13. A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows

    • Lucía Barrero, Franco Robledo, Pablo Romero, Rodrigo Viera
    Pages 152-165

  14. Using K-Means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles

    • I. Akhmetov, N. Mladenovic, R. Mussabayev
    Pages 166-175

  15. BVNS Approach for the Order Processing in Parallel Picking Workstations

    • Abdessamad Ouzidan, Eduardo G. Pardo, Marc Sevaux, Alexandru-Liviu Olteanu, Abraham Duarte
    Pages 176-190

  16. Back Matter

    Pages 191-191
    Download chapter PDF
Back to top

Other volumes

  1. Variable Neighborhood Search

Keywords

About this book

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.


Editors and Affiliations

  • Khalifa University, Abu Dhabi, United Arab Emirates

    Nenad Mladenovic, Andrei Sleptchenko, Mohammed Omar

  • University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

Bibliographic Information

  • Book Title: Variable Neighborhood Search

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

  • Editors: Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-030-69625-2

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer Nature Switzerland AG 2021

  • Softcover ISBN: 978-3-030-69624-5Published: 18 February 2021

  • eBook ISBN: 978-3-030-69625-2Published: 15 March 2021

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 191

  • Number of Illustrations: 40 b/w illustrations, 26 illustrations in colour

  • Topics: Mathematics of Computing, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation