IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v8y2010i1p110-126.html
   My bibliography  Save this article

A dynamic programming model for optimal distribution of police patrol efforts in Nigeria: a case study of Lagos State

Author

Listed:
  • Constantine Imafidon Tongo
  • A.B. Agbadudu

Abstract

This study employs a dynamic programming model built around five sensitive parameters that may influence crime preventive patrol effort to maximise the weighted probability of a patrol initiated intercept of random crimes in Lagos State of Nigeria. It compares the output of the dynamic programming model with those of the steepest ascent algorithm (which is another operations research tool) and the traditional methods of distributing police patrol efforts in Lagos State. Results reveal that the dynamic programming model produces two slightly different solutions that are optimally better than the steepest ascent algorithmic and traditional methods of allocation. Due to these findings, this study recommends that in order to bring about an effective reduction of crime waves in Nigeria, via police patrol efforts; the traditional method of allocation which is frequently based on socially unacceptable behaviours, like god fatherism, nepotism and sycophancy that characterise the socio-cultural landscape in Nigeria, must be replaced with operations research-based methods, such as dynamic programming, which is the pivot of this study.

Suggested Citation

  • Constantine Imafidon Tongo & A.B. Agbadudu, 2010. "A dynamic programming model for optimal distribution of police patrol efforts in Nigeria: a case study of Lagos State," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 8(1), pages 110-126.
    • Handle: RePEc:ids:ijores:v:8:y:2010:i:1:p:110-126
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=33106
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:8:y:2010:i:1:p:110-126. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.