论文部分内容阅读
基于k-卡车问题和局内运输问题,提出了具有时间窗的局内封闭式车辆调度问题,建立了相关的模型,研究了当车辆数为1时该问题的竞争分析的有关结果,给出了三种不同的竞争策略,得到了相应的竞争比,并进行了理论证明.
Based on the problem of k-truck and the problem of intra-office transportation, an interior closed vehicle scheduling problem with time windows is proposed. Relevant models are established, and the relevant results of the competition analysis of the problem when the number of vehicles is 1 are given. Different kinds of competition strategies have obtained the corresponding competition ratio, and have carried on the theory proof.