Skip to main content
SpringerLink
Log in

A MIP model for scheduling India’s General elections and police movement

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

Conducting the General Elections for the 543 members of the Parliament of India across the 833 thousand polling stations spread over the 35 States is a mammoth exercise. Deployment of the Central Police Forces is essential to complement the role of the State police during the elections. However paucity of Central Police Forces necessitates the conduct of elections over stages. This paper proposes and demonstrates a MIP model to (a) schedule the elections with a minimum number of stages (b) sourcing the appropriate number of security personnel from the most convenient Central Police Forces bases (c)scheduling movement of security personnel between stages with the objective of minimizing men-miles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Scharff M. Policing Election Day: Vulnerability Mapping in India 2006–2009. Innovations for successful societies. 2011. Available at: http://www.princeton.edu/successfulsocieties/content/data/policy_note/PN_id173/Policy_Note_ID173.txt. Accessed April 6, 2012.

  2. National Crime Records Bureau. Crime in India 2009 Statistics. New Delhi 2010.

  3. Stefan Harrendorf MHM). International statistics on crime and justice. Helsinki 2010.

  4. Election Commission of India. Lok sabha election 2009-reinforcing indian democracy. New Delhi: Election Commission of India; 2009.

  5. Gilbert, K.C., Hofstra, R.B.: Multidimensional assignment problems. Decision Sciences 19(2), 306–321 (1988)

    Article  Google Scholar 

  6. Pierskalla, W.P.: The multidimensional assignment problem. Operations Research 16, 422–431 (1968)

    Article  Google Scholar 

  7. Gilbert KC, Hofstra RB, Bisgrove R. An algorithm for a class of three-dimensional assignment problems arising in scheduling operations. Inst Ind Eng Trans. 1987:29–33.

  8. Burkard, R.E.: Selected topics on assignment problems. Discrete Applied Mathematics. 123, 257–302 (2002)

    Article  Google Scholar 

  9. Pentico, D.W.: Assignment problems: a golden anniversary survey. European Journal of Operational Research. 176, 774–793 (2007)

    Article  Google Scholar 

  10. Franz, L.S., Miller, J.L.: Scheduling medical residents to rotations: solving the large scale multiperiod staff assignment problem. Operations Research 41(2), 269–279 (1993)

    Article  Google Scholar 

  11. Carraresi, P., Gallo, G.: A multi-level bottleneck assignment approach to the bus drivers’ rostering problem. European Journal of Operational Research 16(2), 163–173 (1984)

    Article  Google Scholar 

  12. Yamada, T., Nasu, Y.: Heuristic and exact algorithms for the simultaneous assignment problem. European Journal of Operational Research 123(3), 531–542 (2000)

    Article  Google Scholar 

  13. Tomlin, J.A.: Minimum cost network flows. Operations Research 14(1), 45–51 (1966)

    Article  Google Scholar 

  14. Kennington, J.L.: A survey of linear cost multicommodity network flows. Operations Research 26(2), 209–236 (1978)

    Article  Google Scholar 

  15. Longitude and Latitude Calculator. Available at: http://www.ig.utexas.edu/outreach/googleearth/latlong.html. Accessed April 30, 2013.

Download references

Acknowledgement

The author is most grateful to the referees who suggested changes that have improved the paper.

Author information

Authors and Affiliations

  1. Indian Institute of Management Calcutta, Joka, Diamond Harbour Road, Kolkata, India

    Bodhibrata Nag

Authors
  1. Bodhibrata Nag
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bodhibrata Nag.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(PDF 1152 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nag, B. A MIP model for scheduling India’s General elections and police movement. OPSEARCH 51, 562–576 (2014). https://doi.org/10.1007/s12597-013-0160-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-013-0160-3

Keywords

Search

Navigation