Variable Neighborhood Search : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21-25, 2021, Proceedings (Lecture Notes in Computer Science)

個数：

Variable Neighborhood Search : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21-25, 2021, Proceedings (Lecture Notes in Computer Science)

  • オンデマンド(OD/POD)版です。キャンセルは承れません。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版／ページ数 191 p.
  • 言語 ENG
  • 商品コード 9783030696245
  • DDC分類 519.64

Full Description

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.

Contents

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 .