| 局内封闭式车辆调度问题及其竞争策略 |
| |
| 引用本文： | 马卫民,王刊良.局内封闭式车辆调度问题及其竞争策略[J].系统工程理论与实践,2004,24(9):72-78. |
| |
| 作者姓名： | 马卫民 王刊良 |
| |
| 作者单位： | (1)清华大学经济管理学院;(2)西安交通大学管理学院;(3)西安工业学院经济管理学院 |
| |
| 基金项目： | 中国博士后科学基金(2003034014)，国家自然科学基金(72101001，70231010) |
| |
| 摘 要： | 基于k-卡车问题和局内运输问题,提出了具有时间窗的局内封闭式车辆调度问题,建立了相关的模型,研究了当车辆数为1时该问题的竞争分析的有关结果,给出了三种不同的竞争策略,得到了相应的竞争比,并进行了理论证明.
|
| 关 键 词： | 局内问题 竞争策略 竞争比 车辆调度 |
| 文章编号： | 1000-6788(2004)09-0072-07 |
| 修稿时间： | 2003年10月20 |
Competitive Analysis for the Close On-line Truck Scheduling Problem with Time-Window |
| |
| MA Wei-min.Competitive Analysis for the Close On-line Truck Scheduling Problem with Time-Window[J].Systems Engineering —Theory & Practice,2004,24(9):72-78. |
| |
| Authors: | MA Wei-min |
| |
| Institution: | (1)School of Economics and Management,Tsinghua University;(2)School of Economics and Management, Xi'an Institute of Technology;(3)Management School, Xi'an Jiaotong University |
| |
| Abstract: | 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. |
| |
| Keywords: | on-line problem competitive strategy competitive ratio truck scheduling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
