metehaninal/GTU-Graduation-Project2-Location-Allocation-models-for--police-vehicles: Initial Release

This record contains the source code and experimental implementation developed as part of a Graduation Project at Gebze Technical University, Department of Computer Engineering. The study focuses on location-allocation optimization models for police patrol vehicles on a road network. The primary goal is to determine optimal deployment locations for patrol vehicles such that full network coverage is guaranteed while maximizing police presence, visibility, and operational efficiency under legal response-time constraints. The project is inspired by the academic work:Adler, N., Hakkert, A. S., Kornbluth, J., Raviv, T., & Sher, M. (2014),"Location-allocation models for traffic police patrol vehicles on an interurban network",Annals of Operations Research. Four Integer Linear Programming (ILP) models are implemented and analyzed:1) A conspicuous-coverage trade-off model based on traffic volume,2) A model incorporating calls-for-service and travel times,3) A priority-based coverage model with varying response-time requirements,4) A multi-shift dynamic location-allocation model accounting for deterrence effects. Road network data is obtained from OpenStreetMap and abstracted using graph-based methods. The optimization models are implemented in Python using open-source libraries, and results can be explored through an interactive interface. This archive is automatically generated from the corresponding GitHub repository via Zenodo integration to ensure reproducibility and long-term preservation.