Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $154.15
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Paperback)
  • All (8) from $154.15   
  • New (6) from $154.15   
  • Used (2) from $208.99   


Tabu Search (TS) and, more recently, Scatter Search (SS) have proved highly effective in solving a wide range of optimization problems, and have had a variety of applications in industry, science, and government. The goal of Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search is to report original research on algorithms and applications of tabu search, scatter search or both, as well as variations and extensions having "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results,
or describe the successful application of these methods to real world problems.
Read More Show Less

Product Details

  • ISBN-13: 9781441954831
  • Publisher: Springer US
  • Publication date: 12/8/2010
  • Series: Operations Research/Computer Science Interfaces Series , #30
  • Edition description: Softcover reprint of hardcover 1st ed. 2005
  • Edition number: 1
  • Pages: 466
  • Product dimensions: 0.97 (w) x 6.14 (h) x 9.21 (d)

Table of Contents

Advances for New Model and Solution Approaches.- A Scatter Search Tutorial for Graph-Based Permutation Problems.- A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems.- Scatter Search Methods for the Covering Tour Problem.- Solution of the SONET Ring Assignment Problem with Capacity Constraints.- Advances for Solving Classical Problems.- A Very Fast Tabu Search Algorithm for Job Shop Problem.- Tabu Search Heuristics for the Vehicle Routing Problem.- Some New Ideas in TS for Job Shop Scheduling.- A Tabu Search Heuristic for the Uncapacitated Facility Location Problem.- Adaptive Memory Search Guidance for Satisfiability Problems.- Experimental Evaluations.- Lessons from Applying and Experimenting with Scatter Search.- Tabu Search for Mixed Integer Programming.- Scatter Search vs. Genetic Algorithms.- Review of Recent Developments.- Parallel Computation, Co-operation, Tabu Search.- Using Group Theory to Construct and Characterize Metaheuristic Search Neighborhoods.- Logistics Management.- New Procedural Designs.- On the Integration of Metaheuristic Strategies in Constraint Programming.- General Purpose Metrics for Solution Variety.- Controlled Pool Maintenance for Metaheuristics.- Adaptive Memory Projection Methods for Integer Programming.- RAMP: A New Metaheuristic Framework for Combinatorial Optimization.

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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)