铁路营销日班计划编制辅助决策的算法及实现  

Realization of Algorithm on Assistant Decision-Making System for Railway Daily Plan of Freight Operation

作　　者：张彪[1] 袁振洲[1] 胡思继[1] 

机构地区：[1]北方交通大学交通运输学院,北京100044

出　　处：《北方交通大学学报》2003年第2期79-82,共4页Journal of Northern Jiaotong University

基　　金：铁道部科技研究开发项目(YS2002D0060)

摘　　要：针对铁路分局或铁路局请求车数审批的盲目性,提出了一种优化调整算法.该算法是基于单目标、多约束条件的单纯形法.它有请求车数、交出分界口、到达分局、限制口、装车站等的限制车数为约束条件,以日班计划承认车运输收入最大化为目标函数.在此算法的基础上,开发了货运经营性决策系统.本文的理论研究结果和开发出的系统为运输企业的合理经营及经济效益的提高提供了有效的工具.According to the blindness of the railway substation examinations of required cargo numbers, we propose a new algorithm of optimization and adjustment. This algorithm is a simplex method based on the simple object and multi_condition restriction. It takes many factors as restrictions, such as the numbers of cargo applied, the station where cargos are surrendered, the arriving railway sub_bureau, the special station for limitation, the station where cargos are loaded, etc. and the maximal income of transportation as target function. Here a management and decision_making system is an example based on this algorithm. This paper has the theoretic and practical value for the improvement to the benefit of transportation enterprises.

关 键 词：铁路运输管理 重点物资 运输收入 承认车 

分 类 号：U294.15[交通运输工程—交通运输规划与管理]