配送中心的运输路径优化研究图文精.docx

1、配送中心的运输路径优化研究图文精武汉理工大学硕士学位论文配送中心的运输路径优化研究 姓名:陈韦志申请学位级别:硕士 专业:系统工程指导教师:刘舒燕 20071101武汉理工大学硕士学位论文摘要随着市场经济的快速发展,作为“第三利润源泉”的物流对经济活动的影响日益 明显,越来越引起人们的重视。在现代物流中,配送是一个与消费者直接相连的重要 环节,其体现了企业的核心竞争力。而配送中心的运输路径如何优化一直是学者、 咨询机构和企业关注的热点问题。通过对运输路径优化,我们可以提高企业的运作 效率,降低配送成本,实现物流科学化。本文章基于管理学、运筹学、数学、系统科学相关理论,在充分调查研究的基 础上,

2、综合运用动态规划建模方法、蚁群优化算法、节约里程算法等,完成配送中 心的运输路径优化的研究。动态规划建模方法主要用于解决直送式配送运输路径优 化,蚁群优化算法、节约里程算法用于解决分送式配送运输路径优化。首先,本文章引入物流、配送以及配送中心的概念,简单的介绍了现代物流的 基本理论。对配送的叙述,本文详细的叙述了配送的主要流程以及配送与运输之间 的关系。配送中心作为实现配送功能的物流场所,文章简单的介绍了配送中心的分 类,重点阐述了配送中心的作业环节,最后提出了配送运输路径的优化概念以及优 化原则.其次,文章从两个角度分析研究配送中心的运输路径优化问题:一个是直 送式配送运输,另外一个是分送式

3、配送运输。在直送式配送运输中,路径的选择紧 紧围绕配送网络展开讨论,主要是求解基于网络确定和网络不确定两种情况下的最 短运输路径。在网络不确定情况下,通过对配送网络的构建,提出了基于动态规划 思想的最短路径搜索算法。在分送式配送运输中,文章从考虑最短的运输路径与最 少的运输费用两个角度建立车辆路径规划(VF2模型。对于其模型的求解算法,文 章引入了蚁群算法,并将蚁群算法与其它优化算法做了比较。说明其优点所在。最 后,文章运用改进的蚁群算法求解车辆路径规划模型,该算法的丰要特点是正反馈 和并行性,正反馈使得该算法很快发现较好解,并行性使得该算法易于实现并行计 算。针对该算法易陷入局部最优解、求解

4、速度较慢的缺陷,本文通过对蚁群算法的改 进和调整,构造出最大一最小蚁群算法。最大一最小蚁群算法加快了解的收敛速度, 实例验证该算法能更快地收敛到全局最优解,体现了改进蚁群算法的相对优越性。关键词:运输路径优化,分送式配送,车辆路径规划,蚁群算法武汉理工大学硕:I:学位论文AbstractFollowing the fast development of market economy,asThe third sourer of profit”, the logistics is day by day obvious to the economic activity influence,more

5、and more brings to peoples aRenfion.In modem logistics,distribution is an important link directly connecting with cousumem,and embodies the core competencies of enterprise. However,how to optimize the transport path of distribution center.?this problem has been a hot topic which the scholar、consulta

6、tion organization and the enterprise concern.Through the optimization of the transport path,we can improve the operational efficiency of enterprise and reduce distribution costs,achieve scientific logistics.This paper that bused on the management,operations researdl,mathematics,science and related t

7、heory of systems science,completes the study of the optimization of the transport path on the basis of complete investigation,using dynamic programming,ACO algorithm,Saving mileage Algorithmand so on comprehensively.Dynamic programming is used to solve direct-distribution.ACO algorithm and髓ving mile

8、age&ire used to solve distributiondistribution.Firstly,this paper introduces the Iogistics,distribution and the distribution center, and simple introduced the basic theory of modem Iogistics.To narrate the distribution,this article in detail narrates the process of distribution、the relationship betw

9、een distribution and仃ansport.Distribution center is a logistics place realizing distribution function,and this article simply introduces categories of distribution center, with emphasis narrates the work link of distribution center,and finally putts forward the optimization conceptand the principle

10、of optimization about distribution Bansport path. Secondly,this paper analyzes and studies the problem of optimization about distribution centermmspon path from two perspectives:one is direct-distribution and the other is distributiondistribution.On directdistribution,the choice of path closely focu

11、s on the distribution network,our main Solving is the shortest Transport path in both certain and uncertain network.On uncertain networL through the construction of distribution network,we have proposed Shortest Path Search algorithm Based on the thinldng of dynamic programming.On distribution-distr

12、ibution,this paper establishes vehicle routing problem model fromtwo perspectives:one is shortest transport path;the other is 武汉理工大学硕士学位论文minimum transport costs.On the algorithm solving model,this paper introduces ACO algorithm,and makes a comparison between the AC0algorithm and other optimization

13、algorithm,then points out its advantages.Finally,this paper USeS improved ACO algorithm to solve vehicle routing problem model.ACO algorithmmain features are positive feedback and parallelism.Positive feedback makes the algorithm quickly discovered a beret solution,and parallelism makes the algorith

14、m easy to achieve parallel computing.But the algorithm easily Uapped into local optimal solution and solved the problem more slowly,this paper constructed MaxMin ACO algorithm through the improvementand adjustment of AC0algorithm.MaxMin AC0algorithm Speeds up the convergence speed of Solution,and it

15、 can be faster convergence to the global optimal solution that has been verified by specific examples.an this reflects the relative superiority of improved ACO algorithm.Key words:the optimization of the transport path,distributiondistribution, vehicle routing problem,ACO algorithmIn此页若属实.请研究生及导师签名,

16、并蓑订在掌位论文的摘要前。独创性声明本人声明,所呈交的论文是我个人在导师指导下进行的研究工作及取得的研究成 果。据我所知,除了文中特别加以标注和致谢的地方外,论文中不包含其他人已经发表 或撰写过的研究成果,也不包含为获得武汉理工大学或其它教育机构的学位或证书而使 用过的材料。与我一同工作的同志对本研究所做的任何贡献均已在论文中作了明确的说 明并表示了谢意。研究生(签名:聿埠L醐卫生 关于论文使用授权的说明本人完全了解武汉理工大学有关保留、使用学位论文的规定,即:学校有权保留送 交论文的复印件,允许论文被查阅和借阅;学校可以公布论文的全部内容,可以采用影 印、缩印或其他复制手段保存论文.(保密的论文在解密后应遵守此规定一c:强篁洲弹簪期掣武汉理工大学硕士学位论文1.1研究目的与意义1.I.1研究目的第1章导论近年来,随着市场经济发展步伐的加快,作为“第三利润源泉”的物流对经济 活动的影响日益明显,越来越引起人们的