A genetic algorithm for Time-Satisfaction-Based Set Covering Location Problems

被引：0
|
作者：
Ma, YF [1 ]
Yang, C [1 ]
Zhang, M [1 ]
机构：
[1] Huazhong Univ Sci & Technol, Sch Management, Wuhan, Peoples R China
来源：
2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS | 2005年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper presents the Time-Satisfaction-Based Covering Location Problem (TSBSCLP), a more general set covering problem than the classical set covering location problem. Given a discrete network, we formulate TSBSCLP as an integer programming under the goal of minimizing the total fixed costs of selected facilities, and then provide a mixed genetic algorithm strategies to solve the variety of size of the problem, the result was analyzed after computational experiment and compared with some heuristic algorithms which have proven to be overall the best in solving set covering location problems. The computational experiment shows a good performance of our mixed genetic algorithm.
引用
收藏
页码：1037 / 1041
页数：5
相关论文
共 50 条
  • [1] Time-satisfaction-based maximal covering location problem and the adaptation of Lagrangean algorithm
    Ma, YF
    Zhang, M
    Dong, P
    [J]. Proceedings of the 2005 International Conference on Management Science & Engineering (12th), Vols 1- 3, 2005, : 365 - 370
  • [2] Urban emergency shelter locations for earthquake disaster using time-satisfaction-based maximal covering location model
    [J]. Wang, W. (ieeww@bjut.edu.cn), 1600, Shanghai Jiaotong University (48):
  • [3] An indirect genetic algorithm for set covering problems
    Aickelin, U
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (10) : 1118 - 1126
  • [4] USING A FACILITY LOCATION ALGORITHM TO SOLVE LARGE SET COVERING PROBLEMS
    VASKO, FJ
    WILSON, GR
    [J]. OPERATIONS RESEARCH LETTERS, 1984, 3 (02) : 85 - 90
  • [5] Vibrational genetic algorithm (Vga) for solving continuous covering location problems
    Ermis, M
    Ülengin, F
    Hacioglu, A
    [J]. ADVANCES IN INFORMATION SYSTEMS, 2002, 2457 : 293 - 302
  • [6] ALGORITHM FOR SET-COVERING PROBLEMS
    GONDRAN, M
    LAURIERE, JL
    [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 33 - 51
  • [7] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS
    BEASLEY, JE
    JORNSTEN, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) : 293 - 300
  • [8] Relationship Between Set Covering Location and Maximal Covering Location Problems in Facility Location Application
    Peng, Huaijun
    Qin, Yong
    Yang, Yanfang
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES FOR RAIL TRANSPORTATION: TRANSPORTATION, 2016, 378 : 711 - 720
  • [9] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [10] A genetic algorithm for the set covering problem
    AlSultan, KS
    Hussain, MF
    Nizami, JS
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
12345