Evolutionary Computation in Combinatorial Optimization 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings / [electronic resource] :
edited by Jano van Hemert, Carlos Cotta.
- 1st ed. 2008.
- XII, 292 p. online resource.
- Theoretical Computer Science and General Issues, 4972 2512-2029 ; .
- Theoretical Computer Science and General Issues, 4972 .
Adaptive Tabu Tenure Computation in Local Search -- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems -- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem -- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem -- Efficient Local Search Limitation Strategies for Vehicle Routing Problems -- Evolutionary Local Search for the Minimum Energy Broadcast Problem -- Exploring Multi-objective PSO and GRASP-PR for Rule Induction -- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem -- Graph Colouring Heuristics Guided by Higher Order Graph Properties -- A Hybrid Column Generation Approach for the Berth Allocation Problem -- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem -- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit -- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem -- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem -- Improving Metaheuristic Performance by Evolving a Variable Fitness Function -- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach -- Inc*: An Incremental Approach for Improving Local Search Heuristics -- Metaheuristics for the Bi-objective Ring Star Problem -- Multiobjective Prototype Optimization with Evolved Improvement Steps -- Optimising Multiple Kernels for SVM by Genetic Programming -- Optimization of Menu Layouts by Means of Genetic Algorithms -- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows -- Reactive Stochastic LocalSearch Algorithms for the Genomic Median Problem -- Solving Graph Coloring Problems Using Learning Automata.
9783540786047
10.1007/978-3-540-78604-7 doi
Computer science.
Algorithms.
Numerical analysis.
Computer science--Mathematics.
Discrete mathematics.
Theory of Computation.
Algorithms.
Numerical Analysis.
Discrete Mathematics in Computer Science.
QA75.5-76.95
004.0151
Adaptive Tabu Tenure Computation in Local Search -- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems -- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem -- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem -- Efficient Local Search Limitation Strategies for Vehicle Routing Problems -- Evolutionary Local Search for the Minimum Energy Broadcast Problem -- Exploring Multi-objective PSO and GRASP-PR for Rule Induction -- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem -- Graph Colouring Heuristics Guided by Higher Order Graph Properties -- A Hybrid Column Generation Approach for the Berth Allocation Problem -- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem -- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit -- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem -- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem -- Improving Metaheuristic Performance by Evolving a Variable Fitness Function -- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach -- Inc*: An Incremental Approach for Improving Local Search Heuristics -- Metaheuristics for the Bi-objective Ring Star Problem -- Multiobjective Prototype Optimization with Evolved Improvement Steps -- Optimising Multiple Kernels for SVM by Genetic Programming -- Optimization of Menu Layouts by Means of Genetic Algorithms -- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows -- Reactive Stochastic LocalSearch Algorithms for the Genomic Median Problem -- Solving Graph Coloring Problems Using Learning Automata.
9783540786047
10.1007/978-3-540-78604-7 doi
Computer science.
Algorithms.
Numerical analysis.
Computer science--Mathematics.
Discrete mathematics.
Theory of Computation.
Algorithms.
Numerical Analysis.
Discrete Mathematics in Computer Science.
QA75.5-76.95
004.0151