LEADER 05572nam 22008175 450 001 996466022803316 005 20230330005419.0 010 $a3-319-30698-7 024 7 $a10.1007/978-3-319-30698-8 035 $a(CKB)3710000000627348 035 $a(SSID)ssj0001658186 035 $a(PQKBManifestationID)16438043 035 $a(PQKBTitleCode)TC0001658186 035 $a(PQKBWorkID)14986409 035 $a(PQKB)10608197 035 $a(DE-He213)978-3-319-30698-8 035 $a(MiAaPQ)EBC6303157 035 $a(MiAaPQ)EBC5596176 035 $a(Au-PeEL)EBL5596176 035 $a(OCoLC)1076257099 035 $a(PPN)192771795 035 $a(EXLCZ)993710000000627348 100 $a20160330d2016 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aEvolutionary Computation in Combinatorial Optimization$b[electronic resource] $e16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings /$fedited by Francisco Chicano, Bin Hu, Pablo García-Sánchez 205 $a1st ed. 2016. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016. 215 $a1 online resource (XII, 267 p. 59 illus., 1 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9595 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-30697-9 327 $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. . 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9595 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aArtificial intelligence 606 $aNumerical Analysis 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aArtificial Intelligence 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aArtificial intelligence. 615 14$aNumerical Analysis. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aArtificial Intelligence. 676 $a519.64 702 $aChicano$b Francisco$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHu$b Bin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGarcía-Sánchez$b Pablo$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466022803316 996 $aEvolutionary Computation in Combinatorial Optimization$92824693 997 $aUNISA