Weighted iterated local branching for mathematical programming problems with binary variables
-
Published:2022-04-16
Issue:3
Volume:28
Page:329-350
-
ISSN:1381-1231
-
Container-title:Journal of Heuristics
-
language:en
-
Short-container-title:J Heuristics
Author:
Rodrigues FilipeORCID, Agra AgostinhoORCID, Hvattum Lars MagnusORCID, Requejo CristinaORCID
Abstract
AbstractLocal search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local search procedure is by using a mixed-integer programming solver to explore a neighborhood defined through a constraint that limits the number of binary variables whose values are allowed to change in a given iteration. Recognizing that not all variables are equally promising to change when searching for better neighboring solutions, we propose a weighted iterated local branching heuristic. This new procedure differs from similar existing methods since it considers groups of binary variables and associates with each group a limit on the number of variables that can change. The groups of variables are defined using weights that indicate the expected contribution of flipping the variables when trying to identify improving solutions in the current neighborhood. When the mixed-integer programming solver fails to identify an improving solution in a given iteration, the proposed heuristic may force the search into new regions of the search space by utilizing the group of variables that are least promising to flip. The weighted iterated local branching heuristic is tested on benchmark instances of the optimum satisfiability problem, and computational results show that the weighted method is superior to an alternative method without weights.
Funder
Fundação para a Ciência e a Tecnologia Norges Forskningsråd
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software
Reference31 articles.
1. Alsheddy, A., Voudouris, C., Tsang, E.P.K., Alhindi, A.: Guided local search. In: Martí, R., Panos, P., Resende, M.G. (eds.) Handbook of heuristics, pp. 1–37. Springer International Publishing, Cham (2016) 2. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Sur. 35(3), 268–308 (2003) 3. Boussaïd, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82–117 (2013) 4. da Silva, R., Hvattum, L.M., Glover, F.: Combining solutions of the optimum satisfiability problem using evolutionary tunneling. MENDEL Soft Comput. J. 26(1), 23–29 (2020) 5. Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71–90 (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|