摘要
运用运筹学中的动态规划算法研究实际生活中的配送线路优化问题。通过实际调研,绘制城市道路的网络图,并通过调查获得正常情况下的交通量数据,进而通过相应的方法计算出时间并赋予网络图时间权值;通过调查赋予网络图中距离权值,分别计算出配送时间的最优线路及配送路线的最优线路,并比较说明相应的实际问题。
The optimization of distribution routes in the real life is analyzed through the dynamic programming algorithm of operational research. By virtue of practical research, the network graph of urban road is mapped, and the volume of traffic data is obtained through surveys under normal circumstances. And then the corresponding method is adopted to calculate time, and offer time and distance weights to the network graph through the survey. Optimal routes of delivery time and deliver paths are calculated respectively, and then have them compared to solve the corresponding problems.
出处
《重庆交通大学学报（自然科学版）》
CAS
2008年第4期647-650,共4页
Journal of Chongqing Jiaotong University(Natural Science)
基金
重庆市教委自然科学基金项目(KJ070410)
关键词
物流
动态规划
线路优化
交通量
网络图
logistics
dynamic programming
route optimization
traffic amount
network graph
