优化空车调配问题的数学模型  

Mathematical Model for the Problem of Optimal Empty Car Distribution

作　　者：李文权[1,2] 杜文[1,2] 

机构地区：[1]东南大学交通学院 [2]西南交通大学运输工程系

出　　处：《系统工程理论与实践》1998年第10期1-5,27,共6页Systems Engineering-Theory & Practice

摘　　要：研究车站空车调配问题。阐述了研究该问题对编制车站日班工作计划的意义，并对研究该问题的文献做了综述。将原问题分解为三个子问题：１．最优空车分配数；２．充分利用卸后空车；３．利用调机的具体计划。给出了子问题１、２的数学模型，子问题３的具体模型将另文讨论。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.

关 键 词：车站 日班工作计划 配空车计划 铁路 数学模型 

分 类 号：U284.59[交通运输工程—交通信息工程及控制]