Abstract
Finding good (or even just feasible) solutions for Mixed-Integer Nonlinear Programming problems independently of the specific problem structure is a very hard but practically important task, especially when the objective and/or the constraints are nonconvex. With this goal in mind, we present a general-purpose heuristic based on Variable Neighborhood Search, Local Branching, a local Nonlinear Programming algorithm and Branch-and-Bound. We test the proposed approach on MINLPLib, comparing with several existing heuristic and exact methods. An implementation of the proposed heuristic is freely available and can employ all NLP/MINLP solvers with an AMPL interface as the main search tools.
Similar content being viewed by others
References
Abhishek, K., Leyffer, S., Linderoth, J.: Filmint: An outer-approximation based solver for nonlinear mixed-integer programs. Technical report ANL/MCS-P1374-0906, Argonne National Laboratory (2007)
Adjiman C., Androulakis I., Floudas C.: Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Eng. 21, S445–S450 (1997)
Aouchiche M., Bonnefoy J., Fidahoussen A., Caporossi G., Hansen P., Hiesse L., Lacheré J., Monhait A.: VNS for extremal graphs 14: The AGX 2 system. In: Liberti, L., Maculan, N. (eds) Global Optimization: From Theory to Implementation, pp. 281–308. Springer, Berlin (2006)
Belotti, P.: Couenne: a user’s manual. Technical report, Lehigh University (2009). http://www.coin-or.org/Couenne
Belotti P., Lee J., Liberti L., Margot F., Wächter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4–5), 597–634 (2008)
Bonami, P., Biegler, L., Conn, A., Cornuéjols, G., Grossmann, I., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex Mixed Integer Nonlinear Programs. Technical report RC23771. IBM Corporation (2005)
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., Lee, J.: \({{\tt BONMIN}}\) user’s manual. Technical report. IBM Corporation (2007)
Brimberg J., Hansen P., Mladenović N.: Attraction probabilities in variable neighborhood search. 4OR 8, 181–194 (2010)
Brimberg J., Mladenović N.: A variable neighbourhood algorithm for solving the continuous location-allocation problem. Stud. Location Anal. 10, 1–12 (1996)
Brook A., Kendrick D., Meeraus A.: Gams, a user’s guide. ACM SIGNUM Newslett. 23(3–4), 10–11 (1988)
Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib—a collection of test models for Mixed-Integer Nonlinear Programming. INFORMS J. Comput. 15(1) (2003). http://www.gamsworld.org/minlp/minlplib.htm
Consulting, A., Development: SBB Release Notes (2002)
D’Ambrosio, C.: Application oriented Mixed Integer Nonlinear Programming. Ph.D. thesis, DEIS, Università di Bologna (2009)
D’Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with a Feasibility Pump approach for nonconvex MINLPs. In: Festa, P. (ed.) Proceedings of the 9th Symposium on Experimental Algorithms (SEA 2010). Lecture Notes in Computer Science, vol. 6049. Springer, Berlin (2010)
D’Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of Feasibility Pumps for nonconvex MINLP. Technical report OR-10-13, DEIS, Università di Bologna (2010)
Danna E., Rothberg E., Le Pape C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. A 102, 71–90 (2005)
Dražic M., Kovačević-Vujčić V., Čangalović M., Mladenović N.: Glob—a new VNS-based software for global optimization. In: Liberti, L., Maculan, N. (eds) Global Optimization: From Theory to Implementation, pp. 135–154. Springer, Berlin (2006)
Drazić, M., Lavor, C., Maculan, N., Mladenović, N.: A continuous VNS heuristic for finding the tridimensional structure of a molecule (2004)
Duran M., Grossmann I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307–339 (1986)
Fischetti M., Glover F., Lodi A.: The feasibility pump. Math. Program. A 104(1), 91–104 (2005)
Fischetti M., Lodi A.: Local branching. Math. Program. 98, 23–37 (2003)
Fletcher R., Leyffer S.: Solving Mixed Integer Nonlinear Programs by outer approximation. Math. Program. 66, 327–349 (1994)
Fletcher R., Leyffer S.: Numerical experience with lower bounds for MIQP branch-and-bound. SIAM J. Optim. 8(2), 604–616 (1998)
Fletcher R., Leyffer S.: User manual for filter. Technical report, University of Dundee, UK (1999)
Fletcher R., Leyffer S.: Nonlinear programming without a penalty function. Math. Program. 91, 239–269 (2002)
Fourer R., Gay D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)
Hansen P., Mladenović N.: Variable neighbourhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)
Hansen P., Mladenović N., Brimberg J., Moreno Pérez J.: Variable neighbourhood search. In: Gendreau, M., Potvin, J.Y. (eds) Handbook of Metaheuristics, 2nd edn., Kluwer, Dordrecht (2010)
Hansen P., Mladenović N., Moreno Pérez J.: Variable neighbourhood search: methods and applications. 4OR 6, 319–360 (2008)
Hansen P., Mladenović N., Urošević D.: Variable neighbourhood search and local branching. Comput. Oper. Res. 33(10), 3034–3045 (2006)
Karmarkar N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)
Lavor C., Liberti L., Maculan N.: Computational experience with the molecular distance geometry problem. In: Pintér, J. (ed) Global Optimization: Scientific and Engineering Case Studies, Springer, Berlin (2006)
Leyffer S.: User manual for MINLP_BB. Technical report, University of Dundee, UK (1999)
Liberti L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds) Global Optimization: From Theory to Implementation, pp. 211–262. Springer, Berlin (2006)
Liberti L., Cafieri S., Savourey D.: Reformulation optimization software engine. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds) Mathematical Software. LNCS, vol. 6327, pp. 303–314. Springer, New York (2010)
Liberti, L., Dražic, M.: Variable neighbourhood search for the global optimization of constrained NLPs. In: Proceedings of GO Workshop, Almeria, Spain (2005)
Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proceedings of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
Liberti, L., Lavor, C., Maculan, N., Marinelli, F.: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Glob. Optim. (accepted)
Liberti, L., Maculan, N. (eds): Global Optimization: From Theory to Implementation. Springer, Berlin (2006)
Liberti L., Nannicini G., Mladenović N.: A good recipe for solving MINLPs. In: Maniezzo, V., Stützle, T., Voss, S. (eds) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10, pp. 231–245. Springer, Berlin (2009)
Mladenović N., Drazic M., Kovacevic-Vujcic V., Cangalovic M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3), 753–770 (2008)
Mladenović N., Petrović J., Kovačević-Vujčić V., Čangalović M.: Solving a spread-spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151, 389–399 (2003)
Nannicini, G.: Point-to-point shortest paths in dynamic time-dependent road networks. Ph.D. thesis, Ecole Polytechnique, Palaiseau, France (2009)
Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. In: Bonami, P., Liberti, L., Miller, A., Sartenaer, A. (eds.) Proceedings of the European Workshop on MINLP. CIRM, Marseille (2010)
Puchinger, J., Raidl, G.: Relaxation guided variable neighbourhood search. In: Proceedings of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
Sahinidis N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201–205 (1996)
Smith E., Pantelides C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457–478 (1999)
Tawarmalani M., Sahinidis N.: Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563–591 (2004)
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)
Westerlund T., Skrifvars H., Harjunkoski I., Pörn R.: An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Eng. 22(3), 357–365 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper extends [41].
Rights and permissions
About this article
Cite this article
Liberti, L., Mladenović, N. & Nannicini, G. A recipe for finding good solutions to MINLPs. Math. Prog. Comp. 3, 349–390 (2011). https://doi.org/10.1007/s12532-011-0031-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12532-011-0031-y