Evolutionary Computation in Combinatorial Optimization 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings / [electronic resource] :
edited by Jens Gottlieb, Günther R. Raidl.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
- X, 240 p. online resource.
- Lecture Notes in Computer Science, 3004 0302-9743 ; .
- Lecture Notes in Computer Science, 3004 .
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 in Partitioning Problems.
9783540246527
10.1007/b96499 doi
Computer science.
Computer software.
Electronic data processing.
Computational complexity.
Combinatorics.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Numeric Computing.
Discrete Mathematics in Computer Science.
Combinatorics.
QA75.5-76.95
004.0151
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 in Partitioning Problems.
9783540246527
10.1007/b96499 doi
Computer science.
Computer software.
Electronic data processing.
Computational complexity.
Combinatorics.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Numeric Computing.
Discrete Mathematics in Computer Science.
Combinatorics.
QA75.5-76.95
004.0151