Simulation optimization using tabu search: an emperical study
WSC '05 Proceedings of the 37th conference on Winter simulation
An artificial immune system based algorithm to solve unequal area facility layout problem
Expert Systems with Applications: An International Journal
A new mixed integer programming formulation for facility layout design using flexible bays
Operations Research Letters
| Hi-index | 0.00 |
This paper puts forth a general method to optimize constrained problems effectively when using tabu search. An adaptive penalty approach is used that exploits the short-term memory structure of the tabu list along with the long-term memory of the search results. It is shown to be effective on a variety of combinatorial problems with different degrees and numbers of constraints. The approach requires few parameters, is robust to their setting, and encourages search in promising regions of the feasible and infeasible regions before converging to a final feasible solution. The method is tested on three diverse NP-hard problems, facility layout, system reliability optimization, and orienteering, and is compared with two other penalty approaches developed explicitly for tabu search. The proposed memory-based approach shows consistent strong performance.