单车型确定性动态车辆调配问题

Research on the Deterministic Dynamic Vehicle Allocation Problem with Homogeneous Vehicle Type

给出了单车型确定性动态车辆调配问题的定义,引入网络图描述该问题。建立了问题的线性规划模型,鉴于线性模型的缺点,利用函数逼近技术构造一个特殊的线性函数来近似目标函数中未来时段部分,从而建立起问题的时空分解模型,把问题从时间和空间上分解为多个单时段单节点问题,并根据单时段单节点问题特点设计简单的排序求解方法。最后,给出了模型的完整求解过程,从而使问题得到有效地解决。

The deterministic dynamic vehicle allocation problem with homogeneous vehicle type is defined. And the network chart is used to depict the problem. The linear programming model is expressed. Owing to the shortcoming of the model, a particular linear function is devised to approximate the recourse func tions from next time period to the end of the planning horizon through the use of the aproximation techniques. So the new-style model is formulated. And the problem by time and space is decomposed into a series of local problems by the linear approximation, one for each terminal. The simple sort algorithm is devised for the local problem. At last the methods are summarized. The problem can be effectively solved with the methods.