Genetic algorithm approach for set covering problems

Wen Chih Huang; Cheng Yan Kao; Jorng Tzong Horng

Genetic algorithm approach for set covering problems

Wen Chih Huang, Cheng Yan Kao, Jorng Tzong Horng

資訊工程學系

研究成果: 會議貢獻類型 › 會議論文 › 同行評審

20 引文斯高帕斯（Scopus）

摘要

In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several instances of computationally difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems. We have found better solutions than the currently best-known solutions for two large test problems.

原文	???core.languages.en_GB???
頁面	569-574
頁數	6
出版狀態	已出版 - 1994
事件	Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) - Orlando, FL, USA 持續時間: 27 6月 1994 → 29 6月 1994

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???	Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2)
城市	Orlando, FL, USA
期間	27/06/94 → 29/06/94

引用此

@conference{c19e2f0aab9f4d42947247388feb00b0,

title = "Genetic algorithm approach for set covering problems",

abstract = "In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several instances of computationally difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems. We have found better solutions than the currently best-known solutions for two large test problems.",

author = "Huang, {Wen Chih} and Kao, {Cheng Yan} and Horng, {Jorng Tzong}",

year = "1994",

language = "???core.languages.en_GB???",

pages = "569--574",

note = "Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) ; Conference date: 27-06-1994 Through 29-06-1994",

}

TY - CONF

T1 - Genetic algorithm approach for set covering problems

AU - Huang, Wen Chih

AU - Kao, Cheng Yan

AU - Horng, Jorng Tzong

PY - 1994

Y1 - 1994

N2 - In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several instances of computationally difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems. We have found better solutions than the currently best-known solutions for two large test problems.

AB - In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several instances of computationally difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems. We have found better solutions than the currently best-known solutions for two large test problems.

UR - http://www.scopus.com/inward/record.url?scp=0028554973&partnerID=8YFLogxK

M3 - 會議論文

AN - SCOPUS:0028554973

SP - 569

EP - 574

T2 - Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2)

Y2 - 27 June 1994 through 29 June 1994

ER -

Genetic algorithm approach for set covering problems

摘要

???event.eventtypes.event.conference???

指紋

引用此