Heuristic approaches for the flow-based set covering problem with deviation paths

Transportation Research Part E: Logistics and Transportation Review

Volumn 72, Issue , 2014, Pages 144-158

  Li, Shengyin ^a   Huang, Yongxi ^a  

^a South   (United States)

Author keywords

Alternative fueling stations; Deviation paths; Greedy adding; Heuristic method; Mixed integer programming

Indexed keywords

APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING;

ALTERNATIVE FUELING STATION; DEVIATION PATH; FLOW BASED; FUELING STATION; GREEDY-ADDING; HEURISTICS APPROACHES; LOCATION MODELING; MIXED-INTEGER PROGRAMMING; MULTIPATH; SET COVERING PROBLEM;

HEURISTIC METHODS;

ALGORITHM; ALTERNATIVE FUEL; ELECTRIC VEHICLE; LINEAR PROGRAMING; NUMERICAL MODEL; OPTIMIZATION; TRANSPORTATION PLANNING;

SOUTH CAROLINA; UNITED STATES;

EID: 84910610989     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.10.013     Document Type: Article

References (44)

1. Balas E., Ho A. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math. Prog. Stud. 1980, 12:37-60.
2. Beasley J.E. A lagrangian heuristic for set-covering problems. Naval Res. Logist. NRL 1990, 37(1):151-164.
3. Berman O., Bertsimas D., Larson R.C. Locating discretionary service facilities, ii: maximizing market size, minimizing inconvenience. Oper. Res. 1995, 43(4):623-632.
4. Berman O., Larson R.C., Fouska N. Optimal location of discretionary service facilities. Transp. Sci. 1992, 26(3):201-211.
5. Bouamama S., Blum C., Boukerram A. A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 2012, 12(6):1632-1639.
6. Caprara A., Fischetti M., Toth P. A heuristic method for the set covering problem. Oper. Res. 1999, 47(5):730-743.
7. Caprara A., Toth P., Fischetti M. Algorithms for the set covering problem. Ann. Oper. Res. 2000, 98(1-4):353-371.
8. Chvatal V. A greedy heuristic for the set-covering problem. Math. Oper. Res. 1979, 4(3):233-235.
9. Daskin M.S. Network and Discrete Location: Models, Algorithms, and Applications 1995, John Wiley & Sons Inc, New York.
10. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1959, 1(1):269-271.
11. Farahani R.Z., Asgari N., Heidari N., Hosseininia M., Goh M. Covering problems in facility location: a review. Comput. Ind. Eng. 2012, 62(1):368-407.
12. Fisher M.L., Kedia P. Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. 1990, 36(6):674-688.
13. Frade I., Ribeiro A., Gonçalves G., Antunes A. Optimal location of charging stations for electric vehicles in a neighborhood in Lisbon, Portugal. Transp. Res. Rec. J. Transp. Res. Board 2011, 2252(1):91-98.
14. Frick M., Axhausen K.W., Carle G., Wokaun A. Optimization of the distribution of compressed natural gas (CNG) refueling stations: Swiss case studies. Transp. Res. Part D 2007, 12(1):10-22.
15. Haddadi S. Simple lagrangian heuristic for the set covering problem. Eur. J. Oper. Res. 1997, 97(1):200-204.
16. Haouari M., Chaouachi J.S. A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem. J. Oper. Res. Soc. 2002, 53(7):792-799.
17. Hodgson M.J. A flow-capturing location-allocation model. Geogr. Anal. 1990, 22(3):270-279.
18. Hodgson M.J., Rosing K.E., Leontien A., Storrier G. Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada. Eur. J. Oper. Res. 1996, 90(3):427-443.
19. Ip, A., Fong, S., Liu, E., 2010. Optimization for allocating BEV recharging stations in urban areas by using hierarchical clustering, Advanced Information Management and Service (IMS), 2010 6th International Conference on. IEEE, pp. 460-465.
20. Johnson, D.S., 1973. Approximation algorithms for combinatorial problems, Proceedings of the Fifth Annual ACM Symposium on Theory of Computing. ACM, Austin, Texas, USA, pp. 38-49.
21. Kim J.-G., Kuby M. A network transformation heuristic approach for the deviation flow refueling location model. Comput. Oper. Res. 2013, 40(4):1122-1131.
22. Kim J.G., Kuby M. The deviation-flow refueling location model for optimizing a network of refueling stations. Int. J. Hydrogen Energy 2012, 37(6):5406-5420.
23. Kuby M., Lim S. The flow-refueling location problem for alternative-fuel vehicles. Soc. Econ. Plan. Sci. 2005, 39(2):125-145.
24. Lan G., DePuy G.W., Whitehouse G.E. An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 2007, 176(3):1387-1403.
25. LeBlanc L.J., Morlok E.K., Pierskalla W.P. An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 1975, 9:309-318.
26. Lim S., Kuby M. Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model. Eur. J. Oper. Res. 2010, 204(1):51-61.
27. MirHassani S.A., Ebrazi R. A flexible reformulation of the refueling station location problem. Transp. Sci. 2013, 47(4):617-628.
28. Nicholas M., Handy S., Sperling D. Using geographic information systems to evaluate siting and networks of hydrogen stations. Transp. Res. Rec. J. Transp. Res. Board 2004, 1880(1):126-134.
29. Nissan North America Inc. (accessed 20.05.14). http://www.nissanusa.com/electric-cars/leaf/charging-range/.
30. Stephens-Romero S.D., Brown T.M., Kang J.E., Recker W.W., Samuelsen G.S. Systematic planning to optimize investments in hydrogen infrastructure deployment. Int. J. Hydrogen Energy 2010, 35(10):4652-4667.
31. Tanaka K.-I., Furuta T. A hierarchical flow capturing location problem with demand attraction based on facility size, and its lagrangian relaxation solution method. Geogr. Anal. 2012, 44(1):15-28.
32. Teodorović D., Šelmić M. Locating flow-capturing facilities in transportation networks: a fuzzy sets theory approach. Int. J. Traffic Transport Eng. 2013, 3(2).
33. U.S. Department of Energy. Alternative fueling station locator. (accessed 05.05.14). http://www.afdc.energy.gov/locator/stations/.
34. Upchurch C., Kuby M., Lim S. A model for location of capacitated alternative-fuel stations. Geogr. Anal. 2009, 41(1):85-106.
35. Wang Y.-W. An optimal location choice model for recreation-oriented scooter recharge stations. Transp. Res. Part D 2007, 12(3):231-237.
36. Wang Y.-W. Locating battery exchange stations to serve tourism transport: a note. Transp. Res. Part D 2008, 13(3):193-197.
37. Wang Y.-W., Lin C.-C. Locating multiple types of recharging stations for battery-powered electric vehicle transport. Transp. Res. Part E 2013, 58:76-87.
38. Wang Y.-W., Wang C.-R. Locating passenger vehicle refueling stations. Transp. Res. Part E 2010, 46(5):791-801.
39. Wang Y.W., Lin C.C. Locating road-vehicle refueling stations. Transp. Res. Part E 2009, 45(5):821-829.
40. Wen M., Laporte G., Madsen O.B.G., Norrelund A.V., Olsen A. Locating replenishment stations for electric vehicles: Application to Danish traffic data. J. Oper. Res. Soc. 2013.
41. Yang Z., Chen H., Chu F. A lagrangian relaxation approach for a large scale new variant of capacitated clustering problem. Comput. Ind. Eng. 2011, 61(2):430-435.
42. Yen J.Y. Finding the k shortest loopless paths in a network. Manage. Sci. 1971, 17(11):712-716.
43. You P.-S., Hsieh Y.-C. A hybrid heuristic approach to the problem of the location of vehicle charging stations. Comput. Ind. Eng. 2014, 70:195-204.
44. Zeng W., Castillo I., Hodgson M.J. A generalized model for locating facilities on a network with flow-based demand. Netw. Spat. Econ. 2010, 10(4):579-611.