๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Optimization Algorithms MEAP V02

โœ Scribed by Alaa Khamis


Publisher
Manning
Tongue
English
Leaves
149
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Solve design, planning, and control problems using modern machine learning and AI techniques.
In Optimization Algorithms: AI techniques for design, planning, and control problems you will learn:
Machine learning methods for search and optimization problems
The core concepts of search and optimization
Deterministic and stochastic optimization techniques
Graph search algorithms
Nature-inspired search and optimization algorithms
Efficient trade-offs between search space exploration and exploitation
State-of-the-art Python libraries for search and optimization
Optimization problems are everywhere in daily life. What's the fastest route from one place to another? How do you calculate the optimal price for a product? How should you plant crops, allocate resources, and schedule surgeries? Optimization Algorithms introduces the AI algorithms that can solve these complex and poorly-structured problems. Inside you'll find a wide range of optimization methods, from deterministic and stochastic derivative-free optimization to nature-inspired search algorithms and machine learning methods. Don't worry-there's no complex mathematical notation. You'll learn through in-depth case studies that cut through academic complexity to demonstrate how each algorithm works in the real world.
about the technology
Search and optimization algorithms are powerful tools that can help practitioners find optimal or near-optimal solutions to a wide range of design, planning and control problems. When you open a route planning app, call for a rideshare, or schedule a hospital appointment, an AI algorithm works behind the scenes to make sure you get an optimized result. This guide reveals the classical and modern algorithms behind these services.

โœฆ Table of Contents


Chapter 1: Introduction to Search and Optimization
1.1 Why care about search and optimization?
1.2 Going from toy problem to the real world
1.3 Basic ingredients of optimization problems
1.3.1 Decision Variables
1.3.2 Objective Functions
1.3.3 Constraints
1.4 Well-structured problems vs. Ill-structured problems
1.4.1 Well-structured problems (WSP)
1.4.2 Ill-structured Problems (ISP)
1.4.3 WSP but practically ISP
1.5 Search Algorithms and the Search Dilemma
1.6 Summary
Chapter 2: A Deeper Look at Search and Optimization
2.1 Optimization Problem Classification
2.1.1 Number and Type of Decision Variables
2.1.2 Landscape and Number of Objective Functions
2.1.3 Constraints
2.1.4 Linearity of Objective Functions and Constraints
2.1.5 Expected Quality and Permissible Time of the Solution
2.2 Search and Optimization Algorithm Classification
2.3 Heuristics and Meta-heuristics
2.4 Nature-inspired Algorithms
2.5 Exercises
2.6 Summary
Chapter 3: Blind Search Algorithms
3.1 Introduction to Graphs
3.2 Graph Search
3.3 Graph Traversal Algorithms
3.3.1 Breadth-first Search (BFS)
3.3.2 Depth-first Search (DFS)
3.4 Shortest Path Algorithms
3.4.1 Dijkstra Search
3.4.2 Uniform-Cost Search (UCS)
3.4.3 Bi-directional Dijkstra Search
3.5 Applying Blind Search to Routing Problem
3.6 Exercises
3.7 Summary
Appendix A: Search and Optimization Libraries in Python
A.1 Setting up the Python environment
A.1.1 Using a Python distribution
A.1.2 Installing Jupyter Notebook and JupyterLab
A.1.3 Cloning book repository
A.2 Mathematical Programming Solvers
A.2.1 SciPy
A.2.2 PuLP
A.3 Graph and Mapping Libraries
A.3.1 networkx
A.3.2 osmnx
A.3.3 GeoPandas
A.3.4 contextily
A.3.5 folium
A.3.6 Pyrosm
A.3.7 Other libraries and tools
A.4 Metaheuristics Optimization Libraries
A.4.1 PySwarms
A.4.2 Sckit-opt
A.4.3 networkx
A.4.4 Distributed Evolutionary Algorithms in Python (DEAP)
A.4.5 OR-Tools
A.4.6 Other Libraries
A.5 Machine Learning Libraries
A.5.1 Node2vec
A.5.2 DeepWalk
A.5.3 PyG
A.5.4 OpenAI Gym
A.5.5 Flow
A.5.6 Other libraries


๐Ÿ“œ SIMILAR VOLUMES


Convex Optimization Algorithms (for Algo
โœ Dimitri P. Bertsekas ๐Ÿ“‚ Library ๐Ÿ“… 2015 ๐Ÿ› Athena Scientific ๐ŸŒ English

This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of vi

Optimization Algorithms: AI techniques f
โœ Alaa Khamis ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Manning Publications ๐ŸŒ English

Solve design, planning, and control problems using modern machine learning and AI techniques. In Optimization Algorithms: AI techniques for design, planning, and control problems you will learn: Machine learning methods for search and optimization problems The core concepts of search and opti

Optimization Algorithms: AI techniques f
โœ Alaa Khamis ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Manning Publications ๐ŸŒ English

Solve design, planning, and control problems using modern machine learning and AI techniques. In Optimization Algorithms: AI techniques for design, planning, and control problems you will learn Machine learning methods for search and optimization problems The core concepts of search and optimiz

Multimodal Optimization by Means of Evol
โœ Mike Preuss (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2015 ๐Ÿ› Springer International Publishing ๐ŸŒ English

<p><p>This book offers the first comprehensive taxonomy for multimodal optimization algorithms, work with its root in topics such as niching, parallel evolutionary algorithms, and global optimization. </p><p>The author explains niching in evolutionary algorithms and its benefits; he examines their s

Optimization with Multivalued Mappings:
โœ Dempe S. (ed.), Kalashnikov V. (ed.) ๐Ÿ“‚ Library ๐Ÿ“… 2006 ๐ŸŒ English

"In the field of nondifferentiable nonconvex optimization, one of the most intensely investigated areas is that of optimization problems involving multivalued mappings in constraints or as the objective function. This book focuses on the tremendous development in the field that has taken place since