Network Flow based approaches for the Pipelines Routing Problem in Naval Design

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

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-08
Main Authors: Blanco, Víctor, González, Gabriel, Hinojosa, Yolanda, Ponce, Diego, Pozo, Miguel A, Puerto, Justo
Format: Article
Language:English
Subjects:
Algorithms
Minimum cost
Naval engineering
Pipelines
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 technical 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.
ISSN:2331-8422