Locating road-vehicle refueling stations

被引:245
作者
Wang, Ying-Wei [1 ]
Lin, Chuah-Chih [1 ]
机构
[1] Natl Penghu Univ, Sch Serv Management, Dept Mkt & Logist Management, Magong, Penghu, Taiwan
关键词
Refueling station; Alternative-fuel vehicles; Facility location; Set cover; Mixed integer programming; SHORTEST-PATH; FUEL; MODEL; INFRASTRUCTURE; FACILITIES; CONVERSION; NETWORK;
D O I
10.1016/j.tre.2009.03.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
This study follows the concept of set cover for proposing a refueling-station-location model using a mixed integer programming method, based on vehicle-routing logics. Its solution uses only the easy-obtain data of the origin-destination distance matrix. A case study that focuses on the siting of refueling stations for achieving multiple origin-destination intercity travel via electric vehicles on Taiwan demonstrates the applicability of the model. Sensitivity analysis shows that greater vehicle range will result in a lower number of refueling stations that need to be sited. Range is crucial in reducing the facility-location costs, and therefore is an important issue in the development of alternative-fuel-vehicle technology. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:821 / 829
页数:9
相关论文
共 29 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2]   An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems [J].
Arostegui, Marvin A., Jr. ;
Kadipasaoglu, Sukran N. ;
Khumawala, Basheer M. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 103 (02) :742-754
[3]   Locating flow-capturing units on a network with multi-counting and diminishing returns to scale [J].
Averbakh, I ;
Berman, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 91 (03) :495-506
[4]   Infrastructure development for conversion to environmentally friendly fuel [J].
Bapna, R ;
Thakur, LS ;
Nair, SK .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (03) :480-496
[5]   OPTIMAL LOCATION OF DISCRETIONARY SERVICE FACILITIES [J].
BERMAN, O ;
LARSON, RC ;
FOUSKA, N .
TRANSPORTATION SCIENCE, 1992, 26 (03) :201-211
[6]  
*BUR EN, 2008, COMM PROM
[7]   Set covering approach for reconstruction of sibling relationships [J].
Chaovalitwongse, W. A. ;
Berger-Wolf, T. Y. ;
Dasgupta, B. ;
Ashley, M. V. .
OPTIMIZATION METHODS & SOFTWARE, 2007, 22 (01) :11-24
[8]  
Church R., 1974, Papers in Regional Science, V32, P101, DOI [10.1111/j.1435-5597.1974.tb00902.x, DOI 10.1007/BF01942293]
[9]   THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION [J].
CURRENT, JR ;
VELLE, CSR ;
COHON, JL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) :189-199
[10]  
Daskin M. S., 2011, Network and discrete location: Models, algorithms, and applications