Abstract
As cities grow, the number of complex underground parking garages with multiple entrances and exits is increasing. Randomly assigning parking spaces can lead to longer wait times for car owners during the parking and retrieval process and underutilization of resources. Therefore, allocating suitable parking spaces to car owners is crucial. This article proposes solutions for matching parking spaces and planning optimal routes for car owners in large underground parking garages based on their demands for shortest time, lowest price, and overall optimization. To reduce space and time complexity, a new heuristic decision optimization algorithm called Wolf Pack Search Algorithm (WSA) is proposed, which can solve multi-objective problems. WSA reduces redundant searches by using existing information to guide the search process. WSA simulates a wolf pack searching for food to find the optimal time cost for each intersection, reducing the space complexity of the data. Through information exchange and cooperative search, the wolf pack can find the optimal solution, abandoning redundant data. Compared with the ant colony algorithm, WSA has a significant advantage in space complexity and can meet car owners’ requirements for parking space matching efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lin, W.: Introducing an indoor path planning algorithm for the navigation grid. Surv. Mapp. Sci. 41(2), 39–43 (2016)
Pan, S., Chen, Y., Gao, Y., Li, W.: Research on vehicle scheduling problem with multiple service requirements with soft time window. J. Wuhan Univ. Technol. (Transp. Sci. Eng. Ed.) 44(06), 1123–1128 (2020)
Peng, L.: An analysis of the application of vehicle dispatching system in urban rail transit. Eng. Constr. Des. 20, 90–91 (2020)
Liu, Y., Du, J., Zhang, Q.: Comparison of the performance of the A * and Dijkstra algorithms based on path optimization. Mod. Electron. Technol. 40(13), 181–183+186 (2017)
Ran, D., Peng, F., Li, H.: Review of pathway planning studies based on the A * algorithm. Electron. Technol. Softw. Eng. 24, 11–12 (2020)
Schiffer, M., Hiermann, G., Rüdel, F., Walther, G.: A polynomial-time algorithm for user-based relocation in free-floating car sharing systems. Transp. Res. Part B Methodol. 143, 65–85 (2021)
Dellaert, N., Van Woensel, T., Crainic, T.G., Dashty, S.F.: A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach. Comput. Oper. Res. 127, 105154 (2021)
GroĂź, P.-O., Ehmke, J.F., Mattfeld, D.C.: Interval travel times for robust synchronization in city logistics vehicle routing. Transp. Res. Part E 143, 102058 (2021)
Zhang, D., Li, D., Sun, H., Hou, L.: A vehicle routing problem with distribution uncertainty in deadlines. Eur. J. Oper. Res. 292(1), 311–326 (2020)
Shi, Y., Zhou, Y., Ye, W., Zhao, Q.Q.: A relative robust optimization for a vehicle routing problem with time-window and synchronized visits considering greenhouse gas emissions. J. Clean. Prod. 275, 124112 (2020)
Wang, H., Yin, P., Zheng, W., et al.: Mobile robot path planning based on the improved A~ * algorithm and dynamic window method. Robotics 42(3), 346–353 (2020)
Wang, H., Yin, P., Zheng, W., et al.: Path planning for mobile robots based on improved A~* algorithm and dynamic window method. Robotics 42(3), 346–353 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Dou, N., Lian, Z., Guo, C. (2024). Parking Space Matching and Path Planning Based on Wolf Feeding Decision Algorithm in Large Underground Garage. In: Li, J., Zhang, B., Ying, Y. (eds) 6GN for Future Wireless Networks. 6GN 2023. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 553. Springer, Cham. https://doi.org/10.1007/978-3-031-53401-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-53401-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53400-3
Online ISBN: 978-3-031-53401-0
eBook Packages: Computer ScienceComputer Science (R0)