000 05554nam a22006255i 4500
001 978-3-319-30698-8
003 DE-He213
005 20210120143324.0
007 cr nn 008mamaa
008 160330s2016 gw | s |||| 0|eng d
020 _a9783319306988
_9978-3-319-30698-8
024 7 _a10.1007/978-3-319-30698-8
_2doi
050 4 _aQA297-299.4
072 7 _aUYA
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a518
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /
_cedited by Francisco Chicano, Bin Hu, Pablo García-Sánchez.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXII, 267 p. 59 illus., 1 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v9595
_aLecture Notes in Computer Science
_v9595
505 0 _aA 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 _aThis 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 _aNumerical analysis.
650 0 _aAlgorithms.
650 0 _aComputer science—Mathematics.
650 0 _aComputers.
650 0 _aArtificial intelligence.
650 1 4 _aNumeric Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 2 4 _aDiscrete Mathematics in Computer Science.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17028
650 2 4 _aComputation by Abstract Devices.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16013
650 2 4 _aArtificial Intelligence.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I21000
700 1 _aChicano, Francisco.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHu, Bin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGarcía-Sánchez, Pablo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319306971
776 0 8 _iPrinted edition:
_z9783319306995
830 0 _aTheoretical Computer Science and General Issues ;
_v9595
830 0 _aLecture Notes in Computer Science ;
_v9595
856 4 0 _uhttps://doi.org/10.1007/978-3-319-30698-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57425
_d57425