CBPRS: A City Based Parking and Routing System
Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.
|Keywords||computer simulation, dynamic routing, information systems|
|JEL||Optimization Techniques; Programming Models; Dynamic Analysis (jel C61), Information and Product Quality; Standardization and Compatibility (jel L15), Business Administration and Business Economics; Marketing; Accounting (jel M), Management of Technological Innovation and R&D (jel O32), Transportation: Demand; Supply; Congestion; Safety and Accidents (jel R41)|
|Publisher||Erasmus Research Institute of Management (ERIM)|
Boehlé, J.L, Rothkrantz, L.J.M, & van Wezel, M.C. (2008). CBPRS: A City Based Parking and Routing System (No. ERS-2008-029-LIS). ERIM report series research in management Erasmus Research Institute of Management. Erasmus Research Institute of Management (ERIM). Retrieved from http://hdl.handle.net/1765/12467