Font Size: a A A

Research On Split Delivery Vehicle Routing Optimization With Simultaneous Delivery And Pick-up And Time Windows Preference

Posted on:2022-08-15Degree:MasterType:Thesis
Country:ChinaCandidate:X X RenFull Text:PDF
GTID:2532307040467764Subject:Engineering
Abstract/Summary:PDF Full Text Request
With the development of economy,the logistics industry is developing towards high efficiency,high service quality and low cost,and "reducing cost and increasing efficiency" has become the pursuit goal of many logistics enterprises.Considering customer service time window,the number of vehicle service requirements and the pick-up and delivery demand of customers,split delivery vehicle routing problem with simultaneous delivery and pick-up and time windows preference is more closely to the actual need.It is the key to improve the core competitiveness of logistics enterprises to reasonably plan the customer service sequence of distribution vehicles and reduce the total cost of logistics distribution while meeting all the needs of customers.For the split delivery vehicle routing problem with simultaneous delivery and pick-up and time windows preference(SDVRPSDPTWP),firstly,the relationship between customer service time,customer satisfaction and penalty cost are analyzed,and the calculation formula of fuel consumption cost is analyzed and expounded.Secondly,the problem of SDVRPSDPTWP studied in this paper is described,and a mathematical model is built to minimize the sum of vehicle dispatch cost,time window penalty cost,fuel consumption cost and tally cost.Thirdly,according to the characteristics of the problem,a hybrid genetic-variable neighborhood search algorithm is designed to solve the problem combining the genetic algorithm with variable neighborhood search algorithm.Since this paper has time window and the objective function has time penalty cost,the temporal and spatial distance is introduced into the algorithm.The logistic mapping equation and nearest neighbor insertion method are used to generate the initial population.The variable neighborhood search strategy and adaptive search strategy are designed to improve the search performance of the algorithm.Because the problem studied in this paper allows the customer demand split,according to the study of the problem design split criteria.Design time optimization strategy to reduce the waiting time of delivery vehicles.Finally,several groups of different types of example data are tested to verify the effectiveness of the proposed model and algorithm.The research results not only deepen and expand the theory research of vehicle routing problem,but also provide a scientific and reasonable method for logistics enterprises to draw up the vehicle scheduling plan.
Keywords/Search Tags:Vehicle Routing Problem, Time Windows Preference, Split Delivery, Simultaneous Pick-up and Delivery, Hybrid Genetic-Variable Neighborhood Search Algorithm
PDF Full Text Request
Related items