國立高雄大學圖資館 |

Language: English

Back

Evolutionary computation in combinat...

(1998 :)

Evolutionary computation in combinatorial optimization17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Evolutionary computation in combinatorial optimizationedited by Bin Hu, Manuel Lopez-Ibanez.
Reminder of title:	17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings /
remainder title:	EvoCOP 2017
other author:	Hu, Bin.
corporate name:
Published:	Cham :Springer International Publishing :2017.
Description:	xii, 249 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Evolutionary computationCongresses.
Online resource:	http://dx.doi.org/10.1007/978-3-319-55453-2
ISBN:	9783319554532$q(electronic bk.)

Evolutionary computation in combinatorial optimization17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings /
Evolutionary computation in combinatorial optimization17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings /[electronic resource] :EvoCOP 2017edited by Bin Hu, Manuel Lopez-Ibanez. - Cham :Springer International Publishing :2017. - xii, 249 p. :ill., digital ;24 cm. - Lecture notes in computer science,101970302-9743 ;. - Lecture notes in computer science ;4891..

A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic.

This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.

ISBN: 9783319554532$q(electronic bk.)

Standard No.: 10.1007/978-3-319-55453-2doiSubjects--Topical Terms:

438415
Evolutionary computation
--Congresses.

LC Class. No.: QA76.618

Dewey Class. No.: 005.1

Evolutionary computation in combinatorial optimization17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings /
LDR:03668nmm a2200337 a 4500 001 508916
003 DE-He213
005 20170308142538.0
006 m d
007 cr nn 008maaau
008 171121s2017 gw s 0 eng d
020 $a 9783319554532$q(electronic bk.)
020 $a 9783319554525$q(paper)
024 7 $a 10.1007/978-3-319-55453-2 $2 doi
035 $a 978-3-319-55453-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.618
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.618 $b .E93 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Evolutionary computation in combinatorial optimization $h [electronic resource] : $b 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017 : proceedings / $c edited by Bin Hu, Manuel Lopez-Ibanez.
246 3 $a EvoCOP 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xii, 249 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10197
505 0 $a A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic.
520 $a This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.
650 0 $a Evolutionary computation $v Congresses. $3 438415
650 0 $a Combinatorial optimization $x Data processing $v Congresses. $3 444489
650 0 $a Evolutionary programming (Computer science) $3 185150
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computation by Abstract Devices. $3 273703
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
700 1 $a Hu, Bin. $3 524394
700 1 $a Lopez-Ibanez, Manuel. $3 775348
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-55453-2
950 $a Computer Science (Springer-11645)