The case for strategic oscillation
- 158 Downloads
We study a “hard” optimization problem for metaheuristic search, where a natural neighborhood (that consists of moves for flipping the values of zero-one variables) confronts two local optima, separated by a maximum possible number of moves in the feasible space. Once a descent method reaches the first local optimum, all sequences of feasible moves to reach the second, which is the global optimum, must ultimately pass through solutions that are progressively worse until reaching the worst solution of all, which is adjacent to the global optimum.
We show how certain alternative neighborhoods can locate the global more readily, but disclose that each of these approaches encounters serious difficulties by slightly changing the problem formulation. We also identify other possible approaches that seem at first to be promising but turn out to have deficiencies.
Finally, we observe that a strategic oscillation approach for transitioning between feasible and infeasible space overcomes these difficulties, reinforcing recent published observations about the utility of solution trajectories that alternate between feasibility and infeasibility. We also sketch features of such an approach that have implications for future research.
KeywordsZero-one optimization Strategic oscillation Hard problems Global minima Tabu search
Unable to display preview. Download preview PDF.
- Beasley, J. (1993). Lagrangian relaxation. In Modern heuristic techniques for combinatorial problems (pp. 243–303). New York: Wiley. Google Scholar
- Glover, F. (1995). Tabu thresholding: improved search by nonmonotonic trajectories. ORSA Journal on Computing, 7(3), 426–442. Google Scholar
- Glover, F. (2000). Multi-start and strategic oscillation methods—principles to exploit adaptive memory. In M. Laguna & J.L. Gonzales Velarde (Eds.), Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research (pp. 1–24). Norwell: Kluwer Academic. Google Scholar
- Glover, F., & Laguna, M. (1997). Tabu search. Norwell: Kluwer Academic. Google Scholar
- Glover, F., Kochenberger, G., Alidaee, B., & Amini, M. M. (1999). Tabu with search critical event memory: an enhanced application for binary quadratic programs. In S. Voss, S. Martello, I. Osman & C. Roucairol (Eds.), MetaHeuristics: advances and trends in local search paradigms for optimization (pp. 93–110). Boston: Kluwer Academic. Google Scholar
- Hvattum, L. M., Lokketangen, A., & Glover, F. (2005). New heuristics and adaptive memory procedures for Boolean optimization problems. In J.K. Karlof (Ed.), Integer programming theory and practice (pp. 1–18). Google Scholar
- Nonobe, K., & Ibaraki, T. (2001). An improved tabu search method for the weighted constraint satisfaction problem. INFOR, 39, 131–151. Google Scholar
- Reeves, C. R. (2006). Fitness landscapes. In Search Methodologies. Berlin: Springer, Chap. 19. Google Scholar
- Rego, C., & Alidaee, B. (2005). Metaheuristic optimization via memory and evolution: tabu search and scatter search. Norwell: Kluwer Academic. Google Scholar