國立虎尾科技大學 |

Variable Neighborhood Search = 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Variable Neighborhood Search/ edited by Angelo Sifaleras, Said Salhi, Jack Brimberg.
Reminder of title:	6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers /
other author:	Sifaleras, Angelo.
Description:	XI, 315 p. 93 illus., 26 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Numerical analysis. -
Online resource:	https://doi.org/10.1007/978-3-030-15843-9
ISBN:	9783030158439

Variable Neighborhood Search = 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers /
Variable Neighborhood Search6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers /[electronic resource] :edited by Angelo Sifaleras, Said Salhi, Jack Brimberg. - 1st ed. 2019. - XI, 315 p. 93 illus., 26 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11328. - Theoretical Computer Science and General Issues ;9163.

Improved variable neighbourhood search heuristic for quartet clustering -- On the k-medoids model for semi-supervised clustering -- Complexity and Heuristics for the Max Cut-Clique Problem -- A VNS approach to solve multi-level capacitated lotsizing problem with backlogging -- How to locate disperse obnoxious facility centers? -- Basic VNS algorithms for solving the pollution location inventory routing problem -- Less is More: The Neighborhood Guided Evolution Strategies convergence on some classic neighborhood operators -- New VNS variants for the Online Order Batching Problem -- An adaptive VNS and Skewed GVNS approaches for School Timetabling Problems -- Finding balanced bicliques in bipartite graphs using Variable Neighborhood Search -- General Variable Neighborhood Search for Scheduling Heterogeneous Vehicles in Agriculture -- Detecting weak points in networks using Variable Neighborhood Search -- A Variable neighborhood search with integer programming for the zero-one Multiple-Choice Knapsack Problem with Setup -- A VNS-based Algorithm with Adaptive Local Search for Solving the Multi-Depot Vehicle Routing Problem -- Skewed Variable Neighborhood Search Method for the Weighted Generalized Regenerator Location Problem -- Using a variable neighborhood search to solve the single processor scheduling problem with time restrictions -- An Evolutionary Variable Neighborhood Descent for addressing an electric VRP variant -- A Variable Neighborhood Descent heuristic for the multi-quay Berth Allocation and Crane Assignment Problem under availability constraints -- A Variable Neighborhood Search approach for solving the Multidimensional Multi-way Number Partitioning Problem -- A general variable neighborhood search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem -- A Hybrid Firefly - VNS Algorithm for the Permutation Flowshop Scheduling Problem -- Studying the impact of perturbation methods on the efficiency of GVNS for the ATSP -- A general variable neighborhood search algorithm to solve vehicle routing problems with optional visits.

This book constitutes the refereed post-conference proceedings of the 6th International Conference on Variable Neighborhood Search, ICVNS 2018, held in Sithonia, Greece, in October 2018. ICVNS 2018 received 49 submissions of which 23 full papers were carefully reviewed and selected. VNS is a metaheuristic based on systematic changes in the neighborhood structure within a search for solving optimization problems and related tasks. The main goal of ICVNS 2018 was to provide a stimulating environment in which researchers coming from various scientific fields could share and discuss their knowledge, expertise, and ideas related to the VNS metaheuristic and its applications.

ISBN: 9783030158439

Standard No.: 10.1007/978-3-030-15843-9doiSubjects--Topical Terms:

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Variable Neighborhood Search = 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers /
LDR:04269nam a22004095i 4500 001 1008594
003 DE-He213
005 20200702215853.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030158439 $9 978-3-030-15843-9
024 7 $a 10.1007/978-3-030-15843-9 $2 doi
035 $a 978-3-030-15843-9
050 4 $a QA297-299.4
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Variable Neighborhood Search $h [electronic resource] : $b 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers / $c edited by Angelo Sifaleras, Said Salhi, Jack Brimberg.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 315 p. 93 illus., 26 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11328
505 0 $a Improved variable neighbourhood search heuristic for quartet clustering -- On the k-medoids model for semi-supervised clustering -- Complexity and Heuristics for the Max Cut-Clique Problem -- A VNS approach to solve multi-level capacitated lotsizing problem with backlogging -- How to locate disperse obnoxious facility centers? -- Basic VNS algorithms for solving the pollution location inventory routing problem -- Less is More: The Neighborhood Guided Evolution Strategies convergence on some classic neighborhood operators -- New VNS variants for the Online Order Batching Problem -- An adaptive VNS and Skewed GVNS approaches for School Timetabling Problems -- Finding balanced bicliques in bipartite graphs using Variable Neighborhood Search -- General Variable Neighborhood Search for Scheduling Heterogeneous Vehicles in Agriculture -- Detecting weak points in networks using Variable Neighborhood Search -- A Variable neighborhood search with integer programming for the zero-one Multiple-Choice Knapsack Problem with Setup -- A VNS-based Algorithm with Adaptive Local Search for Solving the Multi-Depot Vehicle Routing Problem -- Skewed Variable Neighborhood Search Method for the Weighted Generalized Regenerator Location Problem -- Using a variable neighborhood search to solve the single processor scheduling problem with time restrictions -- An Evolutionary Variable Neighborhood Descent for addressing an electric VRP variant -- A Variable Neighborhood Descent heuristic for the multi-quay Berth Allocation and Crane Assignment Problem under availability constraints -- A Variable Neighborhood Search approach for solving the Multidimensional Multi-way Number Partitioning Problem -- A general variable neighborhood search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem -- A Hybrid Firefly - VNS Algorithm for the Permutation Flowshop Scheduling Problem -- Studying the impact of perturbation methods on the efficiency of GVNS for the ATSP -- A general variable neighborhood search algorithm to solve vehicle routing problems with optional visits.
520 $a This book constitutes the refereed post-conference proceedings of the 6th International Conference on Variable Neighborhood Search, ICVNS 2018, held in Sithonia, Greece, in October 2018. ICVNS 2018 received 49 submissions of which 23 full papers were carefully reviewed and selected. VNS is a metaheuristic based on systematic changes in the neighborhood structure within a search for solving optimization problems and related tasks. The main goal of ICVNS 2018 was to provide a stimulating environment in which researchers coming from various scientific fields could share and discuss their knowledge, expertise, and ideas related to the VNS metaheuristic and its applications.
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Mathematical optimization. $3 527675
650 1 4 $a Numeric Computing. $3 669943
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Optimization. $3 669174
700 1 $a Sifaleras, Angelo. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1302435
700 1 $a Salhi, Said. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1251094
700 1 $a Brimberg, Jack. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1302436
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030158422
776 0 8 $i Printed edition: $z 9783030158446
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-15843-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)