Infrastructure development for conversion to environmentally friendly fuel

An important concern for any nation wishing to convert to alternate, environmentally friendly energy sources is the development of appropriate fuel distribution infrastructure. We address the problem of optimally locating gas station facilities for developing nations, like India, which are in the process of converting from leaded to unleaded fuel. Importantly, a similar approach may be used in developed countries, which are in the process of converting to automobiles using hydrogen or electrical energy. An integer-programming model with the objective of balancing the perspectives of coverage and cost is presented for this facility location problem. Given the existing network of roads, the model considers the traveling population, the location of existing facilities and the cost of, either converting these facilities to carry unleaded fuel, or of installing new facilities in an attempt to minimize cost and simultaneously maximize coverage of population. We develop a heuristic solution procedure for this problem. The methodology is applied to data sets obtained from Current et al. [J.R. Current, C.S. ReVelle, J.L. Cohon, Decision Sciences 19 (1988) 490] representing the Ohio state limited access highway network, and to the Indian national highway network. Additionally, extensive simulations are carried out in order to examine where our approach compares with the maximum weighted spanning tree approach. This work extends the Maximum Covering/Shortest Path problem (MCSPP) formulated by Current et al. [J.R. Current, C.S. ReVelle, J.L. Cohon, European Journal of Operational Research 21 (1985) 189] to accommodate multiple sources and destinations. � 2002 Elsevier Science B.V. All rights reserved.

[1]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[4]  Hassan Abdulaziz,et al.  Environment and Planning , 1969 .

[5]  Arthur J. Swersey,et al.  An integer programming model for locating vehicle emissions testing stations , 1995 .

[6]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[7]  R. Church,et al.  The maximal covering location problem , 1974 .

[8]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[9]  S. Datta,et al.  An application of O.R. in micro-level planning in India , 1993, Comput. Oper. Res..

[10]  Jack Brimberg,et al.  MULTI-FACILITY LOCATION USING A MAXIMIN CRITERION AND RECTANGULAR DISTANCES. , 1994 .

[11]  John N. Hooker,et al.  Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[12]  Charles ReVelle,et al.  Review, extension and prediction in emergency service siting models , 1989 .

[13]  J. Current,et al.  Capacitated Covering Models , 1988 .

[14]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

[15]  J. Current,et al.  The Minimum‐Covering/Shortest‐Path Problem* , 1988 .

[16]  J. Current,et al.  The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .

[17]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .