The Inmate Transportation Problem and Its Application in the PA Department of Corrections

  • Anshul Sharma
  • Mohammad Shahabsafa
  • Tamás TerlakyEmail author
Conference paper
Part of the Springer Proceedings in Business and Economics book series (SPBE)


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. 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. 2.
    Cook WJ. In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton: Princeton University Press; 2014.Google Scholar
  3. 3.
    Crainic TG, Laporte G, editors. Fleet management and logistics. Springer; 1998.Google Scholar
  4. 4.
    Dantzig GB, Ramser JH. The truck dispatching problem. Manag Sci. 1959;6(1):80–91.CrossRefGoogle Scholar
  5. 5.
    Dantzig GB, Fulkerson R, Johnson S. Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am. 1954;2(4):393–410.CrossRefGoogle Scholar
  6. 6.
    Fernández E, Laporte G, Rodríguez-Pereira J. A branch-and-cut algorithm for the multidepot rural postman problem. Transp Sci. 2017;52(2):353–69.CrossRefGoogle Scholar
  7. 7.
    Flood MM. The traveling-salesman problem. Oper Res. 1956;4(1):61–75.CrossRefGoogle Scholar
  8. 8.
    Gurobi Optimization Inc: Gurobi optimizer reference manual.; 2016.
  9. 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
  10. 10.
    Padberg M, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 1991;33(1):60–100.CrossRefGoogle Scholar
  11. 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. 12.

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Anshul Sharma
    • 1
  • Mohammad Shahabsafa
    • 1
  • Tamás Terlaky
    • 1
    Email author
  1. 1.Department of Industrial and Systems EngineeringLehigh UniversityBethlehemUSA

Personalised recommendations