000 05266nam a22005895i 4500
001 978-3-642-37198-1
003 DE-He213
005 20240730182121.0
007 cr nn 008mamaa
008 130305s2013 gw | s |||| 0|eng d
020 _a9783642371981
_9978-3-642-37198-1
024 7 _a10.1007/978-3-642-37198-1
_2doi
050 4 _aQA297-299.4
072 7 _aPBKS
_2bicssc
072 7 _aMAT041000
_2bisacsh
072 7 _aPBKS
_2thema
082 0 4 _a518
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings /
_cedited by Martin Middendorf, Christian Blum.
250 _a1st ed. 2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 275 p. 57 illus.
_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,
_x2512-2029 ;
_v7832
505 0 _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.
520 _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.
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 1 4 _aNumerical Analysis.
_94603
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aTheory of Computation.
_9127256
700 1 _aMiddendorf, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127257
700 1 _aBlum, Christian.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127258
710 2 _aSpringerLink (Online service)
_9127259
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642371974
776 0 8 _iPrinted edition:
_z9783642371998
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7832
_9127260
856 4 0 _uhttps://doi.org/10.1007/978-3-642-37198-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91231
_d91231