摘要
This investigation presents an adapted genetic algorithm to resolve simple plant location problems. The proposed algorithm applies a clustering technique as mutation guidance and a novel local search method to enhance the solution quality. The proposed algorithm is then applied to the fifteen test problems taken from Beasley's OR-Library (J.E. Beasley, 1990). Empirical results indicate that the error rate of the proposed adapted GA is less than 0.3 percent. In addition, the computational time is bounded by a polynomial function of the problem size.
原文 | ???core.languages.en_GB??? |
---|---|
頁面 | 1186-1193 |
頁數 | 8 |
DOIs | |
出版狀態 | 已出版 - 1999 |
事件 | 1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States 持續時間: 6 7月 1999 → 9 7月 1999 |
???event.eventtypes.event.conference???
???event.eventtypes.event.conference??? | 1999 Congress on Evolutionary Computation, CEC 1999 |
---|---|
國家/地區 | United States |
城市 | Washington, DC |
期間 | 6/07/99 → 9/07/99 |