联系我们

论文查询结果	返回搜索

论文编号：	6493
作者编号：	2120122528
上传时间：	2014/6/11 21:12:46
中文题目：	带有费用折扣和提前/拖期惩罚的第四方物流路径优化问题研究
英文题目：	Research on Fourth Party Logistics Earliness / Tardiness Routing Problem with Cost Discount
指导老师：	张建勇
中文关键字：	第四方物流；路径优化问题；遗传算法；费用折扣；提前/拖期惩罚
英文关键字：	The fourth party logistics; Routing problems; Genetic algorithm; Cost discount; Earliness / tardiness penalty
中文摘要：	在新世纪随着物流市场竞争愈发激烈，物流供应商必须从对自身的管理上升到对整个供应链的优化整合与合作方案的设计再造上。在这种条件下第四方物流应运而生，它将自身的资源与供应链上其他企业的具有互补性的不同资源、技术和能力进行整合与统一管理，能够为客户提供供应链的全面解决方案。第四方物流作为一种新型的经营模式得到众多学者的研究。在第四方物流背景下，路径问题由于要考虑第三方物流提供商的选择而变得更加复杂。目前国内外对第四方物流车辆路径选择问题研究较少。在现实中供应商为了增强自身的竞争能力，在承担多项运输任务时会给予客户一定的费用折扣。而供应链中的客户对运输时间通常都有一定的要求，因此在满足运输计划的同时要尽可能的按期交货，减少相应的违约成本。在分析了国内外对第四方物流路径优化问题的研究基础上，本文对带有费用折扣和提前/拖期惩罚的第四方物流路径问题进行分析与研究。本文所研究的内容具有重要的理论意义与实际意义。本文在回顾第四方物流、路径优化、遗传算法问题等相关理论知识的基础上，将带有费用折扣和提前/拖期惩罚的第四方物流路径问题分为两类问题进行研究，一类是单点到单点的问题，另一类是单点到多点的问题，随着目标节点的增多，解决问题过程所要考虑的因素增多，问题规模明显变大。对于这两类问题，使用简化的多重图来表示费用、时间、能力、信誉指标等约束，以费用最小化为目标进行数学建模。并针对此问题设计了遗传算法、贪婪算法和禁忌搜索算法，通过计算机对三个算法进行实现，对三个不同规模的算例进行模拟仿真，得到费用最少的最优路径和最优的供应商选择方案。通过对运行时间和运行结果两个指标进行综合分析，对比研究结果表明了遗传算法在解决带有费用折扣和提前/拖期惩罚的单点到单点、单点到多点的第四方物流路径优化问题方面的案例时，与贪婪算法和禁忌搜索算法相比具有一定的优势，更适合解决此类问题。
英文摘要：	In the new century, as the market competition increasingly fierce, logistics providers must change their manage style, from the management of their own to the optimization of the integration of the whole supply chain and cooperation on the scheme design of reengineering. Under this condition the fourth party logistics is more and more important. The fourth party logistics service provider will integrate and manage its own resources and other enterprises on the supply chain, such as complementary resources, technology and ability, to provide customers with comprehensive solution of supply chain. As a new business model, the Fourth party logistics studies by many scholars. Under the background of the fourth party logistics due to consider the choice of third party logistics service providers, routing problem, as more complex problems in the logistics service, become more complicated. The fourth party logistics vehicle routing problem is less both at home and abroad research. In order to enhance their competitive ability suppliers in reality will give customers a fee discount when taking multiple transportation task. And the customer in the supply chain usually have certain request for the transportation time, therefore while meet the transportation plan as far as possible the delivery on schedule, the corresponding default cost reduction. Based on the analysis of the path optimization problems of the fourth party logistics at home and broad, in this paper we discuss the fourth party logistics earliness / tardiness routing problem with cost discount. In this paper, the research content has important theoretical significance and practical significance. Based on the review of the fourth party logistics, the path optimization problem, genetic algorithm and other related theory, we discuss the fourth party logistics earliness / tardiness routing problem with cost discount into two categories, one is the single point to of single point problem, another kind is a single point to more points problem. Along with the target node increasing, we have more factors to consider, and the problem size is much bigger. For these two kinds of problems, we use multiple graphs, credibility index constraints such as price, time, ability, to make the mathematical model targeting on cost minimizing. What’s more, this paper designed the genetic algorithm, the greedy algorithm and tabu search algorithm for this problem. We use computer to program the three algorithm and simulation the three different scale examples. Then we get the best solution which cost the least money and the shortest time. The contrast research shows that the genetic algorithm has a certain advantage in solving the more complex single point to single point and the single point to points fourth party logistics earliness / tardiness routing problem with cost discount.
查看全文：	预览  下载(下载需要进行登录)