Advances in Metaheuristics for Hard Optimization
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Advances in Metaheuristics for Hard Optimization
Advances in Metaheuristics for Hard Optimization

Advances in Metaheuristics for Hard Optimization

|
     0     
5
4
3
2
1




International Edition


About the Book

Many advances have been made recently in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general-purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and various metaheuristics. The book gathers contributions related to the following topics: theoretical developments in metaheuristics; adaptation of discrete metaheuristics to continuous optimization; performance comparisons of metaheuristics; cooperative methods combining different approaches; parallel and distributed metaheuristics for multiobjective optimization; software implementations; and real-world applications. This book is suitable for practitioners, researchers and graduate students in disciplines such as optimization, heuristics, operations research, and natural computing.

Table of Contents:
Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization.- Four-bar Mechanism Synthesis for n Desired Path Points Using Simulated Annealing.- “MOSS-II” Tabu/Scatter Search for Nonlinear Multiobjective Optimization.- Feature Selection for Heterogeneous Ensembles of Nearest-neighbour Classifiers Using Hybrid Tabu Search.- A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation.- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions.- Dynamic Load Balancing Using an Ant Colony Approach in Micro-cellular Mobile Communications Systems.- New Ways to Calibrate Evolutionary Algorithms.- Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms.- Local Search Based on Genetic Algorithms.- Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality.- Aligning Time Series with Genetically Tuned Dynamic Time Warping Algorithm.- Evolutionary Generation of Artificial Creature’s Personality for Ubiquitous Services.- Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems.- Coevolutionary Genetic Algorithm to Solve Economic Dispatch.- An Evolutionary Approach to Solve a Novel Mechatronic Multiobjective Optimization Problem.- Optimizing Stochastic Functions Using a Genetic Algorithm: An Aeronautic Military Application.- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms.- Making a Difference to Differential Evolution.- Hidden Markov Models Training Using Population-based Metaheuristics.- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization.


Best Sellers


Product Details
  • ISBN-13: 9783540729594
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 481
  • Returnable: Y
  • ISBN-10: 3540729593
  • Publisher Date: 19 Nov 2007
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances in Metaheuristics for Hard Optimization
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Advances in Metaheuristics for Hard Optimization
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advances in Metaheuristics for Hard Optimization

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!