Article ID: | iaor201110101 |
Volume: | 48 |
Issue: | 1 |
Start Page Number: | 215 |
End Page Number: | 232 |
Publication Date: | Jan 2012 |
Journal: | Transportation Research Part E |
Authors: | Keskin Burcu B, Li Shirley (Rong), Steil Dana, Spiller Sarah |
Keywords: | programming: integer, heuristics: tabu search |
In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of highway spots with high frequencies of crashes (hot spots). We develop a specific mixed integer linear programming model for this problem under time feasibility and budget limitation. We solve this model using local and tabu‐search based heuristics. Via extensive computational experiments using randomly generated data, we test the validity of our solution approaches. Furthermore, using real data from the state of Alabama, we provide recommendations for (i) critical levels of coverage; (ii) factors influencing the service measures; and (iii) dynamic changes in routes.