Hierarchical location analysis for integrated area planning in rural India

An approach to hierarchical location analysis being developed for integrated area planning in microregions defined as Community Development Blocks throughout rural India is described. Preparation of a general settlement plan is the first of three steps that have evolved as the principal components of the plan making process. Step two deals individually with functional sectors of economic and social activity such as agriculture, industry, and health. Finally, step three involves the preparation of an integrated area development plan (IAP). The IAP has four purposes. The first purpose is to reconcile possible differences between sectoral plans as well as between the sectoral plan and the General Settlement Plan. The second purpose is to propose and justify plans on the basis of sectoral integration that have not been proposed in the individual sectoral plans. The third purpose is to summarize all the major planning proposals made and possibilities for additions and deletions. Finally, the fourth purpose is to summarize key information pertaining to implementation of the IAP. Equations are provided to explain the P-median algorithm used to choose candidates for service centers. 27 references.

[1]  B. Rouget Graph theory and hierarchisation models , 1972 .

[2]  K. S. Ramesh,et al.  Planning rural Growth centres for integrated area development. A study in Miryalguda Taluka. , 1971 .

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[5]  R. Roth,et al.  Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..

[6]  Pertti Järvinen,et al.  Technical Note - A Branch-and-Bound Algorithm for Seeking the P-Median , 1972, Oper. Res..

[7]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[8]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[9]  J. Y. Yen An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .

[10]  Allen J. Scott,et al.  Operational Analysis of Nodal Hierarchies in Network Systems , 1971 .

[11]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[12]  Ralph L. Keeney A Method for Districting Among Facilities , 1972, Oper. Res..

[13]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[14]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[15]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[16]  Peter Haggett,et al.  DETERMINATION OF POPULATION THRESHOLDS FOR SETTLEMENT FUNCTIONS BY THE REED-MUENCH METHOD , 1964 .