Skip to main content
SpringerLink
Log in

Local branching

  • Published:
Mathematical Programming Submit manuscript

Abstract.

The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper we investigate the use of a generic MIP solver as a black-box ``tactical'' tool to explore effectively suitable solution subspaces defined and controlled at a ``strategic'' level by a simple external branching framework. The procedure is in the spirit of well-known local search metaheuristics, but the neighborhoods are obtained through the introduction in the MIP model of completely general linear inequalities called local branching cuts. The new solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the MIP solver at hand. It alternates high-level strategic branchings to define the solution neighborhoods, and low-level tactical branchings to explore them. The result is a completely general scheme aimed at favoring early updatings of the incumbent solution, hence producing high-quality solutions at early stages of the computation. The method is analyzed computationally on a large class of very difficult MIP problems by using the state-of-the-art commercial software ILOG-Cplex 7.0 as the black-box tactical MIP solver. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the new method exhibits consistently an improved heuristic performance: in 23 out of 29 cases, the MIP solver produced significantly better incumbent solutions when driven by the local branching paradigm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A New Heuristic For Pure 0-1 Programs. Operations Research 49(2), 207–225 (2001)

    Google Scholar 

  2. Balas, E., Martin, C.H.: Pivot-And-Complement: A Heuristic For 0-1 Programming. Management Science 26(1), 86–96 (1980)

    Google Scholar 

  3. Belotti, P.: Personal communication, 2002

  4. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0. http://www.caam.rice.edu/∼ bixby/miplib/miplib.html.

  5. Caprara, A., Fischetti, M., Toth, P.: A Heuristic Method For The Set Covering Problem. Operations Research 47, 730–743 (1999)

    Google Scholar 

  6. Cplex.: ILOG Cplex 7.0 User's Manual and Reference Manual. ILOG, S.A., 2001 (http://www.ilog.com)

  7. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part I. Journal of Heuristics 2, 343–358 (1997)

    Google Scholar 

  8. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part II. Journal of Heuristics 3, 161–179 (1997)

    Google Scholar 

  9. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston, Dordrecht, London, 1997

  10. Goessens, J.W., van Hoesel, S., Kroon, L.: A Branch-and-Cut Approach to Line Planning Problems. Working Paper, Erasmus University, 2001

  11. Hillier, F.S.: Effcient Heuristic Procedures For Integer Linear Programming With An Interior. Operations Research 17(4), 600–637 (1969)

    Google Scholar 

  12. Ibaraki, T., Ohashi, T., Mine, H.: A Heuristic Algorithm For Mixed-Integer Programming Problems. Mathematical Programming Study 2, 115–136 (1974)

  13. Kroon, L.: Personal communication, 2002

  14. Kroon, L., Fischetti, M.: Crew Scheduling for Netherlands Railways: Destination Customer. In: Voss, S., Daduna, J.R., eds. Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 2001, pp. 181–201

  15. Løkketangen, A.: Heuristics for 0-1 Mixed-Integer Programming. In: Pardalos, P.M., Resende, M.G.C. eds. Handbook of Applied Optimization, Oxford University Press, 2002, pp. 474–477

  16. Løkketangen, A., Glover, F.: Solving Zero/One Mixed Integer Programming Problems Using Tabu Search. European Journal of Operational Research 106, 624–658 (1998)

    Google Scholar 

  17. Luzzi, I.: Personal communication, 2001

  18. Mannino, C., Parrello, E.: Personal communication, 2002

  19. Mladenovíc, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097–1100 (1997)

  20. Nediak, M., Eckstein, J.: Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming Research Report RRR 53-2001, RUTCOR, Rutgers University, October 2001

  21. Polo, C.: Algoritmi Euristici per il Progetto Ottimo di una Rete di Interconnessione. Tesi di laurea in Ingegneria Informatica, Universtità degli Studi di Padova, 2002 (in Italian)

  22. TURNI.: User's Manual, Double-Click sas, 2001 (http://www.turni.it)

  23. Van Vyve, M., Pochet, Y.: A General Heuristic for Production Planning Problems. CORE Discussion Paper 56, 2001

Download references

Author information

Authors and Affiliations

  1. DEI, University of Padova, Via Gradenigo 6/A, 35100, Padova, Italy

    Matteo Fischetti

  2. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi

Authors
  1. Matteo Fischetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Lodi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matteo Fischetti.

Additional information

Mathematics Subject Classification (2000): 90C06, 90C10, 90C11, 90C27, 90C59

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischetti, M., Lodi, A. Local branching. Math. Program., Ser. B 98, 23–47 (2003). https://doi.org/10.1007/s10107-003-0395-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0395-5

Keywords

Search

Navigation