東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Variable neighborhood search = 6th I...

International Conference on Variable Neighborhood Search (2018 :)

Linked to FindBook

Google Book

Amazon

博客來

Variable neighborhood search = 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4-7, 2018 : revised selected papers /

Record Type:	Electronic resources : 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 /
remainder title:	ICVNS 2018
other author:	Sifaleras, Angelo.
corporate name:	International Conference on Variable Neighborhood Search
Published:	Cham :Springer International Publishing : : 2019.,
Description:	xi, 315 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Traveling salesman problem - Congresses. -
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] :ICVNS 2018edited by Angelo Sifaleras, Said Salhi, Jack Brimberg. - Cham :Springer International Publishing :2019. - xi, 315 p. :ill., digital ;24 cm. - Lecture notes in computer science,113280302-9743 ;. - Lecture notes in computer science ;11328..

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:

3386310
Traveling salesman problem
--Congresses.

LC Class. No.: QA402.5

Dewey Class. No.: 511.5

Variable neighborhood search = 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4-7, 2018 : revised selected papers /
LDR:03984nmm a2200361 a 4500 001 2180345
003 DE-He213
005 20190313124120.0
006 m d
007 cr nn 008maaau
008 191122s2019 gw s 0 eng d
020 $a 9783030158439 $q (electronic bk.)
020 $a 9783030158422 $q (paper)
024 7 $a 10.1007/978-3-030-15843-9 $2 doi
035 $a 978-3-030-15843-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA402.5 $b .I61 2018
111 2 $a International Conference on Variable Neighborhood Search $n (6th : $d 2018 : $c Sithonia, Greece) $3 3386307
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.
246 3 $a ICVNS 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xi, 315 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11328
490 1 $a Theoretical computer science and general issues
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 Traveling salesman problem $v Congresses. $3 3386310
650 1 4 $a Numeric Computing. $3 892606
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Optimization. $3 891104
700 1 $a Sifaleras, Angelo. $3 3379878
700 1 $a Salhi, Said. $3 3221210
700 1 $a Brimberg, Jack. $3 3386308
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 11328. $3 3386309
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-15843-9
950 $a Computer Science (Springer-11645)