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
关键词
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 条
  • [31] A Heuristic Approach to the p-Median Problem Using a Set Covering Formulation
    Paluch, Stanislav
    Urbanicova, Ivana
    MATHEMATICAL METHODS IN ECONOMICS (MME 2014), 2014, : 738 - 742
  • [32] An efficient local search heuristic with row weighting for the unicost set covering problem
    Gao, Chao
    Yao, Xin
    Weise, Thomas
    Li, Jinlong
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (03) : 750 - 761
  • [33] A heuristic for the non-unicost set covering problem using local branching
    Beasley, J. E.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 2807 - 2825
  • [34] Design of a heuristic algorithm for the generalized multi-objective set covering problem
    Weerasena, Lakmali
    Ebiefung, Aniekan
    Skjellum, Anthony
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 82 (03) : 717 - 751
  • [35] Exact and heuristic solution approaches for the Generalized Independent Set Problem
    Zheng, Mingming
    Hao, Jin-Kao
    Wu, Qinghua
    COMPUTERS & OPERATIONS RESEARCH, 2024, 164
  • [36] Hyper-heuristic algorithm for traffic flow-based vehicle routing problem with simultaneous delivery and pickup
    Wang, Zheng
    Liu, Jinlong
    Zhang, Jingling
    JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING, 2023, 10 (06) : 2271 - 2287
  • [37] Heuristic Feasibility and Preprocessing for a Set Covering Solver Based on Firefly Optimization
    Soto, Ricardo
    Crawford, Broderick
    Vilches, Jose
    Johnson, Franklin
    Paredes, Fernando
    ARTIFICIAL INTELLIGENCE PERSPECTIVES AND APPLICATIONS (CSOC2015), 2015, 347 : 99 - 108
  • [38] A multidimensional fitness function based heuristic algorithm for set covering problems
    Hashemi, Ahmad
    Gholami, Hamed
    Delorme, Xavier
    Wong, Kuan Yew
    APPLIED SOFT COMPUTING, 2025, 174
  • [39] A Labeled Data Set for Flow-Based Intrusion Detection
    Sperotto, Anna
    Sadre, Ramin
    van Vliet, Frank
    Pras, Aiko
    IP OPERATIONS AND MANAGEMENT, PROCEEDINGS, 2009, 5843 : 39 - 50
  • [40] A MODIFIED GREEDY HEURISTIC FOR THE SET COVERING PROBLEM WITH IMPROVED WORST-CASE BOUND
    GOLDSCHMIDT, O
    HOCHBAUM, DS
    YU, G
    INFORMATION PROCESSING LETTERS, 1993, 48 (06) : 305 - 310