Essays and Surveys in Metaheuristics

Overview

The field of metaheuristics has been fast evolving in recent years. Techniques 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 optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout ...
See more details below
Paperback (Softcover reprint of the original 1st ed. 2002)
$347.88
BN.com price
(Save 12%)$399.00 List Price
Other sellers (Paperback)
  • All (3) from $293.17   
  • New (3) from $293.17   
Sending request ...

Overview

The field of metaheuristics has been fast evolving in recent years. Techniques 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 optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
Essays and Surveys in Metaheuristics goes beyond the recent conference-oriented volumes in Metaheuristics, with its focus on surveys of recent developments of the main metaheuristics. Well-known specialists have written surveys on the following subjects: simulated annealing (E. Aarts and J. Korst, The Netherlands), noising methods (I. Charon and O. Hudry, France), strategies for the parallel implementation of metaheuristics (V.-D. Cung and C. Roucairol, France, and S.L. Martins and C.C. Ribeiro, Brazil), greedy randomized adaptive search procedures (P. Festa, Italy, and M.G.C. Resende, USA), tabu search (M. Gendreau, Canada), variable neighborhood search (P. Hansen and N. Mladenovic, Canada), ant colonies (V. Maniezzo and A. Carbonaro, Italy), and evolutionary algorithms (H. Mühlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative or successful applications of metaheuristics to classical or new combinatorial optimization problems.
Read More Show Less

Product Details

  • ISBN-13: 9781461355885
  • Publisher: Springer US
  • Publication date: 4/30/2013
  • Series: Operations Research/Computer Science Interfaces Series , #15
  • Edition description: Softcover reprint of the original 1st ed. 2002
  • Edition number: 1
  • Pages: 651
  • Product dimensions: 6.14 (w) x 9.21 (h) x 1.34 (d)

Table of 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. Brandão. 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. Grünert. 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. Mühlenbein, 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. Stützle, H.H. Hoos. 27. POPMUSIC &endash; 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.
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)