國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Evolutionary computation in combinat...

(1998 :)

Evolutionary computation in combinatorial optimization16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Evolutionary computation in combinatorial optimizationedited by Francisco Chicano, Bin Hu, Pablo Garcia-Sanchez.
其他題名:	16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings /
其他題名:	EvoCOP 2016
其他作者:	Chicano, Francisco.
團體作者:
出版者:	Cham :Springer International Publishing :2016.
面頁冊數:	xii, 267 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Evolutionary computationCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-30698-8
ISBN:	9783319306988$q(electronic bk.)

Evolutionary computation in combinatorial optimization16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings /
Evolutionary computation in combinatorial optimization16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings /[electronic resource] :EvoCOP 2016edited by Francisco Chicano, Bin Hu, Pablo Garcia-Sanchez. - Cham :Springer International Publishing :2016. - xii, 267 p. :ill., digital ;24 cm. - Lecture notes in computer science,95950302-9743 ;. - Lecture notes in computer science ;4891..

A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery -- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations -- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem -- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem -- Deconstructing the Big Valley Search Space Hypothesis -- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks -- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization -- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems -- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance -- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems -- Hyperplane Elimination for Quickly Enumerating Local Optima -- Limits to Learning in Reinforcement Learning Hyperheuristics -- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs -- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition -- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation -- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity -- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization.

This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 17 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.

ISBN: 9783319306988$q(electronic bk.)

Standard No.: 10.1007/978-3-319-30698-8doiSubjects--Topical Terms:

438415
Evolutionary computation
--Congresses.

LC Class. No.: QA76.618

Dewey Class. No.: 005.1

Evolutionary computation in combinatorial optimization16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings /
LDR:03846nmm a2200337 a 4500 001 483829
003 DE-He213
005 20160912133916.0
006 m d
007 cr nn 008maaau
008 161012s2016 gw s 0 eng d
020 $a 9783319306988$q(electronic bk.)
020 $a 9783319306971$q(paper)
024 7 $a 10.1007/978-3-319-30698-8 $2 doi
035 $a 978-3-319-30698-8
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 2016
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Evolutionary computation in combinatorial optimization $h [electronic resource] : $b 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016 : proceedings / $c edited by Francisco Chicano, Bin Hu, Pablo Garcia-Sanchez.
246 3 $a EvoCOP 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xii, 267 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9595
505 0 $a A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery -- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations -- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem -- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem -- Deconstructing the Big Valley Search Space Hypothesis -- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks -- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization -- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems -- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance -- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems -- Hyperplane Elimination for Quickly Enumerating Local Optima -- Limits to Learning in Reinforcement Learning Hyperheuristics -- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs -- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition -- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation -- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity -- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization.
520 $a This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 17 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.
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 Chicano, Francisco. $3 715579
700 1 $a Hu, Bin. $3 524394
700 1 $a Garcia-Sanchez, Pablo. $3 741769
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-30698-8
950 $a Computer Science (Springer-11645)