Network flow based approaches for the pipelines routing problem in naval design

Description

In this paper we propose a general methodology for the optimal automatic routing of spatial pipelines motivated by a recent collaboration with Ghenova, a leading Naval Engineering company. We provide a minimum cost multicommodity network flow based model for the problem incorporating all the tech- nical requirements for a feasible pipeline routing. A branch-and-cut approach is designed and different matheuristic algorithms are derived for solving efficiently the problem. We report the results of a battery of computational experiments to assess the problem performance as well as a case study of a real-world naval instance provided by our partner company.

Abstract

Ministerio de Ciencia Y Tecnología (MCYT). España PID2020-114594GB-C21

Abstract

European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER) US-1256951

Abstract

Junta de Andalucía P18-FR-1422

Abstract

Junta de Andalucía CEI-3-FQM331

Abstract

Junta de Andalucía B-FQM-322-UGR20

Additional details