Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897585 | European Journal of Operational Research | 2014 | 14 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa,