Research on Intelligent Routing for Campus Library Deliveries Based on Simulated Annealing Algorithm

Authors

  • Peidong Xing
  • Kaiyue Meng
  • Na Min

DOI:

https://doi.org/10.54097/bdc6cy13

Keywords:

VRPSPD, Campus Library Deliveries, Simulated Annealing, Floyd.

Abstract

The intelligent delivery module for campus libraries is crucial in the construction of smart campuses. The use of delivery robots for efficient and convenient book delivery has increasingly become an important means to enhance the borrowing experience of teachers and students and to improve the operational efficiency of libraries. Based on the Simulated Annealing and Floyd algorithms, this paper first calculates the shortest distances from each building to the library. Using whether the robot passes through a building as the decision variable, a mathematical model is established with the objective of minimizing the total travel distance, while considering constraints such as robot capacity, book borrowing and returning demands, and the requirement that each building is served only once. Finally, simulation experiments are conducted to solve for the specific travel routes of the delivery robot using the SA algorithm, resulting in an optimal path diagram. Through simulation experiments, it verifies that the model has strong global search ability and ability to adapt to complex problems. At the same time, compared with other traditional delivery methods, the efficiency of the model has been significantly improved, showing the superior optimal solution approximation ability of the SA algorithm and the characteristics of jumping out of the local optimal for many times.

Downloads

Download data is not yet available.

References

[1] Dantzig G.B., Ramser J.H. The Truck Dispatching Problem [J]. Management Science, 1959, 6: 80-91.

[2] Eksioglu B., Vural A.V., Reisman A. The vehicle routing problem: A taxonomic review [J]. Computers and Industrial Engineering, 2009, 57(4): 1472-1483.

[3] Lin C., Choy K.L., Ho G.T.S., Chung S.H., Lam, H.Y. Survey of Green Vehicle Routing Problem: Past and future trends [J]. Expert Systems with Applications, 2014, 41(4): 1118-1138.

[4] Braekers K., Ramaekers K., Nieuwenhuyse I.V. The vehicle routing problem: State of the art classification and review [J]. Computers and Industrial Engineering, 2016, 99: 300-313.

[5] Kucukoglu I., Dewil R., Cattrysse D. The electric vehicle routing problem and its variations: A literature review [J]. Computers and Industrial Engineering, 2021, 161: 107650.

[6] Konstantakopoulos G., Gayialis S., Kechagias E. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification [J]. Operational Research, 2022, 22: 2033-2062.

[7] Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points [J]. Transportation Research Part A: General, 1989, 23(5): 377-386.

[8] Ai T.J., Kachitvichyanukul V. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J]. Computers and Operations Research, 2009, 36(5): 1693-1702.

[9] Fan J. The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction [J]. Procedia Engineering, 2011, 15: 5284-5289.

[10] Sayyah M., Larki H., Yousefikhoshbakht M. Solving the vehicle routing problem with simultaneous pickup and delivery by an effective ant colony optimization [J]. Industrial Engineering and Management, 2016, 3: 15-38.

Downloads

Published

11-05-2025