A快递公司C站点车辆路径优化问题研究

发布时间：2018-08-06 09:56

【摘要】：车辆路径问题(Vehicle Routing Problem,VRP)是非确定多项式(NP)难题,它的解(路径的选择)对运输成本起着非常重要的影响,因而受到国内外学者的重视。车辆路径问题(VRP)是物流配送过程中的关键问题之一,随着电子商务的蓬勃发展,快递业称为现代物流高度发展的结果,它囊括了物流活动的基本要素,快递不仅以高科技的现代化运输手段傲视群雄,更以运输的物品重量轻、体积小、附加值高、能满足个性化需求、能满足时限要求等特点使其在物流中拥有得天独厚的位置。由于快递业的丰厚利润,当今众多传统的物流企业纷纷涉足快递行业。而合理,顺畅的快递网络是快递企业运营的根本,快递业的定义就是通过合理的快递网络把寄件方投寄的快件送到收件方手上,因此快递网络的路由布局也就决定着快递企业的运营成本、效率、服务速度、服务范围等一系列的核心竞争力水平,具有重要的战略意义。而快递网络的路由布局其中一方面就是反映在车辆的路径安排上。合理的车辆路径,不但能减少货物到达客户处的时间,降低车辆运输成本,改善车辆利用效率,实现资源的合理配置,有助于企业节约运输成本,而且能够帮助快递企业提升服务质量,把货物快捷准时地送达,让客户对货物的时限性要求得到满足,从而实现科学的物流管理目标。随着快递行业日益激烈的竞争,对VRP的研究因此具有更加实际意义。本文在认真研读国内外在VRP问题的文献基础上,对车辆路径问题进行研究分析,将车辆路径问题应用到快递企业的服务中,通过优化快递车辆的行车路径来降低企业的运营成本,增大货物派送的准时性来提高快递企业的服务水平。以A快递公司为例,研究了A快递公司在城市快递网络中的递送车辆服务的路径寻优问题,本研究设计了两阶段算法来求解A快递公司C站点的快递车辆路径问题。第一阶段,运用k-means快速聚类算法对C站点所有客户点进行路区的合理划分,第二阶段是对每一个路区内的客户点进行车辆路径的规划,以最少的车辆行驶里程数为主要目标,建立车辆路径问题的数学模型,然后运用遗传算法进行求解,最后用MATLAB实现该算法,计算出基于遗传算法的最优目标函数值与最优车辆路径方案,验证了算法在解决A快递公司C站点现存问题上的有效性。
[Abstract]:Vehicle routing problem (Vehicle Routing problem) is an uncertain polynomial (NP) problem. Its solution (path selection) plays a very important role in transportation cost, so it has been paid more attention to by scholars at home and abroad. Vehicle routing problem (VRP) is one of the key problems in the process of logistics distribution. With the rapid development of electronic commerce, express delivery industry is called the result of high development of modern logistics, which includes the basic elements of logistics activities. Express delivery not only with high-tech modern means of transportation, but also with the transport of light weight, small volume, high added value, can meet the personalized needs, can meet the requirements of the time limit and other characteristics make it have a unique position in the logistics. Due to the fat profits of express delivery industry, many traditional logistics enterprises have been involved in express delivery industry. And a reasonable and smooth express delivery network is the basis for the operation of express delivery enterprises. The definition of express delivery industry is to send the courier sent by the sender to the recipient's hand through a reasonable express delivery network. Therefore, the routing layout of express delivery network also determines the operating cost, efficiency, service speed, service scope and other core competitiveness levels of express delivery enterprises, which has important strategic significance. The routing layout of express delivery network is reflected in the routing of vehicles on one hand. A reasonable vehicle route can not only reduce the time of goods arriving at the customer, reduce the cost of vehicle transportation, improve the efficiency of vehicle utilization, realize the rational allocation of resources, but also help the enterprise to save the transportation cost. Moreover, it can help express enterprises to improve service quality, deliver goods quickly and punctually, and make customers meet the requirements of time limit of goods, thus realizing the scientific logistics management goal. With the increasingly fierce competition in express delivery industry, the research on VRP has more practical significance. On the basis of studying the literature of VRP problem at home and abroad, this paper studies and analyzes the vehicle routing problem, and applies the vehicle routing problem to the service of express delivery enterprise. By optimizing the driving path of express delivery vehicles to reduce the operating costs of enterprises and increase the punctuality of goods delivery to improve the service level of express delivery enterprises. Taking A express company as an example, this paper studies the route optimization problem of A express company's delivery vehicle service in the city express delivery network. In this study, a two-stage algorithm is designed to solve the express vehicle routing problem of A express company C site. In the first stage, the k-means fast clustering algorithm is used to reasonably divide the road area of all customer points in C station. The second stage is to plan the vehicle path for each customer point in the road area, taking the minimum vehicle mileage as the main goal. The mathematical model of the vehicle routing problem is established, and then the genetic algorithm is used to solve the problem. Finally, MATLAB is used to realize the algorithm, and the optimal objective function value and the optimal vehicle routing scheme based on the genetic algorithm are calculated. Verify the effectiveness of the algorithm in solving the existing problems of A express company C site.
【学位授予单位】：华南理工大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U116.2

【相似文献】