國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Evolutionary computation in combinat...

(1998 :)

Evolutionary computation in combinatorial optimization15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Evolutionary computation in combinatorial optimizationedited by Gabriela Ochoa, Francisco Chicano.
其他題名:	15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015 : proceedings /
其他題名:	EvoCOP 2015
其他作者:	Ochoa, Gabriela.
團體作者:
出版者:	Cham :Springer International Publishing :2015.
面頁冊數:	xii, 235 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Evolutionary computationCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-16468-7
ISBN:	9783319164687 (electronic bk.)

Evolutionary computation in combinatorial optimization15th 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] :EvoCOP 2015edited by Gabriela Ochoa, Francisco Chicano. - Cham :Springer International Publishing :2015. - xii, 235 p. :ill., digital ;24 cm. - Lecture notes in computer science,90260302-9743 ;. - Lecture notes in computer science ;4891..

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 [epsilon]-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 (electronic bk.)

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

438415
Evolutionary computation
--Congresses.

LC Class. No.: QA76.618

Dewey Class. No.: 005.1

Evolutionary computation in combinatorial optimization15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015 : proceedings /
LDR:03982nmm a2200337 a 4500 001 462557
003 DE-He213
005 20151023093315.0
006 m d
007 cr nn 008maaau
008 151119s2015 gw s 0 eng d
020 $a 9783319164687 (electronic bk.)
020 $a 9783319164670 (paper)
024 7 $a 10.1007/978-3-319-16468-7 $2 doi
035 $a 978-3-319-16468-7
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 2015
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a EvoCOP 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xii, 235 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 [epsilon]-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 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 Ochoa, Gabriela. $3 696469
700 1 $a Chicano, Francisco. $3 715579
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-16468-7
950 $a Computer Science (Springer-11645)