|
|||||
|
|
Exact algorithms for the traveling salesman problem with draft limits |
|
| Authors: | Maria Battarra Artur Alves Pessoa Anand Subramanian Eduardo Uchoa |
| Affiliation: | 1. University of Southampton, School of Mathematics, Southampton SO17 1BJ, UK;2. Universidade Federal Fluminense, Departamento de Engenharia de Produção, Rua Passo da Pátria 156, Bloco E, 4° andar, São Domingos, Niterói, RJ 24210-240, Brazil;3. Universidade Federal da Paraíba, Departamento de Engenharia de Produção, Centro de Tecnologia, Campus I, Bloco G, Cidade Universitária, João Pessoa, PB 58051-970, Brazil |
| 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. |
| Keywords: | Draft limits Traveling salesman Cutting planes Column generation Extended formulation |
| 本文献已被 ScienceDirect 等数据库收录！ | |