國立虎尾科技大學 |

Evolutionary Computation in Combinatorial Optimization = 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Evolutionary Computation in Combinatorial Optimization/ edited by Gabriela Ochoa, Francisco Chicano.
Reminder of title:	15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /
other author:	Ochoa, Gabriela.
Description:	XII, 235 p. 41 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Numerical analysis. -
Online resource:	https://doi.org/10.1007/978-3-319-16468-7
ISBN:	9783319164687

Evolutionary Computation in Combinatorial Optimization = 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /
Evolutionary Computation in Combinatorial Optimization15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /[electronic resource] :edited by Gabriela Ochoa, Francisco Chicano. - 1st ed. 2015. - XII, 235 p. 41 illus.online resource. - Theoretical Computer Science and General Issues ;9026. - Theoretical Computer Science and General Issues ;9163.

A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem -- A Computational Comparison of Different Algorithms for Very Large p-median Problems -- A New Solution Representation for the Firefighter Problem -- A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem -- A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands -- An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows -- Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem -- Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization -- Hyper-heuristic Operator Selection and Acceptance Criteria -- Improving the Performance of the Germinal Center Artificial Immune System Using ε-Dominance: A Multi-objective Knapsack Problem -- Mixing Network Extremal Optimization for Community Structure Detection -- Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles -- On the Complexity of Searching the Linear Ordering Problem Neighborhoods -- Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem -- The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity -- The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem -- True Pareto Fronts for Multi-objective AI Planning Instances -- Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn,l -- Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling.

This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.

ISBN: 9783319164687

Standard No.: 10.1007/978-3-319-16468-7doiSubjects--Topical Terms:

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Evolutionary Computation in Combinatorial Optimization = 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /
LDR:04324nam a22004095i 4500 001 969161
003 DE-He213
005 20200704074349.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319164687 $9 978-3-319-16468-7
024 7 $a 10.1007/978-3-319-16468-7 $2 doi
035 $a 978-3-319-16468-7
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 Evolutionary Computation in Combinatorial Optimization $h [electronic resource] : $b 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings / $c edited by Gabriela Ochoa, Francisco Chicano.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XII, 235 p. 41 illus. $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 9026
505 0 $a A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem -- A Computational Comparison of Different Algorithms for Very Large p-median Problems -- A New Solution Representation for the Firefighter Problem -- A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem -- A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands -- An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows -- Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem -- Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization -- Hyper-heuristic Operator Selection and Acceptance Criteria -- Improving the Performance of the Germinal Center Artificial Immune System Using ε-Dominance: A Multi-objective Knapsack Problem -- Mixing Network Extremal Optimization for Community Structure Detection -- Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles -- On the Complexity of Searching the Linear Ordering Problem Neighborhoods -- Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem -- The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity -- The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem -- True Pareto Fronts for Multi-objective AI Planning Instances -- Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn,l -- Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling.
520 $a This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.
650 0 $a Numerical analysis. $3 527939
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Numeric Computing. $3 669943
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Ochoa, Gabriela. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1264757
700 1 $a Chicano, Francisco. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1106615
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319164694
776 0 8 $i Printed edition: $z 9783319164670
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-16468-7
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)