The Shortest Path Tour Problem and its variants
Daniele Ferone · Università degli Studi di Napoli Federico II · 2017
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.