| 周期性时变网络中粮食物流优化探讨 |
| |
| 引用本文： | 王春晓,谷存昌.周期性时变网络中粮食物流优化探讨[J].河南科学,2010,28(10):1238-1242. |
| |
| 作者姓名： | 王春晓 谷存昌 |
| |
| 作者单位： | 河南工业大学,郑州,450001 |
| |
| 基金项目： | 河南工业大学科研基金项目 |
| |
| 摘 要： | 粮食是国家重要的经济和战略物资,粮食调运问题是国家粮食管理部门和粮食企业急需解决的重要问题.针对粮食运输的特点,提出多周期时变网络中物流调度的最优化问题,从数学模型及算法设计方面开展研究,建立基于(0,1)整数规划的周期性时变网络最短路问题的数学模型.为便于求解,将其转化为图论模型,从而得到多项式时间算法.
|
| 关 键 词： | 粮食物流 周期性 时变 最优化问题 最短路 算法 |
Provisions Transportation Problem with Periodic Time-Varying |
| |
| Wang Chunxiao,Gu Cunchang.Provisions Transportation Problem with Periodic Time-Varying[J].Henan Science,2010,28(10):1238-1242. |
| |
| Authors: | Wang Chunxiao Gu Cunchang |
| |
| Institution: | Wang Chunxiao,Gu Cunchang (Henan University of Technology,Zhengzhou 450001,China) |
| |
| Abstract: | Grain is the country's important economic and strategic materials.The provisions transportation problem is an important issue for the state's grain management departments and grain enterprises needing to be urgently resolved.Therefore,by considering the characteristics of provisions transportation,this paper starts from the periodic time-varying network with the optimization problem and sets up models and algorithms.Then the the shortest time path model based on(0,1)linear programming was got.For solving it... |
| |
| Keywords: | provisions transportation periodic time-varying optimization problems the shortest path algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
