Heuristic Algorithms¶
A course of the Operations Research and Mathematics series · all the courses
Teaching material conceived and developed by Fabio Furini, associate professor at DIAG, Sapienza University of Rome.
The course lecture notes, online: heuristic algorithms for combinatorial optimization problems, that is, primal and dual bounds and the evaluation of heuristics, constructive heuristics, local search, metaheuristics and MIP heuristics, applied to knapsack, packing, routing, scheduling and coloring problems; with definitions, examples worked out step by step, exercises with solutions, Colab notebooks and interactive apps.
Prerequisites: Combinatorial Optimization Problems for the problems, their instances and their formulations.
Try it now¶
Simulated annealing on a 20-city TSP: the best tour found over the optimal one and the curve of the tour length, which accepts worse tours while the temperature is high. Press «Run» to follow it one iteration at a time, or switch to tabu search.
The parts of the course¶
The chapters of the course, the same as in the lecture notes and in the menu.
-
1. Heuristic algorithms: definitions
Chapter 1
The problems and the assumptions · Primal and dual bounds · Classification of heuristic algorithms · Solution representation and search space
-
2. Constructive heuristics
Chapter 2
The problems and the assumptions · The greedy paradigm · The 0/1 knapsack problem: which order? · The bin packing problem: first sort, then pack
-
3. Local search
Chapter 3
The problems, the assumptions and the starting solutions · Local search: the scheme · Neighbourhoods for the four problems · First improvement and best improvement
-
4. Metaheuristics
Chapter 4
The problems and the assumptions · How to escape from a local optimum · Simulated annealing · Tabu search
-
5. MIP heuristics for the classical problems
Chapter 5
MIP-based heuristics · The problems and their MIP models · Rounding · Diving
Don't miss¶
-
Exercises with solutions
Exercises for every chapter, each with its worked solution that opens with a click.
-
Self-assessment quiz
A new mock exam at every start: 13 questions, 33 points, with the solution and the link to the notes. Downloads also has the full question bank.
-
Interactive lab
Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.
-
Lecture notes in PDF
Lecture notes, exercise books and slides in PDF, with the same numbering as the website.
-
Notebooks in Colab
The code of the course running in the browser, with nothing to install.
-
Full index
All the chapters with their sections on one page, and how each chapter is organized.
The series¶
All the courses of the series are built the same way: lecture notes online and in PDF, exercises with solutions, an interactive lab and self-assessment quizzes.
-
real numbers, functions, limits, derivatives and series, with interactive graphs
-
vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab
-
number representation, pseudo-code, sorting and searching, analysis and recursive algorithms
-
polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab
-
LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut
-
convex sets and functions, convex optimization problems, with interactive graphs
-
graphs, spanning trees, shortest paths, network flows, the network simplex and project management
-
Combinatorial Optimization Problems
knapsack, bin packing, coloring, TSP, scheduling and lot sizing: the problems, their formulations and ad hoc algorithms
-
principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting
-
Heuristic Algorithms · this course
constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems
-
performance guarantees, approximation schemes and limits of approximation for combinatorial problems
-
linear programming models of managerial problems, solved with Python and Gurobi
-
nonlinear programming models, from portfolios to machine learning, with Python and Gurobi
-
integer linear programming models, from the formulation to the solution with solvers
Teaching material by Fabio Furini — DIAG, Sapienza University of Rome.
This website is also available in Italian.