This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, ant colony optimization, and particle swarm optimization algorithms.
This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, ant colony optimization, and particle swarm optimization algorithms.
Produktdetails
Produktdetails
Theoretical Computer Science and General Issues 4446
Die Herstellerinformationen sind derzeit nicht verfügbar.
Autorenporträt
Carlos Cotta, Universidad de Málaga, Spain / Jano van Hemert, University of Edinburgh, UK
Inhaltsangabe
A New Local Search Algorithm for the DNA Fragment Assembly Problem.- A Hybrid Immune-Based System for the Protein Folding Problem.- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags.- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.- Genetic Algorithms for Word Problems in Partially Commutative Groups.- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling.- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.- Iterated k-Opt Local Search for the Maximum Clique Problem.- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem.- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks.- A New Metaheuristic for the Vehicle Routing Problem with Split Demands.- Generation of Tree Decompositions by Iterated Local Search.- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms.- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem.- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling.- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics.- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem.- A Hybrid Method for Solving Large-Scale Supply Chain Problems.- Crossover Operators for the Car Sequencing Problem.
A New Local Search Algorithm for the DNA Fragment Assembly Problem.- A Hybrid Immune-Based System for the Protein Folding Problem.- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags.- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.- Genetic Algorithms for Word Problems in Partially Commutative Groups.- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling.- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.- Iterated k-Opt Local Search for the Maximum Clique Problem.- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem.- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks.- A New Metaheuristic for the Vehicle Routing Problem with Split Demands.- Generation of Tree Decompositions by Iterated Local Search.- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms.- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem.- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling.- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics.- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem.- A Hybrid Method for Solving Large-Scale Supply Chain Problems.- Crossover Operators for the Car Sequencing Problem.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
