基于网络流的船舶设计中的管线布线问题
Network Flow based approaches for the Pipelines Routing Problem in Naval Design
摘要：
在本文中，我们提出了一个一般的方法，最佳的自动布线的空间管道最近的合作Ghenova，领先的海军工程公司的动机。我们提供了一个最低成本的多商品网络流为基础的模型，将所有的技术要求，一个可行的管道路由的问题。设计了一种分支切割方法，并推导出了不同的数学算法，有效地解决了这个问题。我们报告了一组计算实验的结果，以评估问题的性能，以及我们的合作伙伴公司提供的一个真实世界的海军实例的案例研究。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
