摘要
对现实物流配送中遇到的无法预测的线路堵塞问题,建立了具有堵塞点的局内车辆选线问题的数学模型,并分别介绍了局内运输车辆调度的贪婪策略和复位策略.在全面分析了这2种基本策略在竞争性能上的优劣之后,给出了比较策略及其算法模型.最后,讨论了该策略的竞争性能.结果表明,比较策略实现了对局内运输车辆的优化调度.
Faced with the problem of the unforeseen congested vertices in the actual material flow transportation, we build the on-line vehicle scheduling model with the congested vertices in this paper. We introduce two on-line scheduling strategies, such as greedy strategy, reposition strategy, analyze the advantages and disadvantages of competitive performance of two strategies, and then present the comparison strategy and the algorithmica model. By competitive performance analysis, we think that the comparison strategy is the optimal scheduling scheme for on-line vehicle transportation.
出处
《宁夏大学学报（自然科学版）》
CAS
北大核心
2005年第3期207-210,共4页
Journal of Ningxia University(Natural Science Edition)
基金
宁夏高校科研基金资助项目(2004070)
关键词
局内问题
贪婪策略
复位策略
比较策略
竞争比
on-line problem
greedy strategy
reposition strategy
comparison strategy
competitive ratio
