Exact and heuristic algorithms for routing problems

Research output: Contribution to journalArticlepeer-review

7 Citations (SciVal)


This is a summary of the authors PhD thesis supervised by Daniele Vigo and defended on 30 March 2010, at the Università di Bologna. The thesis is written in English and is available from the author upon request. Several rich routing problems attaining to the transportation area have been studied. "Simple" algorithms have been proposed to solve them, both exact and heuristic, producing high quality solutions and transferrable methods.

Original languageEnglish
Pages (from-to)421-424
Number of pages4
Issue number4
Publication statusPublished - 1 Dec 2011


  • CVRP with heterogeneous fleet
  • Multiple trip VRP
  • Routing
  • Saving algorithms
  • TSP with pickup and delivery

ASJC Scopus subject areas

  • Management Information Systems
  • Computational Theory and Mathematics
  • Theoretical Computer Science


Dive into the research topics of 'Exact and heuristic algorithms for routing problems'. Together they form a unique fingerprint.

Cite this