Exact algorithms for the traveling salesman problem with draft limits

Battarra, Maria, Pessoa, Artur Alves, Subramanian, Anand and Uchoa, Eduardo (2013) Exact algorithms for the traveling salesman problem with draft limits. European Journal of Operational Research, n/a. (doi:10.1016/j.ejor.2013.10.042).

Record type: Article

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.

Text

pii/S0377221713008655 - Author's Original

Download (41kB)

More information

Published date: 28 October 2013

Organisations: Operational Research

Identifiers

Local EPrints ID: 359445

URI: http://eprints.soton.ac.uk/id/eprint/359445

DOI: doi:10.1016/j.ejor.2013.10.042

ISSN: 0377-2217

PURE UUID: 7a0d73bf-68e3-4d11-807f-9d283d160349

Catalogue record

Date deposited: 01 Nov 2013 15:04

Last modified: 14 Mar 2024 15:22

Export record

Altmetrics

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: Maria Battarra

Author: Artur Alves Pessoa

Author: Anand Subramanian

Author: Eduardo Uchoa

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information