Exact algorithms for the traveling salesman problem with draft limits

Exact algorithms for the traveling salesman problem with draft limits

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 base...

Full description

Bibliographic Details
Main Authors: Battarra, Maria (Author), Pessoa, Artur Alves (Author), Subramanian, Anand (Author), Uchoa, Eduardo (Author)
Format: Article
Language:English
Published: 2013-10-28.
Subjects:
Article
Online Access:Get fulltext
LEADER 00996 am a22001573u 4500
001 359445
042 |a dc 
100 1 0 |a Battarra, Maria  |e author 
700 1 0 |a Pessoa, Artur Alves  |e author 
700 1 0 |a Subramanian, Anand  |e author 
700 1 0 |a Uchoa, Eduardo  |e author 
245 0 0 |a Exact algorithms for the traveling salesman problem with draft limits 
260 |c 2013-10-28. 
856 |z Get fulltext  |u https://eprints.soton.ac.uk/359445/1/S0377221713008655 
520 |a 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. 
655 7 |a Article 

Similar Items