Handbook of Metaheuristic Algorithms
From Fundamental Theories to Advanced Applications
Series: Uncertainty, Computational Techniques, and Decision Intelligence;
- Publisher's listprice EUR 160.00
-
67 872 Ft (64 640 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 13 574 Ft off)
- Discounted price 54 298 Ft (51 712 Ft + 5% VAT)
67 872 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Academic Press
- Date of Publication 5 June 2023
- ISBN 9780443191084
- Binding Paperback
- No. of pages622 pages
- Size 228x152 mm
- Weight 1020 g
- Language English 509
Categories
Long description:
Handbook of Metaheuristic Algorithms: From Fundamental Theories to Advanced Applications provides a brief introduction to metaheuristic algorithms from the ground up, including basic ideas and advanced solutions. Although readers may be able to find source code for some metaheuristic algorithms on the Internet, the coding styles and explanations are generally quite different, and thus requiring expanded knowledge between theory and implementation. This book can also help students and researchers construct an integrated perspective of metaheuristic and unsupervised algorithms for artificial intelligence research in computer science and applied engineering domains.
Metaheuristic algorithms can be considered the epitome of unsupervised learning algorithms for the optimization of engineering and artificial intelligence problems, including simulated annealing (SA), tabu search (TS), genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), differential evolution (DE), and others. Distinct from most supervised learning algorithms that need labeled data to learn and construct determination models, metaheuristic algorithms inherit characteristics of unsupervised learning algorithms used for solving complex engineering optimization problems without labeled data, just like self-learning, to find solutions to complex problems.
MoreTable of Contents:
PART 1 Fundamentals
1. Introduction
2. Optimization problems
3. Traditional methods
4. Metaheuristic algorithms
5. Simulated annealing
6. Tabu search
7. Genetic algorithm
8. Ant colony optimization
9. Particle swarm optimization
10. Differential evolution
PART 2 Advanced technologies
11. Solution encoding and initialization operator
12. Transition operator
13. Evaluation and determination operators
14. Parallel metaheuristic algorithm
15. Hybrid metaheuristic and hyperheuristic algorithms
16. Local search algorithm
17. Pattern reduction
18. Search economics
19. Advanced applications
20. Conclusion and future research directions
A. Interpretations and analyses of simulation results
B. Implementation in Python
More
Handbook of Metaheuristic Algorithms: From Fundamental Theories to Advanced Applications
Subcribe now and receive a favourable price.
Subscribe
67 872 HUF
