战略装车点选址问题的凸规划模型研究

Study on Convex Programming Model in Location Allocation Problem of Strategic Vehicle Loading Sites

为了从若干个候选站点中识别战略装车点的数量及位置,并确定从货物供给点到战略装车点和从战略装车点到货物需求点的运输方案,以使得包括运输费用、建设固定费用和运营费用在内的总费用最少,在既有非凸非线性规划模型的基础上,引入少量额外的变量和约束,将原有模型改进为数学性质更好的凸规划模型。最后通过对既有算例的计算测试,证明了新模型的求解能力。

In this paper, in order to identify the quantity and location of the strategy vehicle loading sites out of several candidate points and determine the optimal transportation solutions between the cargo supply points and the strategic vehicle loading points and from the loading points to the cargo demand points, we introduced a few additional variables and constraints to turn the original model into a mathematically superior convex programming model, and at the end, through a numerical example, demonstrated the validity of the new model.