供给总量限定需求区间约束型运输问题--时限费用优化模型与算法  

The Transportation Problem with Supply Amount Specified and Demand Interval Constraint——Models and Algorithms for Optimization on Time Limit and Cost

作　　者：谢凡荣[1] 贾仁安[2] 

机构地区：[1]南昌大学数学系,江西南昌330031 [2]南昌大学系统工程研究所,江西南昌330031

出　　处：《运筹与管理》2008年第1期42-47,共6页Operations Research and Management Science

基　　金：国家自然科学基金资助项目(70761004,10761006);江西省高校省级教改课题(赣教高字[2004]100号);江西省教育厅基金资助项目(赣教技字[2007]10号);南昌大学科学基金资助项目(04Z02914)

摘　　要：本文目的是为建立与运输问题有关的决策支持系统提供方便。本文建立了供给总量限定需求区间约束型运输问题的对时限与费用两个目标进行优化的多目标规划模型,给出了求解模型的算法,并举例说明了算法的应用。该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点。数值实验表明该算法有较高的计算效率,可用于求解某些类型的指派问题。The purpose of this paper is to facilitate building decision support system relative to transportation problem. Optimization on time limit and cost of the transportation problem with supply amount specified and demand interval constraint is formulated by two multi - objective programming models in this paper. As the solution method of the models, two algorithms are proposed. And the application of the algorithms is illustrated with an example. The algorithms not only can find the optimal solutions to the problem, but also have good performance in the sense of being implemented on computer, convergence, etc. Numerical experiments have validated the great practicality and effectiveness of the algorithms, which can be used to solve some kinds of assignment problem.

关 键 词：运筹学 决策支持系统 数值实验 运输问题 供给总量限定需求区间约束型运输问题 最短时限最少费用供给总量限定需求区间约束型运输问题 最少费用最短时限供给总量限定需求区间约束型运输问题 正则型运输网络. 

分 类 号：U113[交通运输工程] O224[理学—运筹学与控制论]