Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 235, Issue 1, Pages 115-128Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2013.10.042
Keywords
Draft limits; Traveling salesman; Cutting planes; Column generation; Extended formulation
Funding
- Santander Universities UK, UoS Internationalisation Fund
- Brazilian research agency CNPq
- Brazilian research agency CAPES
- Brazilian research agency FAPERJ
- CORMSIS, Centre of Operational Research, Management Sciences and Information Systems
Ask authors/readers for more resources
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. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available