國立虎尾科技大學 |

Evolutionary Computation in Combinatorial Optimization = 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Evolutionary Computation in Combinatorial Optimization/ edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez.
Reminder of title:	16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /
other author:	Chicano, Francisco.
Description:	XII, 267 p. 59 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Numerical analysis. -
Online resource:	https://doi.org/10.1007/978-3-319-30698-8
ISBN:	9783319306988

Evolutionary Computation in Combinatorial Optimization = 16th 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] :edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez. - 1st ed. 2016. - XII, 267 p. 59 illus., 1 illus. in color.online resource. - Theoretical Computer Science and General Issues ;9595. - Theoretical Computer Science and General Issues ;9163.

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

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

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Evolutionary Computation in Combinatorial Optimization = 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /
LDR:04217nam a22004095i 4500 001 975185
003 DE-He213
005 20200701013210.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319306988 $9 978-3-319-30698-8
024 7 $a 10.1007/978-3-319-30698-8 $2 doi
035 $a 978-3-319-30698-8
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 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings / $c edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XII, 267 p. 59 illus., 1 illus. in color. $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 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 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 Chicano, Francisco. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1106615
700 1 $a Hu, Bin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 796196
700 1 $a García-Sánchez, Pablo. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258291
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319306971
776 0 8 $i Printed edition: $z 9783319306995
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-30698-8
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)