具有运输次序的运输问题研究  

A research on the transportation problem based on transport order

作　　者：吴唤群[1] 郭成[1] 

机构地区：[1]广州大学商学院,广东广州510006

出　　处：《广州大学学报（自然科学版）》2008年第5期1-4,共4页Journal of Guangzhou University:Natural Science Edition

摘　　要：研究了一类新的运输问题———具有运输次序的运输问题,建立了这类运输问题的网络流模型,证明了该模型的有效性,根据解最小费用流问题的思路设计出求解该模型的实用算法,同时通过定义修正权将负权转化为非负权,从而可以用Dijkstra算法找最短路,使算法得到改进。We researched a new transportation problem--the transportation problem based on transport order, established a network flow model based on the new transportation problem, proved its effect, and according to the minimum cost flow problem designed an effective algorithm to solve the problem. The predigest method which converts negative weight into positive weight is adopted, so that we can use Dijkstra＇ s algorithm to seek the shortest path. Therefore, the algorithm is promoted.

关 键 词：运输问题 运输次序 网络流模型 最小费用流 DIJKSTRA算法 

分 类 号：U11[交通运输工程]