Evolutionary Computation in Combinatorial Optimization 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings /
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2007.
|
Edición: | 1st ed. 2007. |
Colección: | Theoretical Computer Science and General Issues,
4446 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.