Recent Advances in Evolutionary Computation for Combinatorial Optimization
Autor Corporativo: | |
---|---|
Otros Autores: | , |
Formato: | eBook |
Lenguaje: | English |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2008.
|
Edición: | 1st ed. 2008. |
Colección: | Studies in Computational Intelligence,
153 |
Materias: | |
Acceso en línea: | https://doi.org/10.1007/978-3-540-70807-0 |
Tabla de Contenidos:
- Theory and Methodology
- An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups
- Determining Whether a Problem Characteristic Affects Heuristic Performance
- Performance and Scalability of Genetic Algorithms on NK-Landscapes
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- Hybrid Approaches
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
- A Hybrid Optimization Framework for Cutting and Packing Problems
- A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem
- A Memetic-Neural Approach to Discover Resources in P2P Networks
- Constrained Problems
- An Iterative Heuristic Algorithm for Tree Decomposition
- Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM
- Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem
- Scheduling
- Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags
- A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
- Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids
- Routing and Travelling Salesman Problems
- Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
- Algorithms for Large Directed Capacitated Arc Routing Problem Instances
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem.