Finding safe routes to school using optimisation methods

Finding safe routes to school using optimisation methods

0.00 Avg rating0 Votes
Article ID: iaor20097469
Country: United Kingdom
Volume: 161
Issue: 2
Start Page Number: 117
End Page Number: 127
Publication Date: Jun 2008
Journal: Proceedings of the Institute of Civil Engineers: Municipal Engineer
Authors: ,
Keywords: education, heuristics: genetic algorithms, urban affairs
Abstract:

Encouraging children to walk to school has become an important issue. Government agencies are therefore keen to reduce child pedestrian casualties associated with the school journey. One way forward is to provide each catchment area with a system of designated routes that minimise road accident risk for pupils on foot. However, there is no accepted modelling procedure for identifying safe routes. This paper reviews the obstacles and assesses the potential for ad hoc solution methods, using the road network surrounding a primary school in north London as a test bed. Solutions close to the optimum were obtained by transforming the network to a simpler form and by modifying the objective function, which effectively linearised the problem. This paper assesses the sensitivity of the results to various assumptions and uncertainties in the data, and concludes with a brief comment on the prospects of finding safe routes on a routine basis at local authority level.

Reviews

Required fields are marked *. Your email address will not be published.