摘要
基于k-卡车问题和局内运输问题,提出了具有时间窗的局内封闭式车辆调度问题,建立了相关的模型,研究了当车辆数为1时该问题的竞争分析的有关结果,给出了三种不同的竞争策略,得到了相应的竞争比,并进行了理论证明.
Base on the k-truck problem and on-line transportation problem, we propose the close on-line Truck Scheduling Problem with Time-window (TSPTW). A relevant model is established. And the case which has only one vehicle is studied and some results are obtained: three different competitive strategies are designed and the relevant competitive ratios are obtained and proved.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2004年第9期72-78,共7页
Systems Engineering-Theory & Practice
基金
中国博士后科学基金(2003034014)
国家自然科学基金(72101001
70231010)
关键词
局内问题
竞争策略
竞争比
车辆调度
on-line problem
competitive strategy
competitive ratio
truck scheduling
