Font Size: a A A

Research On Single-direction Vehicle Routing Problem Of Multi-distribution Center Based On Time Window

Posted on:2019-07-06Degree:MasterType:Thesis
Country:ChinaCandidate:Y P LuFull Text:PDF
GTID:2428330590465920Subject:Logistics engineering
Abstract/Summary:PDF Full Text Request
With the continuous development of science and technology and the continuous progress of the global economy,the logistics industry is growing and expanding all over the world.It has become a pillar industry of the economic development and occupies an important economic position.In the logistics industry chain,the vehicle routing problem is a very important link,and it is the key point of the continuous development of logistics.Vehicle routing problem is a typical combinatorial optimization problem,which is a hot topic and difficult point for many experts and scholars.The problem is mainly to optimize the delivery route in vehicle transportation service,and to achieve the optimization of objective function under certain restrictions.With the diversification of transportation service types and scholars' in-depth research,vehicle routing problem is more suitable for the real life distribution service.In the face of the distribution needs of today's situation,this paper introduces the problem of one-way vehicle routing based on time windows for multiple distribution centers.According to the actual vehicle distribution situation,the number of distribution centers,type and number of vehicles are taken into consideration,and vehicle distribution plan of each distribution center is established.From the perspective of customers,this paper also introduces the penalty function of soft time windows into the objective function model,so as to meet the requirements of customers for vehicle delivery time and quality,improve the competitiveness of logistics industry,and have strong theoretical value and practical significance.This paper first introduces the basic concept and extended problem of vehicle routing problem,briefly introduces the basic algorithms,selects particle swarm optimization algorithm as the solution algorithm,and briefly describes the basic principle of the algorithm,and analyzes the parameters involved.Then,according to the domestic and foreign research status of vehicle distribution problem,this paper puts forward a oneway vehicle routing problem based on time window for multi-distribution center,establishes the mathematical model.Besides,the corresponding multi-objective particle swarm optimization algorithm is designed for the mathematical model.Finally,the problem model and multi-objective particle swarm optimization algorithm are used to solve the numerical examples.By analyzing the effects of population size and vehicle type on the results of the numerical examples,the optimal parameter values are obtained.Finally,the optimal solution and path of the multi-objective optimization problem are obtained,which verifies the validity of the model and algorithm of this paper and provides a theoretical support for the decision makers.
Keywords/Search Tags:vehicle routing problem, particle swarm optimization, time window, multiple distribution centers
PDF Full Text Request
Related items