41579 - Full Exploitation of Resources (Graduate Course)

Learning outcomes

Knowledge of the most effective techniques for the solution of complex decisional problems arising in the optimal planning and management of large scale systems.

Definition of mathematical models and heuristic algorithms for the practical solution of the corresponding optimization problems.

Course contents

The main objective of the course is to present the most effective techniques for the solution of complex decisional problems arising in the optimal planning and management of large scale systems concerning both the public and the private sectors. 
Mathematical models and heuristic algorithms for the practical solution of the corresponding optimization problems will be described. 
Particular attention will be given to the algorithmic and implementation aspects.
Applications of the proposed techniques to real-world problems will be presented and analyzed.

 

Course contents 

Basic heuristic approaches. Constructive algorithms. Algorithms based on relaxations and optimization techniques. Local search procedures. Metaheuristic algorithms: simulated annealing,  genetic algorithms, tabu search, hybrid algorithms.

Effective heuristic and metaheuristic algorithms for difficult combinatorial optimization problems: Algorithms for the Traveling Salesman Problem. Algorithms for the Set Covering Problem. Algorithms for the Vehicle Routing  Problem. Algorithms for the Vertex Coloring  Problem.

Real-World applications: Routing and Loading Problems. Freight Distribution. Transportation of Handicapped Persons. Crew Scheduling and Rostering in Public Transportation Companies.

Readings/Bibliography

Relevant References:

S. Martello, P. Toth, Knapsack Problems: Algortihms and Computer Implementations, J. Wiley, 1990.
R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993.
E.Aarts, J.K. Lenstra (editors), Local Search in Combinatorial Optimization, J.Wiley, 1997.
G. Gutin, A. Punnen (editors), The Traveling Salesman Problem and Its Variations, Kluwer, 2002.
P.Toth, D. Vigo (editors), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, 2002.
C. Barnhart, G. Laporte (editors), Transportation, Handbooks in Operations Research and Management Science, North Holland, 2007.

Teaching methods

Course offered in English according to an "e-learning" approach.

Assessment methods

Final written test on the definition of effective heuritic algorithms.
     
Two not compulsory exercises will be proposed on the AlmaChannel Platform. The first one will be proposed during the course, the second one at the end of the course. The exercises can be carried out in place of the final written test.

The evaluation of the students will consider their active partecipation to the “forum” activities.

Teaching tools

The teaching material, covering all the lessons of the course, will be available on the AlmaChannel Platform.  

The access is restricted to registered students.

Office hours

See the website of Paolo Toth

See the website of Silvano Martello