Exact algorithms for the Traveling Salesman Problem with Draft Limits

Maria Battarra, artur pessoa, anand subramanian, Eduardo Uchoa

Research output: Contribution to journalArticle

14 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)115
Number of pages128
JournalEuropean Journal of Operational Research
Early online date28 Oct 2013
DOIs
Publication statusPublished - 14 May 2014

Fingerprint

Traveling salesman problem
Exact Algorithms
Travelling salesman problems
Computational Experiments
Infrastructure
Optimal Solution
Benchmark
Restriction
Formulation
Experiments
Draft
Context
Optimal solution
Experiment

Cite this

Exact algorithms for the Traveling Salesman Problem with Draft Limits. / Battarra, Maria; pessoa, artur; subramanian, anand; Uchoa, Eduardo.

In: European Journal of Operational Research, 14.05.2014, p. 115.

Research output: Contribution to journalArticle

@article{48f960f91b6e4d23b5b0c1038faf24f7,
title = "Exact algorithms for the Traveling Salesman Problem with Draft Limits",
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.",
author = "Maria Battarra and artur pessoa and anand subramanian and Eduardo Uchoa",
year = "2014",
month = "5",
day = "14",
doi = "10.1016/j.ejor.2013.10.042",
language = "English",
pages = "115",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",

}

TY - JOUR

T1 - Exact algorithms for the Traveling Salesman Problem with Draft Limits

AU - Battarra, Maria

AU - pessoa, artur

AU - subramanian, anand

AU - Uchoa, Eduardo

PY - 2014/5/14

Y1 - 2014/5/14

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

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

UR - http://dx.doi.org/10.1016/j.ejor.2013.10.042

U2 - 10.1016/j.ejor.2013.10.042

DO - 10.1016/j.ejor.2013.10.042

M3 - Article

SP - 115

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

ER -