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

08/01/2021
by   Víctor Blanco, et al.
0

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.

READ FULL TEXT
research
05/02/2022

Assessing Routing Algorithms for PCNs: Full Evaluation Results

Within this Technical Report, we present the full analysis of 61 routing...
research
05/10/2019

Inferring Catchment in Internet Routing

BGP is the de-facto Internet routing protocol for exchanging prefix reac...
research
04/08/2020

A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics

We consider an NP-hard selective and periodic inventory routing problem ...
research
07/28/2022

Very large-scale neighborhood search for drone routing with energy replenishment

The Drone Routing Problem with Energy replenishment (DRP-E) belongs to a...
research
01/15/2019

Implementing an ERP System: The Paradigm of a Chemical Company

An application of a methodology present in the previous paper An ERP Imp...
research
06/01/2023

Green Traffic Engineering by Line Card Minimization

Green Traffic Engineering encompasses network design and traffic routing...

Please sign up or login with your details

Forgot password? Click here to reset