Combinatorial Optimisation

Combinatorial Optimisation

Credits

6

Prerequisites

None.

Examination method

Final oral exam.

Learning
objectives

The main aim of this course is to introduce students to the use of mathematical programming models, with particular attention to integer optimisation models corresponding to computationally intractable decision problems, and to their applications in the fields of logistics, services and industrial production.

Contents

Introduction to combinatorial optimisation problems and to problems in recognition form. Complexity classes P, NP, NP-hard and NP-complete. Classification of solution methods (exact methods, approximation methods and heuristic methods). Heuristic and metaheuristic algorithms: Simulated Annealing; Tabu Search; Genetic Algorithms; GRASP; Local Search Algorithms. The Travelling Salesman Problem (TSP). Distribution problems (Vehicle Routing).

Academic Year
2018/2019

Lecturer: Paola FESTA.

Semester: second.