Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270)
$96.79 / copy at 25+ copies As low as $94.59 at 100+Your best volume price
Total $2,419.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270)
Nowadays, music-inspired phenomenon-mimicking harmony search algorithm is fast growing with many applications. One of key success factors of the algorithm is the employment of a novel stochastic derivative which can be used even for discrete variables. Instead of traditional calculus-based gradient, the algorithm utilizes musician’s experience as a derivative in searching for an optimal solution. This can be a new paradigm and main reason in the successes of various applications.
The goal of this book is to introduce major advances of the harmony search algorithm in recent years. The book contains 14 chapters with the following subjects: State-of-the-art in the harmony search algorithm structure; robotics (robot terrain and manipulator trajectory); visual tracking; web text data mining; power flow planning; fuzzy control system; hybridization (with Taguchi method or SQP method); groundwater management; irrigation ; logistics; timetabling; and bioinformatics (RNA structure prediction).
This book collects the above-mentioned theory and applications, which are dispersed in various technical publications, so that readers can have a good grasp of current status of the harmony search algorithm and foster new breakthroughs in their fields using the algorithm.
The book, Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270) [Bulk, Wholesale, Quantity] ISBN#9783642263170 in Paperback by Zong Woo Geem may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Springer Berlin Heidelberg
- Author
- Zong Woo Geem
- Format
- Paperback
- Published
- May 28, 2012
- ISBN-13
- 9783642263170
- Pages
- 175
- Printing
- Printed on demand
Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270) in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $96.79 | 12% off list |
| 50 – 99 | $95.69 | 13% off list |
| 100+ | $94.59 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
How fast can I get copies of Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Recent Advances in Harmony Search Algorithm (Studies in Computational Intelligence #270)
Groups also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.