Observations on some heuristic methods for the capacitated facility location problem

被引：0
|
作者：
Sinha, Pritibhushan [1 ]
机构：
[1] Operat Management & Res, 6 A J C Bose Rd, Kolkata 700063, W Bengal, India
来源：
OPSEARCH | 2012年 / 49卷 / 01期
关键词：
Capacitated facility location problem; Heuristics; Probleminstances;
D O I：
10.1007/s12597-012-0064-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider a few types of heuristics, namely, add-drop-interchange, Lagrangean relaxation-based and random rounding heuristics for the capacitated facility location problem. Some instances of the problem are constructed and performance, with respect to such instances, of the heuristics is studied. It is observed that, performance of the heuristics is often not satisfactory. The instances presented in this article may be used as some critical instances to test heuristics for the problem.
引用
收藏
页码：86 / 93
页数：8
相关论文
共 50 条
  • [31] New heuristic methods for the single-source capacitated multi facility Weber problem
    Manzour, Hasan
    Torabi, Ali
    Pishvaee, Mir Saman
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 69 (5-8): : 1569 - 1579
  • [32] The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods
    Akyuz, M. Hakan
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 221 - 240
  • [33] EFFICIENT HEURISTIC PROCEDURE FOR CAPACITATED WAREHOUSE LOCATION PROBLEM
    KHUMAWALA, BM
    [J]. NAVAL RESEARCH LOGISTICS, 1974, 21 (04) : 609 - 623
  • [34] A simulated annealing heuristic for the capacitated location routing problem
    Yu, Vincent F.
    Lin, Shih-Wei
    Lee, Wenyih
    Ting, Ching-Jung
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (02) : 288 - 299
  • [35] A HEURISTIC LAGRANGEAN ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM
    BARCELO, J
    CASANOVAS, J
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (02) : 212 - 226
  • [36] A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
    Altinel, I. Kuban
    Durmaz, Engin
    Aras, Necati
    Ozkisacik, Kerem Can
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (03) : 790 - 799
  • [37] Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem
    Chen, Chia-Ho
    Ting, Ching-Jung
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (06) : 1099 - 1122
  • [38] A Greedy Heuristic Algorithm for Solving the Capacitated Planar Multi-facility Location-Allocation Problem
    Luis, Martino
    Ramli, Mohammad Fadzli
    Lin, Abdullah
    [J]. 4TH INTERNATIONAL CONFERENCE ON QUANTITATIVE SCIENCES AND ITS APPLICATIONS (ICOQSIA 2016), 2016, 1782
  • [39] A Lagrangean relaxation heuristic for a two-stage capacitated facility location problem with depot size selection
    Wu, Tingying
    Chu, Feng
    Yang, Zhen
    Zhou, Zhili
    Wang, Jian
    [J]. PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 60 - 65
  • [40] A capacitated facility location problem with constrained backlogging probabilities
    Silva, F. J. F.
    de la Figueray, D. S.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (21) : 5117 - 5134
12345