Optimal Location of Compressed Natural Gas (CNG) Refueling Station Using the Arc Demand Coverage Model

In this paper a model that locates Compressed Natural Gas (CNG) refueling stations to cover the full volume of vehicle flows is developed and applied. The model inputs consist of a road network include nodes and arcs, the volume of vehicle flows between each pairs of origin and destination nodes, also some assumptions are considered as follows, refueling stations locating hierarchy, road network arcs hierarchy, crisp demand based on the volume of arc demands, road network arc flows, the potential location for refueling stations are limited and the refueling stations are capacitated. This paper extends Arc Demand Coverage Problem (ADCP) to determine locations for constructing CNG refueling stations at the considered potential locations such that the flow demands are fully met and the cost function is minimized. The cost function is positive and non-decreasing function of the located facility number. A heuristic algorithm is applied to solve ADCP.

[1]  C. Revelle,et al.  A Lagrangean heuristic for the maximal covering location problem , 1996 .

[2]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[3]  M. Kuby,et al.  A Model for Location of Capacitated Alternative-Fuel Stations , 2009 .

[4]  T. Lowe,et al.  A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices , 1986 .

[5]  Oded Berman,et al.  The generalized maximal covering location problem , 2002, Comput. Oper. Res..

[6]  E. Minieka.  The m-Center Problem , 1970 .

[7]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[8]  Justo Puerto,et al.  A multiperiod two-echelon multicommodity capacitated plant location problem , 2000, Eur. J. Oper. Res..

[9]  M. J. Hodgson.  A Flow-Capturing Location-Allocation Model , 2010 .

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

[11]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[12]  Reza Barkhi,et al.  A REVIEW OF COVERING PROBLEMS IN FACILITY LOCATION. , 1993 .

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

[14]  A. Kolen.  Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[15]  Kenneth E. Case,et al.  On Covering Problems and the Central Facilities Location Problem , 2010 .

[16]  Oded Berman,et al.  Optimal Location of Discretionary Service Facilities , 1992, Transp. Sci..

[17]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[18]  Kenneth E. Rosing,et al.  An Empirical Investigation of the Effectiveness of a Vertex Substitution Heuristic , 1997 .

[19]  Michael Kuby,et al.  Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs , 2007 .

[20]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[21]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[22]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[23]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[24]  Michael Kuby,et al.  The flow-refueling location problem for alternative-fuel vehicles , 2005 .

[25]  Charles ReVelle,et al.  The Hierarchical Service Location Problem , 1982 .