| 优化空车调配问题的数学模型 |
| |
| 引用本文： | 李文权,杜文.优化空车调配问题的数学模型[J].系统工程理论与实践,1998,18(10):1-5. |
| |
| 作者姓名： | 李文权 杜文 |
| |
| 作者单位： | 东南大学交通学院(李文权)，西南交通大学运输工程系(杜文) |
| |
| 摘 要： | 研究车站空车调配问题。阐述了研究该问题对编制车站日班工作计划的意义，并对研究该问题的文献做了综述。将原问题分解为三个子问题：１．最优空车分配数；２．充分利用卸后空车；３．利用调机的具体计划。给出了子问题１、２的数学模型，子问题３的具体模型将另文讨论。
|
| 关 键 词： | 车站日班工作计划 配空车计划 数学规划 |
Mathematical Model for the Problem of Optimal Empty Car Distribution |
| |
| Li Wenquan \ Du Wen,\.Mathematical Model for the Problem of Optimal Empty Car Distribution[J].Systems Engineering —Theory & Practice,1998,18(10):1-5. |
| |
| Authors: | Li Wenquan \ Du Wen \ |
| |
| Institution: | Li Wenquan 1\ Du Wen 2 \ 1 |
| |
| Abstract: | The mathematical model for the problem of optimal empty car distribution is studied in this paper. The significance of studying this problem for making daily and shift plans is set forth, and the literature about this problem is reviewed. The problem is decomposed into three subproblems:1. The number of optimal empty car distribution; 2. Bringing empty cars after unloading into full play; 3. Particular plans for the use of the shunting engine. The mathematical models for subproblem 1 and 2 are given. The particular model for subproblem 3 will be discussed in the other paper. |
| |
| Keywords: | station daily and shift plans the plans of empty car distribution mathematical programming |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
