Exact algorithms for the Traveling Salesman Problem with Draft Limits

Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa

Research output: Contribution to journalArticle

15 Citations (Scopus)


This paper deals with the Traveling Salesman Problem (TSP) with Draft Limits (TSPDL), which is a variant of the well-known TSP in the context of maritime transportation. In this recently proposed problem, draft limits are imposed due to restrictions on the port infrastructures. Exact algorithms based on three mathematical formulations are proposed and their performance compared through extensive computational experiments. Optimal solutions are reported for open instances of benchmark problems available in the literature.
Original languageEnglish
Pages (from-to)115-128
Number of pages14
JournalEuropean Journal of Operational Research
Issue number1
Early online date28 Oct 2013
Publication statusPublished - 16 May 2014


Cite this