|
" Essays and Surveys in Metaheuristics "
by Celso C. Ribeiro, Pierre Hansen.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
731891
|
| Doc. No
|
:
|
b551677
|
| Main Entry
|
:
|
by Celso C. Ribeiro, Pierre Hansen.
|
| Title & Author
|
:
|
Essays and Surveys in Metaheuristics\ by Celso C. Ribeiro, Pierre Hansen.
|
| Publication Statement
|
:
|
Boston, MA: Springer US, 2002
|
| Series Statement
|
:
|
Operations Research/Computer Science Interfaces Series, 15
|
| Page. NO
|
:
|
1(XI, 651 Seiten)
|
| ISBN
|
:
|
1461355885
|
|
|
:
|
: 1461515076
|
|
|
:
|
: 9781461355885
|
|
|
:
|
: 9781461515074
|
| Contents
|
:
|
Preface. 1. Selected Topics in Simulated Annealing; E. Aarts, J. Korst. 2. Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs; M.P. Bastos, C.C. Ribeiro. 3. A GRASP for Job Shop Scheduling; S. Binato, et al. 4. A Reactive GRASP for Transmission Network Expansion Planning; S. Binato, G.C. Oliveira. 5. Tabu Search for Two-Dimensional Irregular Cutting; J. Blazewicz, et al. 6. A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem; P.C. Borgers, M.P. Hansen. 7. A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem; J. Brandao. 8. A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks; A. Candia, H. Bravo. 9. A GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls; C. Carreto, B. Baker. 10. Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem; C.C.B. Cavalcante, et al. 11. A Scatter Search Algorithm for the Maximum Clique Problem; L. Cavique, et al. 12. The Noising Methods: A Survey; I. Charon, O. Hudry. 13. Strategies for the Parallel Implementation of Metaheuristics; V.-D. Cung, et al. 14. Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems; G. Desaulniers, et al. 15. GRASP: An Annotated Bibliography; P. Festa, M.G.C. Resende. 16. Recent Advances in Tabu Search; M. Gendreau. 17. Lagrangean Tabu Search; T. Grunert. 18. A GIDS Metaheuristic Approach to the Fleet Size and Mix Vehicle RoutingProblem; A.F.-W. Han, Y.-J. Cho. 19. Developments of Variable Neighborhood Search; P. Hansen, N. Mladenovi . 20. Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms; S.H. Jacobson. 21. Ant Colony Optimization: An Overview; V. Maniezzo, A. Carbonaro. 22. Intensification Neighborhoods for Local Search Methods; T. Mautor. 23. New Heuristics for the Euclidean Steiner Problem in Rn; F. Montenegro, et al. 24. Mathematical Analysis of Evolutionary Algorithms; H. Muhlenbein, Th. Mahnig. 25. Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem; K. Nonobe, T. Ibaraki. 26. Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem; T. Stutzle, H.H. Hoos. 27. POPMUSIC Partial Optimization Metaheuristic under Special Intensification Conditions; E.D. Taillard, S. Voss. 28. Subcost-Guided Simulated Annealing; M. Wright. 29. A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem; T. Yamada.
|
| Abstract
|
:
|
Tech- niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza- tion problems.
|
| Subject
|
:
|
Artificial intelligence.
|
| Subject
|
:
|
Mathematical optimization.
|
| Subject
|
:
|
Mathematics.
|
| LC Classification
|
:
|
QA402.5B934 2002
|
| Added Entry
|
:
|
Celso C Ribeiro
|
|
|
:
|
Pierre Hansen
|
| |