2-Facility manifold location routing problem

详细信息    查看全文

• 作者：Emre Tokgöz ; Theodore B. Trafalis
• 关键词：Manifold location routing problem ; Optimization ; Location routing problem ; Weber problem ; Riemannian manifold
• 刊名：Optimization Letters
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：11
• 期：2
• 页码：389-405
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Optimization; Operation Research/Decision Theory; Computational Intelligence; Numerical and Computational Physics, Simulation;
• 出版者：Springer Berlin Heidelberg
• ISSN：1862-4480
• 卷排序：11

文摘

The location routing problem (LRP), known to be the combination of the facility location and vehicle routing problems, is solved in the literature by either assuming planar or spherical surfaces. In this work, the manifold location routing problem (MLRP), that is an LRP on Riemannian manifold surfaces, is explained for the 2-facility (2-MLRP) case with the corresponding heuristic algorithm solution. The 2-MLRP problem is a mixed integer non-linear programming problem that is determined to be NP-hard. Special cases of MLRP include LRP on planar surfaces, when the manifold’s curvature is 0, and LRP on spherical surfaces when the curvature of the manifold is 1.