| With the development of the O2 O,local-life O2 O as a new business model provides goods or services to residents of the local city or region.This model provides a more convenient and quick way to consume,changing people's consumption habits.At the same time,O2 O platform is helpful for businesses to attract customers and improve business efficiency,which has attracted the attention of many enterprises.The rapid growth of take-out O2 O in 2015 caused a peak development of instant logistics.In recent years,local-life O2 O services such as home delivery,express delivery,and fresh distribution have gradually emerged,promoting the further development of instant logistics.The development of instant logistics has promoted the diversification of the logistics industry and the diversification of logistics service methods.The development of instant logistics meets the distribution needs of O2 O services that are discrete and time-efficient,and provides a guarantee for the further development of O2 O.Vehicle routing problem,as a kind of main combinatorial optimization problem,has attracted wide attention from academia.In the context of O2 O and instant logistics,factors such as dynamic demand and time window constraints make routing difficult.How to effectively solve the problem of dynamic vehicle routing has gradually become a research hotspot in the theoretical world.The instant delivery problem studied in this article is a dynamic pickup and delivery problem with time windows.First the characteristics,market scale and development status of O2 O and instant logistics are discussed,and the purpose and significance of studying dynamic vehicle routing problems are pointed out.Then the latest related research and related theoretical basis is introduced.Through the waiting strategy,the dynamic pickup and delivery problem with time windows(DPDPTW)is modeled as a series of static pickup and delivery problems with time windows(PDPTW).In the model,the characteristics of instant delivery are considered.Because the delivery person is constantly moving and the return of the delivery person is not considered,the current position of the delivery person is set to a virtual garage,and the distance from the last delivery point to the garage is defined as 0.The adaptive large neighborhood search algorithm(ALNS)is used for the solution.The constructor of the initial solution is added to the algorithm.This function first arranges the pickup and delivery points of the historical assigned orders into the path,and performs a neighborhood search based on the initial solution and the new orders.By testing benchmark instances and conducting experimental analysis,the results show that ALNS can obtain higher-quality solutions at a lower time cost.Finally,a numerical simulation program is designed and implemented to carry out numerical simulation in a dynamic environment.The simulation results show that ALNS contributes to the improvement of distribution efficiency.The research is theoretically an extension of the previous research field of vehicle routing problems and their application of algorithms.It is an in-depth study of real scenarios.Using real data as an instance for numerical simulation adds a realistic research approach to the study of dynamic vehicle routing algorithms;analyzing actual data provides a reference for the expansion of dynamic benchmark instances.This article has certain practical significance for instant logistics companies.Performing numerical simulation is convenient for testing emerging business scenarios,accelerating the progress of experiments or verification,deepening the understanding of researchers and business personnel on real business,and may find problems in the business in advance.It is used to optimize business.The use of intelligent algorithms in actual dispatching helps to solve the problem of optimizing the actual distribution path,improves distribution efficiency,supports distribution management,and improves the quality of logistics services,thereby increasing corporate profits. |
PDF Full Text Request