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

•A general methodology for the optimal automatic routing of spatial pipelines is given.•We provide a minimum cost multicommodity network flow based model.•The model incorporates all the technical requirements for a feasible pipeline routing.•A branch-and-cut approach and different matheuristic algor...

Full description

Saved in:
Bibliographic Details
Published in:Omega (Oxford) 2022-09, Vol.111, p.102659, Article 102659
Main Authors: Blanco, Víctor, González, Gabriel, Hinojosa, Yolanda, Ponce, Diego, Pozo, Miguel A., Puerto, Justo
Format: Article
Language:English
Subjects:
Branch-and-Cut
Matheuristics
Naval engineering
Network design
Pipeline routing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•A general methodology for the optimal automatic routing of spatial pipelines is given.•We provide a minimum cost multicommodity network flow based model.•The model incorporates all the technical requirements for a feasible pipeline routing.•A branch-and-cut approach and different matheuristic algorithms have been designed.•Computational experiments include a case study of a real-world naval instance. 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:0305-0483
1873-5274
DOI:10.1016/j.omega.2022.102659