| 邮政运输中邮路的规划和邮车调度问题的研究 |
| |
| 引用本文： | 金钢,师群昌,刘小麟.邮政运输中邮路的规划和邮车调度问题的研究[J].数学的实践与认识,2008,38(14). |
| |
| 作者姓名： | 金钢 师群昌 刘小麟 |
| |
| 作者单位： | 西南财经大学,经济信息工程学院,成都,610074 |
| |
| 摘 要： | 以邮政运输网络中运输效益最优为目标,建立了分步规划的图论模型.运用Floyd算法、Kruskal算法对模型进行分步求解并逐步优化,通过Matlab、Lingo、SPSS软件求解,提出三种优化邮路、降低邮车调度成本的方法.模型对解决邮路问题、单旅行商、多旅行商等相关问题具有普遍适用性,可以推广到点数更多TSP的问题.
|
| 关 键 词： | 邮路规划 分步规划图论模型 Floyd算法 Kruskal算法 |
The Research of Route Programming and Scheduling of the Postal Cars in the Postal Transportation Network |
| |
| JIN Gang,SHI Qun-chang,LIU Xiao-lin.The Research of Route Programming and Scheduling of the Postal Cars in the Postal Transportation Network[J].Mathematics in Practice and Theory,2008,38(14). |
| |
| Authors: | JIN Gang SHI Qun-chang LIU Xiao-lin |
| |
| Abstract: | We first establish a step-by-step planning graph theory model in the optimal target of the post-effective in transport network.Next,we solve the model step by step and optimize the answer gradually,using Floyd and Kruskal algorithm.And we get the answer by using Matlab,Lingo,SPSS software,then we give the postal route scheduling program in three different conditions.The step-by-step planning graph theory model has universal applicability in solving the problem of postal route schedule,TSP(Traveling Salesperson),MTSP(Multiple Traveling Salesperson),etc. |
| |
| Keywords: | transport network optimize step-by-step planning graph theory model Floyd algorithm Kruskal algorithm |
| 本文献已被 万方数据 等数据库收录！ |
|
