Evolutionary computation in combinatorial optimization : 4th european conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004 : proceedings
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
3004 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Evolutionary computation in combinatorial optimization, 4th european conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, proceedings, Jens Gottlieb, Günther R. Raidl (Eds.), Berlin, Springer, 2004, 1 vol. (X-240 p.), Lecture notes in computer science, 3-540-21367-8 • Evolutionary Computation in Combinatorial Optimization, Texte imprimé, 9783662172339 |
Sommario:
- EvoCOP Contributions
- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm
- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem
- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
- AntPacking An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem
- Scatter Search and Memetic Approaches to the Error Correcting Code Problem
- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem
- Parallel Ant Systems for the Capacitated Vehicle Routing Problem
- A Hierarchical Social Metaheuristic for the Max-Cut Problem
- On the Structure of Sequential Search: Beyond No Free Lunch
- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support A Case Study
- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
- Binary Merge Model Representation of the Graph Colouring Problem
- Hardness Prediction for the University Course Timetabling Problem
- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem
- On the Use of Path Relinking for the ? Hub Median Problem
- Solving a Real-World Glass Cutting Problem
- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic
- Improving Vehicle Routing Using a Customer Waiting Time Colony
- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
- Improving Edge Recombination through Alternate Inheritance and Greedy Manner
- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm
- On Search Space Symmetry inPartitioning Problems.