Hybrid Metaheuristics 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings / [electronic resource] :
edited by Thomas Bartz-Beielstein, María José Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
- X, 201 p. online resource.
- Lecture Notes in Computer Science, 4771 0302-9743 ; .
- Lecture Notes in Computer Science, 4771 .
Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
9783540755142
10.1007/978-3-540-75514-2 doi
Computer science.
Computer software.
Electronic data processing.
Artificial intelligence.
Optical pattern recognition.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Artificial Intelligence (incl. Robotics).
Numeric Computing.
Pattern Recognition.
QA76.9.A43
005.1
Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
9783540755142
10.1007/978-3-540-75514-2 doi
Computer science.
Computer software.
Electronic data processing.
Artificial intelligence.
Optical pattern recognition.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Artificial Intelligence (incl. Robotics).
Numeric Computing.
Pattern Recognition.
QA76.9.A43
005.1