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

被引：44
|
作者：
Li, Shengyin [1 ]
Huang, Yongxi [1 ]
机构：
[1] Clemson Univ, Glenn Dept Civil Engn, Clemson, SC 29634 USA
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2014年 / 72卷
关键词：
Heuristic method; Greedy-adding; Alternative fueling stations; Deviation paths; Mixed integer programming; OPTIMAL LOCATION; NETWORK; OPTIMIZATION; STATIONS; MODEL; ALGORITHMS; SIZE;
D O I：
10.1016/j.tre.2014.10.013
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
A multipath refueling location model is developed to take into account the effects of vehicle range and multiple deviation paths. It is formulated as a mixed integer linear program, which is intrinsically difficult to solve with increase in the number of deviation paths and network size. This study is focused on developing heuristic approximation solutions, specifically the greedy-adding and greedy-adding with extension algorithms. These algorithms are shown to be efficient and effective to solve the model for the Sioux Falls network. The heuristics are also applied to locate electric vehicle charging stations in the state of South Carolina. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：144 / 158
页数：15
相关论文
共 50 条
  • [21] An Improved Heuristic Algorithm for the Special Case of the Set Covering Problem
    Gonen
    Avrahami, T.
    Israeli, U.
    2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013), 2013, : 93 - 97
  • [22] Heuristic function algorithm for minimum set-covering problem
    Ruan Jian Xue Bao, 2 (156-160):
  • [23] Robust Hub Location Problem With Flow-Based Set-Up Cost
    Li, Shuxia
    Fang, Chenhao
    Wu, Yifan
    IEEE ACCESS, 2020, 8 : 66178 - 66188
  • [24] Exact and heuristic approaches for the set cover with pairs problem
    Goncalves, Luciana Brugiolo
    Martins, Simone de Lima
    Ochi, Luiz Satoru
    Subramanian, Anand
    OPTIMIZATION LETTERS, 2012, 6 (04) : 641 - 653
  • [25] Exact and heuristic approaches for the set cover with pairs problem
    Luciana Brugiolo Gonçalves
    Simone de Lima Martins
    Luiz Satoru Ochi
    Anand Subramanian
    Optimization Letters, 2012, 6 : 641 - 653
  • [26] Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
    Mesquita, Marta
    Paias, Ana
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) : 1562 - 1575
  • [27] An iterated-tabu-search heuristic for a variant of the partial set covering problem
    Bilal, Nehme
    Galinier, Philippe
    Guibault, Francois
    JOURNAL OF HEURISTICS, 2014, 20 (02) : 143 - 164
  • [28] Design of a heuristic algorithm for the generalized multi-objective set covering problem
    Lakmali Weerasena
    Aniekan Ebiefung
    Anthony Skjellum
    Computational Optimization and Applications, 2022, 82 : 717 - 751
  • [29] What is the best greedy-like heuristic for the weighted set covering problem?
    Vasko, Francis J.
    Lu, Yun
    Zyma, Kenneth
    OPERATIONS RESEARCH LETTERS, 2016, 44 (03) : 366 - 369
  • [30] An iterated-tabu-search heuristic for a variant of the partial set covering problem
    Nehme Bilal
    Philippe Galinier
    Francois Guibault
    Journal of Heuristics, 2014, 20 : 143 - 164
12345