Research on the Bias Sampling RRT Algorithm for Supermarket Chain Distribution Routes under the O2O Model
DOI:
https://doi.org/10.54097/fcis.v5i2.12444Keywords:
Bias Sampling RRT, Distribution Routes, O2O ModelAbstract
The purpose of this article is to propose the Bias Sampling RRT algorithm and use it as an optimization algorithm for supermarket chain distribution routes under the O2O model. As a retail store in the transformation and upgrading of chain stores, the actual terrain factors in distribution directly affect the timely delivery of goods from online to offline. The Bias Sampling RRT algorithm, as a path search method for time window vehicle routing problems, can find the optimal path that meets time window constraints. The applicability and effectiveness of the Bias Sampling RRT algorithm have been demonstrated through map simulation calculations. The simulation results show that compared with the RRT method, the Bias Sampling RRT algorithm has a shorter distribution path and shorter distribution time. This method is very suitable for the distribution activities of chain supermarkets or single store retail enterprises in the complex transformation and upgrading of actual terrain.
Downloads
References
Desaulniers, G., Desrosiers, J., Solomon, M.M.: Time window constraints in vehicle routing and scheduling. Networks 14(4), 545-565 (1984).
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research 35(2), 254-265 (1987).
Cordeau, J.F., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105-119 (1997).
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search algorithm for the vehicle routing problem with time windows. Transportation Science 37(1), 21-38 (2003).
Ghiani, G., Laporte, G., Musmanno, R.: Introduction to logistics systems planning and control. John Wiley & Sons (2004).
Golden, B.L., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges. Springer Science & Business Media (2008).
LaValle, S.M.: Rapidly-exploring random trees: A new tool for path planning. Technical Report, Computer Science Department, Iowa State University (1998).
Kuffner Jr, J.J., LaValle, S.M.: RRT-connect: An efficient approach to single-query path planning. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), vol. 2, pp. 995-1001 (2000).
Lavalle, S.M., Kuffner Jr, J.J.: Randomized kinodynamic planning. The International Journal of Robotics Research 20(5), 378-400 (2001).
Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. Robotics Science and Systems Conference (RSS) (2010).


