As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In order to properly solve the problems of scattered data and difficult information updating in urban road information management, the cluster search scheme is used to improve the management efficiency of road planning. This paper takes the urban disaster prevention as example, and reveals the contradiction between the existing urban form in several cases. To shorten the average waiting time and working distance of stored vehicles, the corresponding mathematical model of cluster search is established by investigating the collected data and extracting the data. Then combining with the actual garage layout and taking the distance of stacker, the average waiting time of customers and the average waiting queue length as the measurement index, the simulation program is compiled with MATLAB, and the effects of different garage layout modes on the overall operation efficiency under a certain storage capacity are analyzed and compared. The results show that cluster search can shorten the running distance by about 50% and the average waiting time and queue length by about 31% and 76% respectively.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.