堵塞点可恢复型在线运输车辆的调度策略研究

针对现实物流配送中所遇到的无法预测的突发性线路堵塞问题,以在线车辆行驶的时间最短为优化目标,用竞争分析的方法研究了堵塞点可恢复型在线车辆的调度策略.充分地考虑到堵塞点的动态特征,分别介绍了在线运输车辆调度的贪婪策略、复位策略和等待策略等方案,并系统分析了这三种基本策略在竞争性能上的利弊,给出了选择策略及其算法模型.通过对选择策略的竞争比和竞争性能的分析,结果表明选择策略实现了对在线运输车辆的优化调度.

Study on the scheduling strategies for online vehicle with the recoverable congested vertices

Concerning about the problem of the unforeseen congested vertices in the actual transportation of materials,the paper,using a method of competitive analysis,studies the scheduling strategies for online vehicle with the recoverable congested vertices to realize the aim of a less-minimum-time for the online vehicle traveling.Taking into account the dynamic matters of the congested vertices,we introduce the three strategies of the greedy strategy,reposition strategy and waiting strategy respectivly,systematically introduce the advantages and disadvantages of the three strategies on their competitive performances,and then give the selection strategy and its algorithmic model.Through analyzing the competitive ratio and competitive performance of the selection strategy,the results clearly show that the selection strategy realcges the optimization scheduling of online vehicle well.