.png){kind=icon}
返回
Infrastructure development for conversion to environmentally friendly fuel
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00309-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. Colton. Decision Sciences 19 (1988) 4901 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. Cohort, European Journal of Operational Research 21 (1985) 189] to accommodate multiple sources and destinations. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
facility location
environmental protection
integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION
PREAI
分享收藏分享收藏
查看更多内容