Ferone, Daniele (2017) The Shortest Path Tour Problem and its variants. [Tesi di dottorato]
Preview |
Text
tesiFerone.pdf Download (661kB) | Preview |
| Item Type: | Tesi di dottorato |
|---|---|
| Resource language: | English |
| Title: | The Shortest Path Tour Problem and its variants |
| Creators: | Creators Email Ferone, Daniele daniele.ferone@unina.it |
| Date: | 21 February 2017 |
| Number of Pages: | 97 |
| Institution: | Università degli Studi di Napoli Federico II |
| Department: | Matematica e Applicazioni "Renato Caccioppoli" |
| Dottorato: | Scienze matematiche e informatiche |
| Ciclo di dottorato: | 29 |
| Coordinatore del Corso di dottorato: | nome email De Giovanni, Francesco francesco.degiovanni2@unina.it |
| Tutor: | nome email Festa, Paola UNSPECIFIED |
| Date: | 21 February 2017 |
| Number of Pages: | 97 |
| Keywords: | Shortest Path Problems, Shortest Path Tour, Time windows, GRASP, meta-heuristics |
| Settori scientifico-disciplinari del MIUR: | Area 01 - Scienze matematiche e informatiche > MAT/09 - Ricerca operativa |
| Date Deposited: | 20 Apr 2017 09:39 |
| Last Modified: | 14 Mar 2018 11:21 |
| URI: | http://www.fedoa.unina.it/id/eprint/11644 |
| DOI: | 10.6093/UNINA/FEDOA/11644 |
Collection description
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.
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |
