Ghinne/EsameAlgoritmiDiOttimizzazione

Risoluzione di un problema di Agent Scheduling (Traveling Salesman Problem With Time Windows)

Jupyter Notebook

Esame Algoritmi Di Ottimizzazione

Resolution of an Agent Scheduling problem

(Traveling Salesman Problem With Time Windows)

Variables:

$\\ -\;\boldsymbol{A}:\; Agents\;, \\ -\;\boldsymbol{C}:\;Clients, \\ -\;\boldsymbol{wd}: Working \;day:\left\{\begin{matrix} Office\; or\; client_1; \\ Travel; \\ Office\; or\; client_2; \\ Travel; \\ \vdots \\ Travel; \\ Office\; or\; client_k; \end{matrix}\right.$

Constraints:

30 min lunch between 12:00 and 14:00;
Limited working time (8 hours);
Limited waiting and traveling time;
Minimum time to spend in office (1 hour);

Objective function:

Maximize productive activities;
Priorityze meetings;
Minimize travels;

Models:

Integer Quadratic Programming

Heuristic set cover