LEADER 05478nam 22007215 450 001 9910741162503321 005 20230330040921.0 010 $a3-642-37198-1 024 7 $a10.1007/978-3-642-37198-1 035 $a(CKB)3280000000007579 035 $a(DE-He213)978-3-642-37198-1 035 $a(SSID)ssj0000879999 035 $a(PQKBManifestationID)11454614 035 $a(PQKBTitleCode)TC0000879999 035 $a(PQKBWorkID)10853710 035 $a(PQKB)11074729 035 $a(MiAaPQ)EBC3093180 035 $a(PPN)169140067 035 $a(EXLCZ)993280000000007579 100 $a20130305d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEvolutionary Computation in Combinatorial Optimization $e13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings /$fedited by Martin Middendorf, Christian Blum 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 275 p. 57 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7832 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-37197-3 327 $aA Hyper-heuristic with a Round Robin Neighbourhood -- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks -- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory -- A New Crossover for Solving Constraint Satisfaction Problems -- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs -- A Study of Adaptive Perturbation Strategy for Iterated Local Search -- Adaptive MOEA/D for QoS-Based Web Service Composition -- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem -- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem -- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis -- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach -- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem -- Dynamic Evolutionary Membrane Algorithm in Dynamic Environments -- From Sequential to Parallel Local Search for SAT -- Generalizing Hyper-heuristics via Apprenticeship Learning -- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem -- Investigating Monte-Carlo Methods on the Weak Schur Problem -- Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches -- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape -- Single Line Train Scheduling with ACO -- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search -- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent -- The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. 330 $aThis book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are ant colony optimization, evolutionary algorithms, greedy randomized adaptive search procedures, iterated local search, simulated annealing, tabu search, and variable neighborhood search. Applications include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satisfiability, and general mixed integer programming. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7832 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical Analysis 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 14$aNumerical Analysis. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 676 $a006.3823 702 $aMiddendorf$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBlum$b Christian$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910741162503321 996 $aEvolutionary Computation in Combinatorial Optimization$92824693 997 $aUNINA