Evolutionary Computation in Combinatorial Optimization : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings / edited by Martin Middendorf, Christian Blum.
- Format:
-
- Contributor:
-
- Series:
-
- Language:
- English
- Subjects (All):
-
- Local Subjects:
-
- Physical Description:
- 1 online resource (XII, 275 pages) : 57 illustrations.
- Edition:
- First edition 2013.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
- System Details:
- text file PDF
- Summary:
- This 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.
- Contents:
-
- A 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.
- Other Format:
- Printed edition:
- ISBN:
-
- 978-3-642-37198-1
- 9783642371981
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.