A Model for Locating Park-and-Ride Facilities on Urban Networks Based on Maximizing Flow Capture: A Case Study of Isfahan, Iran

Traffic congestion is one of the main problems in large cities for which several approaches have been proposed. Park-and-ride is one of the best approaches that can remove traffic from the traffic network. Park-and-ride facilities are an important part of urban mass transit systems, effectively extending the service area and attracting commuters and other people who may not otherwise have used mass transit. However, its efficiency depends on its location in the urban network. In this research, we focus on travel time of shortest paths instead of the distance criterion for computing network traffic and develop a model for finding the best location(s) for siting park-and-ride systems so as to minimize the network traffic. The model is formulated based on population points, potential sites for park-and-ride establishment, and several Central Business District (CBDs). Then we present a Genetic algorithm that has been proved to be efficient in solving large size problems. Finally, the proposed model is used to locate park-and-ride facilities in the city of Isfahan, Iran. Copyright Springer Science+Business Media, LLC 2013