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

Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/421

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nag, Bodhibrata
dc.date.accessioned	2017-05-16T11:02:48Z
dc.date.accessioned	2021-08-26T03:57:27Z	-
dc.date.available	2017-05-16T11:02:48Z
dc.date.available	2021-08-26T03:57:27Z	-
dc.date.issued	2012-05-01
dc.identifier.uri	https://ir.iimcal.ac.in:8443/jspui/handle/123456789/421	-
dc.description.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	en_US
dc.language.iso	en_US	en_US
dc.publisher	INDIAN INSTITUTE OF MANAGEMENT CALCUTTA	en_US
dc.relation.ispartofseries	WORKING PAPER SERIES;WPS No. 697/ May 2012
dc.subject	OR in government	en_US
dc.subject	Scheduling	en_US
dc.subject	Logistics	en_US
dc.subject	MIP model	en_US
dc.title	A MIP model for scheduling India’s General Elections and police movement	en_US
dc.type	Working Paper	en_US
Appears in Collections:	2012

Files in This Item:

File	Description	Size	Format
wps_697.pdf		119.64 kB	Adobe PDF	View/Open