数学与计算机科学 |
|
|
|
|
自适应memetic算法求解集合覆盖问题 |
林耿1, 关健2 |
1. 闽江学院数学系, 福建福州 350108; 2. 闽江学院现代教育技术中心, 福建福州 350108 |
|
An adaptive memetic algorithm for solving the set covering problem |
LIN Geng1, GUAN Jian2 |
1. Department of Mathematics, Minjiang University, Fuzhou 350108, China; 2. Modern Educational Technology Center, Minjiang University, Fuzhou 350108, China |
[1] GAREY M R, JOHNSON D S. Computers and Intractability:A Guide to the Theory of NP-Completeness[M]. San Francisco:Freeman,1979. [2] BALAS E, CARRERA M C. A dynamic subgradient-based branch-and-bound procedure for set covering[J]. Operations Research,1996,44(6):875-890. [3] FISHER M R, KEDIA P. Optimal solution of set covering/partitioning problems using dual heuristics[J]. Management Science,1990,36(6):674-688. [4] HOCHBAUM D S. Approximation algorithms for the set covering and vertex cover problems[J]. SIAM Journal on Computing,1982,11(3):555-556. [5] GROSSMAN T, WOOL A. Computational experience with approximation algorithms for the set covering problem[J]. European Journal of Operational Research,1997,101(1):81-92. [6] REN Z G, FENG Z R, KE L J, et al. New ideas for applying ant colony optimization to the set covering problem[J]. Computers & Industrial Engineering,2010,58(4):774-784. [7] BEASLEY J E, CHU P C. A genetic algorithm for the set covering problem[J]. European Journal of Operational Research,1996,94(2):392-404. [8] 吴志勇,陈韬,王红川,等.一个解决集合覆盖问题的二阶段遗传算法[J].小型微型计算机系统,2011,32(4):732-737. WU Zhiyong, CHEN Tao, WANG Hongchuan, et al. Two stage genetic algorithm for set covering problem[J]. Journal of Chinese Computer Systems,2011,32(4):732-737 [9] 蒋建林,程坤,王璨璨,等.基于改进遗传算法的集合覆盖问题[J].数学的实践与认识,2012,42(5):120-126. JIANG Jianlin, CHENG Kun, WANG Cancan, et al. Improved genetic algorithm for set covering problem[J]. Mathematics in Practice and Theory,2012,42(5):120-126. [10] NAJI-AZIMI Z, TOTH P, GALLI L. An electromagnetism metaheuristic for the unicost set covering problem[J]. European Journal of Operational Research, 2010, 205(2):290-300. [11] SUNDAR S, SINGH A. A hybrid heuristic for the set covering problem[J]. Operational Research,2012,12(3):345-365. [12] ALI M M, ZHU W X. A penalty function-based differential evolution algorithm for constrained global optimization[J]. Computational Optimization and Applications,2013,54(3):707-739. [13] FIDUCCIA C M,MATTHEYSES R M. A linear time heuristic for improving network partitions[C]//Proceedings of 19th ACM/IEEE Design Automation Conference. New Jersey:IEEE Press,1982:175-181. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|