Abstract
A long-standing challenge in the metaheuristic literature is to devise a way to select parent solutions in evolutionary population-based algorithms to yield better offspring, and thus provide improved solutions to populate successive generations. We identify a way to achieve this goal that simultaneously improves the efficiency of the evolutionary process. Our strategy derives from a proposal associated with the scatter search and path relinking evolutionary algorithms that prescribes clustering the solutions and focusing on the two classes of solution combinations where the parents alternatively belong to the same cluster or to different clusters. We demonstrate the efficacy of our approach for selecting parents within this scheme by applying it to the important domain of quadratic unconstrained binary optimization (QUBO), which provides a model for solving a wide range of binary optimization problems. Within this setting, we focus on the path relinking algorithm, which together with tabu search has provided one of the most effective methods for QUBO problems. Computational tests disclose that our solution combination strategy improves the best results in the literature for hard QUBO instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Moves between solutions that involve other than flipping the values of binary variables produce more complex options.
References
Aiex, R.M., Binato, S., Resende, M.G.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29(4), 393–430 (2003)
Cox, T., Bell, G., Glover, F.: A new learning approach to process improvement in a telecommunications company. Total Qual. Manag. Benchmark. Prod. Oper. Manag. 4, 217–227 (1995)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156–166 (1977)
Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. 49, 231–255 (1994)
Glover, F.: Tabu thresholding: improved search by nonmonotonic trajectories. ORSA J. Comput. 7(4), 426–442 (1995)
Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653–684 (2000)
Glover, F., Laguna, M., Martí, R.: Scatter Search and Path Relinking: Advances and Applications, Handbook of Metaheuristics, pp. 1–35. Springer, New York (2003)
Glover, F., Hao, J.-K.: Efficient evaluation for solving 0–1 unconstrained quadratic optimization problems. Int. J. Metaheuristics 1(1), 3–10 (2010)
Glover, F., Lü, Z., Hao, J.-K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR Q. J. Oper. Res. 8(3), 239–253 (2010)
Glover, F., Cox, L., Patil, R., Kelly, J.P.: Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection. Ann. Oper. Res. 183(1), 47–73 (2011)
Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12(1–2), 55–72 (2006)
Hvattum, L.M., Glover, F.: Finding local optima of high-dimensional functions using direct search. Eur. J. Oper. Res. 195, 31–45 (2009)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 7, 881–892 (2002)
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lu, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58–81 (2014)
Lai, X., Hao, J.-K., Lü, Z., Glover, F.: A learning-based path relinking algorithm for the bandwidth coloring problem. Eng. Appl. Artif. Intell. 52, 81–91 (2016)
Lü, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207(3), 1254–1262 (2010)
Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259–282 (2004)
Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279–296 (2006)
Samorani, M., Laguna, M.: Data-mining-driven neighborhood search. INFORMS J. Comput. 24(2), 210–227 (2012)
Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DMGRASP heuristic: a survey. Int. Trans. Oper. Res. 15(4), 387–416 (2008)
Sorensen, K., Sevaux, M., Glover, F.: A history of metaheuristics. In: Marti, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics. Springer to appear (2018). arXiv:1704.00853 [cs.AI]
Wang, Y., Lü, Z., Glover, F., Hao, J.-K.: Path relinking for unconstrained binary quadratic programming. Eur. J. Oper. Res. 223, 595–604 (2012)
Wang, Y., Wu, Q., Glover, F.: Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258(3), 829–843 (2017)
Wang, Y., Wu, Q., Punnen, A.P., Glover, F.: Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables. Inf. Sci. 450, 284–300 (2018)
Acknowledgements
This research has been supported by the National Natural Science Foundation of China (Grant No. 71501157) and the Fundamental Research Funds for the Central Universities (Grant No. 3102017zy059).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Samorani, M., Wang, Y., Wang, Y. et al. Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem. J Heuristics 25, 629–642 (2019). https://doi.org/10.1007/s10732-018-9403-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-018-9403-z