首页 | 本学科首页   官方微博 | 高级检索  
     检索      

需求区间型运输问题的求解算法
引用本文:谢凡荣.需求区间型运输问题的求解算法[J].运筹与管理,2005,14(1):23-27.
作者姓名:谢凡荣
作者单位:南昌大学,数学系,江西,南昌,330047
摘    要:为了便于建立与需求区间型运输问题有关的决策支持系统,本给出了一个求解需求区间型运输问题的数值算法,证明了算法的理论依据,并举例说明算法的应用,该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点,大量数值实验表明该算法有较高的计算效率。

关 键 词:运筹学  运输问题  需求区间型运输问题  典则型运输网络  最小费用最大流
文章编号:1007-3221(2005)01-0023-05
修稿时间:2004年5月20日

An Algorithm for Solving the Transportation Problem With Interval of the Demands
XIE Fan-rong.An Algorithm for Solving the Transportation Problem With Interval of the Demands[J].Operations Research and Management Science,2005,14(1):23-27.
Authors:XIE Fan-rong
Abstract:For the convenience of decision-making supporting system related to the transportation problem with interval of the demands, a numerical algorithm is presented in this paper for solving the transportation problem with interval of the demands. The theory, on which the algorithm depends, is strictly proved. An example is given to demonstrate the use of the algorithm. The algorithm, which can find the optimal solution to the transportation problem with interval of the demands, has the merits to be easily programmed and of good convergence, and many numerical experiments verifies its great practicality and effectiveness.
Keywords:operations research  the transportation problem  the transportation problem with interval of the demands  the standard tansportation network  the minimal cost maximal flow
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号