Scope of this thesis is to provide a treatment of the Shortest Path Tour Problem, and its variants. It presents a deep investigation of two variants of the SPTP, the Constrained Shortest Path Tour Problem and Shortest Path Tour Problem with Time Windows, respectively. Moreover, a GRASP meta-heuristic is applied to solve further hard combinatorial optimization problems.
The Shortest Path Tour Problem and its variants
2017
Abstract
Scope of this thesis is to provide a treatment of the Shortest Path Tour Problem, and its variants. It presents a deep investigation of two variants of the SPTP, the Constrained Shortest Path Tour Problem and Shortest Path Tour Problem with Time Windows, respectively. Moreover, a GRASP meta-heuristic is applied to solve further hard combinatorial optimization problems.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tesiFerone.pdf
accesso solo da BNCF e BNCR
Tipologia:
Altro materiale allegato
Licenza:
Tutti i diritti riservati
Dimensione
645.7 kB
Formato
Adobe PDF
|
645.7 kB | Adobe PDF |
I documenti in UNITESI sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/20.500.14242/345425
Il codice NBN di questa tesi è
URN:NBN:IT:BNCF-345425