The Inmate Transportation Problem and Its Application in the PA Department of Corrections
The Inmate Transportation Problem (ITP) is a common complex problem in any correctional system. We develop a weighted multi-objective mixed integer linear optimization (MILO) model for the ITP. The MILO model optimizes the transportation of the inmates within a correctional system, while considering all legal restrictions and best business practices. We test the performance of the MILO model with real datasets from the Pennsylvania Department of Corrections (PADoC) and demonstrate that the inmate transportation process at the PADoC can significantly be improved by using operations research methodologies.
- 1.Applegate DL, Bixby RE, Chvátal V, Cook WJ. The traveling salesman problem: a computational study. In: Princeton series in applied mathematics; 2007.Google Scholar
- 2.Cook WJ. In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton: Princeton University Press; 2014.Google Scholar
- 3.Crainic TG, Laporte G, editors. Fleet management and logistics. Springer; 1998.Google Scholar
- 8.Gurobi Optimization Inc: Gurobi optimizer reference manual. http://www.gurobi.com; 2016.
- 9.Li D, Plebani LJ, Terlaky T, Wilson GR, Bucklen KB. Inmate classification: decision support tool gives help to Pennsylvania Department of Corrections. Ind Eng. 2014;46(7).Google Scholar
- 11.Shahabsafa M, Terlaky T, Gudapati C, Sharma A, Plebani LJ, Wilson GR, Bucklen KB. The inmate assignment and scheduling problem and its application in the Pennsylvania Department of Corrections. 2018;48(5):467–483.Google Scholar
- 12.Walmsley R (2015) World prison population list. http://www.prisonstudies.org/sites/default/files/resources/downloads/world_prison_population_list_11th_edition_0.pdf. Accessed 27 June 2018.