Abstract
Primal heuristics are a fundamental component of state-of-the-art global solvers for mixed integer linear programming (MIP) and mixed integer nonlinear programming (MINLP). In this paper, we investigate the impact of primal heuristics on the overall solution process. We present a computational study, in which we compare the performance of the MIP and MINLP solver SCIP with and without primal heuristics on six test sets with altogether 983 instances from academic and industrial sources. We analyze how primal heuristics affect the solver regarding seven different measures of performance and show that the impact differs by orders of magnitude. We further argue that the harder a problem is to solve to global optimality, the more important the deployment of primal heuristics becomes.
Similar content being viewed by others
Notes
It should be pointed out that all these projects took place while the author was affiliated with Zuse Institute Berlin and that none of this is related to his current position at FICO.
Note that the average primal integral is a multiple of the average primal gap.
We used the statistic calculator of http://www.socscistatistics.com/pvalues/chidistribution.aspx, which uses 0.00001 as a lower precision bound.
References
Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1–41 (2009)
Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. Spec. Issue 4(1), 77–86 (2007)
Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. In: Klatte, D., Lüthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011, pp. 71–76. Springer, Berlin (2012)
Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Lecture Notes in Computer Science, vol. 5015, pp. 6–20. Springer, Berlin (2008)
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 1–12 (2006)
Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization—Festschrift for Martin Grötschel, pp. 449–481. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-38189-8_18
Arnold, T., Berthold, T., Heinz, S., Vigerske, S., Henrion, R., Grötschel, M., Koch, T., Tischendorf, C., Römisch, W.: A jack of all trades? solving stochastic mixed-integer nonlinear constraint programs. In: Deuflhard, P., Grötschel, M., Hömberg, D., Horst, U., Kramer, J., Mehrmann, V., Polthier, K., Schmidt, F., Schütte, C., Skutella, M., Sprekels, J. (eds.) Matheon—Mathematics for Key Technologies, EMS Series in Industrial and Applied Mathematics, vol. 1, pp. 135–146. European Mathematical Society (2014)
Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597–634 (2009)
Berthold, T.: Primal heuristics for mixed integer programs. Diploma Thesis, Technische Universität Berlin (2006)
Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611–614 (2013). https://doi.org/10.1016/j.orl.2013.08.007
Berthold, T.: Heuristic algorithms in global MINLP solvers. Ph.D. Thesis, Technische Universität Berlin (2014)
Berthold, T.: RENS—the optimal rounding. Math. Program. Comput. 6(1), 33–54 (2014). https://doi.org/10.1007/s12532-013-0060-9
Berthold, T., Gleixner, A.M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144(1–2), 315–346 (2014). https://doi.org/10.1007/s10107-013-0635-2
Berthold, T., Heinz, S., Pfetsch, M.E., Vigerske, S.: Large neighborhood search beyond MIP. In: Gaspero, L.D., Schaerf, A., Stützle, T. (eds.) Proceedings of the 9th Metaheuristics International Conference (MIC 2011), pp. 51–60 (2011)
Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 427–444. Springer, New York (2011)
Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12–15 (1998)
Bonami, P., Cornuéjols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119(2), 331–352 (2009)
Bonami, P., Gonçalves, J.: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51, 729–747 (2012)
Bonami, P., Lee, J.: Bonmin user’s manual. Numer. Math. 4, 1–32 (2007)
Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib—a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114–119 (2003)
CppAD: A package for differentiation of C++ algorithms. http://www.coin-or.org/CppAD/
D’Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136, 375–402 (2012)
Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91–104 (2005)
Fischetti, M., Monaci, M.: Exploiting erraticism in search. Oper. Res. 62(1), 114–122 (2014)
Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1, 201–222 (2009)
Floudas, C., Gounaris, C.: A review of recent advances in global optimization. J. Glob. Optim. 45(1), 3–38 (2009)
Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. ZIB-Report 13-48, Zuse Institute Berlin (2013)
GloMIQO 2.0. http://helios.princeton.edu/GloMIQO/
Ipopt (Interior Point OPTimizer). http://www.coin-or.org/Ipopt/
Jackson, R.H.F., Boggs, P.T., Nash, S.G., Powell, S.: Guidelines for reporting results of computational experiments. Report of the ad hoc committee. Math. Program. 49, 413–425 (1991)
Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103–163 (2011)
Koch, T., Bargmann, D., Ebbers, M., Fügenschuh, A., Geißler, B., Geißler, N., Gollmer, R., Gotzes, U., Hayn, C., Heitsch, H., Henrion, R., Hiller, B., Humpola, J., Joormann, I., Kühl, V., Lehmann, T., Leövey, H., Martin, A., Mirkov, R., Möller, A., Morsi, A., Oucherif, D., Pelzer, A., Pfetsch, M.E., Schewe, L., Römisch, W., Rövekamp, J., Schmidt, M., Schultz, R., Schwarz, R., Schweiger, J., Spreckelsen, K., Stangl, C., Steinbach, M.C., Steinkamp, A., Wegner-Specht, I., Willert, B.M., Vigerske, S.: Evaluating gas network capacities. MOS-SIAM Series on Optimization (2014) (in preparation)
Koch, T., Ralphs, T.K., Shinano, Y.: Could we use a million cores to solve an integer program? Math. Methods Oper. Res. 76(1), 67–93 (2012). https://doi.org/10.1007/s00186-012-0390-9
Liberti, L., Mladenović, N., Nannicini, G.: A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3, 349–390 (2011)
McNemar, Q.: Note on the sampling error of the difference between correlated proportions or percentages. Psychometrika 12(2), 153–157 (1947)
Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57, 3–50 (2013)
Mittelmann, H.: Benchmarks for optimization software: Miplib2010. http://plato.asu.edu/bench.html
Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. Math. Program. Comput. 4(1), 1–31 (2012)
Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. e-prints (2008). http://arxiv.org/abs/0812.2188
Pfetsch, M.E., Fügenschuh, A., ler, B.G., ler, N.G., Gollmer, R., Hiller, B., Humpola, J., Koch, T., Lehmann, T., Martin, A., Morsi, A., Rövekamp, J., Schewe, L., Schmidt, M., Schultz, R., Schwarz, R., Schweiger, J., Stangl, C., Steinbach, M., Vigerske, S., Willert, B.: Validation of nominations in gas network optimization: models, methods, and solutions. Optimization Methods and Software (2012)
Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201–205 (1996). https://doi.org/10.1007/BF00138693
Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP—a parallel extension of SCIP. In: Bischof, C., Hegering, H.G., Nagel, W.E., Wittum, G. (eds.) Competence in High Performance Computing 2010, pp. 135–148. Springer, Berlin (2012)
Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T., Winkler, M.: Solving hard MIPLIB 2003 problems with ParaSCIP on supercomputers: an update. ZIB-Report 13-66, Zuse Institute Berlin (2013)
SoPlex. An open source LP solver implementing the revised simplex algorithm. http://soplex.zib.de/
Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. Thesis, Humboldt-Universität zu Berlin (2012) (submitted)
Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25–57 (2006)
Wilcoxon, F.: Individual comparisons by ranking methods. Biomet. Bull. 1, 80–83 (1945)
Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. Thesis, Technische Universität Berlin (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Berthold, T. A computational study of primal heuristics inside an MI(NL)P solver. J Glob Optim 70, 189–206 (2018). https://doi.org/10.1007/s10898-017-0600-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-017-0600-3