Skip to main content

Exact and Heuristic Solutions of the Carrier-Vehicle Travelling Salesman Problem

Gambella Claudio
Routing problems focusing on energy distribution issues
Supervisor: Daniele Vigo
Co-Advisor: Andrea Lodi
Personal home page

Mail:claudio.gambella "at" unibo "dot" it

I am currently studying exact approaches for solving the Carrier Vehicle Traveling Salesman Problem (CVTSP). The goal of the CV-TSP is to make a fast vehicle visit a given collection of points in shortest time while using a carrier autonomous vehicle as a base for possible multiple tours. As a consequence, carrier and vechile tours should be synchronized. My work focuses on the case in which the visiting sequence of the targets is not a priori given.