Abstract
In this paper we explore the influence of adaptive memory in the performance of heuristic methods when solving a hard combinatorial optimization problem. Specifically, we tackle the adaptation of tabu search and scatter search to the bandwidth minimization problem. It consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This is a classic problem, introduced in the late sixties, that also has a well-known formulation in terms of graphs. Different exact and heuristic approaches have been proposed for the bandwidth problem. Our contribution consists of two new algorithms, one based on the tabu search methodology and the other based on the scatter search framework. We also present a hybrid method combining both for improved outcomes. Extensive computational testing shows the influence of the different elements in heuristic search, such as neighborhood definition, local search, combination methods and the use of memory. We compare our proposals with the most recent and advanced methods for this problem, concluding that our new methods can compete with them in speed and running time.
Similar content being viewed by others
References
Campos, V., Glover, F., Laguna, M., & Martí, R. (2001). An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization, 21, 397–414.
Cuthill, E., & McKee, J. (1969). Reducing the bandwidth of sparse symmetric matrices. In Proc. ACM national conference (pp. 157–172). New York: Association for Computing Machinery.
Dueck, G. H., & Jeffs, J. (1995). A heuristic bandwidth reduction algorithm. Journal of Combinatorial Mathematics and Computing, 18, 97–108.
Gibbs, N. E., Poole, W. G., & Stockmeyer, P. K. (1976). An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM Journal of Numerical Analysis, 13(2), 236–250.
Glover, O. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.
Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer.
Laguna, M., & Martí, R. (2003). Scatter search. Methodology and implementations in C. Boston: Kluwer.
Laguna, M., Martí, R., & Campos, V. (1999). Intensification and diversification with elite tabu search solutions for the LOP. Computers and Operations Research, 26, 1217–1230.
Lim, A., Rodrigues, B., & Xiao, F. (2006). Heuristics for matrix bandwidth reduction. European Journal of Operational Research, 174(1), 69–91.
Lin, S., & Kernighan, B. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498–516.
Martí, R., Laguna, M., Glover, F., & Campos, V. (2001). Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research, 135(2), 211–220.
Martí, R., Campos, V., & Piñana, E. (2008). A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research, 186(2), 513–528.
Piñana, E., Plana, I., Campos, V., & Martí, R. (2004). GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research, 153, 200–210.
Papadimitriou, C. H. (1976). The NP-completeness of the bandwidth minimization problem. Computing, 16(3), 263–270.
Rodriguez-Tello, E., Jin-Kao, H., & Torres-Jimenez, J. (2008). An improved simulated annealing algorithm for the matrix bandwidth minimization. European Journal of Operational Research, 185(3), 1319–1335.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by the Ministerio de Educación y Ciencia of the Spanish government (TIN2006-02696).
Rights and permissions
About this article
Cite this article
Campos, V., Piñana, E. & Martí, R. Adaptive memory programming for matrix bandwidth minimization. Ann Oper Res 183, 7–23 (2011). https://doi.org/10.1007/s10479-009-0573-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0573-9