Recent advances in evolutionary computation for combinatorial optimization
Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use of metahe...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | Livre numérique |
| Language: | Anglais |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edition: | 1st ed. 2008. |
| Series: | Studies in Computational Intelligence
153 |
| Online Access: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Recent Advances in Evolutionary Computation for Combinatorial Optimization, Carlos Cotta, Jano van Hemert (Eds.), Berlin, Springer, 2008, Studies in Computational Intelligence, 978-3-540-70806-3 |
Table of Contents:
- 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