Skip to content

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.

Start Exercises Lab Quiz Downloads

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.

More apps in the lab

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

    Read the chapter · Exercises

  • 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

    Read the chapter · Exercises

  • 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

    Read the chapter · Exercises

  • 4. Metaheuristics


    Chapter 4

    The problems and the assumptions · How to escape from a local optimum · Simulated annealing · Tabu search

    Read the chapter · Exercises

  • 5. MIP heuristics for the classical problems


    Chapter 5

    MIP-based heuristics · The problems and their MIP models · Rounding · Diving

    Read the chapter · Exercises

Don't miss

  • Exercises with solutions


    Exercises for every chapter, each with its worked solution that opens with a click.

    The exercises

  • 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.

    Test yourself

  • Interactive lab


    Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.

    The lab

  • Lecture notes in PDF


    Lecture notes, exercise books and slides in PDF, with the same numbering as the website.

    Downloads

  • Notebooks in Colab


    The code of the course running in the browser, with nothing to install.

    The notebooks

  • Full index


    All the chapters with their sections on one page, and how each chapter is organized.

    The index


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.

  • Mathematical Analysis 1

    real numbers, functions, limits, derivatives and series, with interactive graphs

  • Linear Algebra

    vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab

  • Algorithms

    number representation, pseudo-code, sorting and searching, analysis and recursive algorithms

  • Linear Programming

    polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab

  • Integer Linear Programming

    LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut

  • Convex Optimization

    convex sets and functions, convex optimization problems, with interactive graphs

  • Network Optimization

    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

  • Dynamic Programming

    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

  • Approximation Algorithms

    performance guarantees, approximation schemes and limits of approximation for combinatorial problems

  • LP Modelling

    linear programming models of managerial problems, solved with Python and Gurobi

  • NLP Modelling

    nonlinear programming models, from portfolios to machine learning, with Python and Gurobi

  • MIP Modelling

    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.