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 条
12345