Skip to main content
SpringerLink
Log in

An empirical evaluation of walk-and-round heuristics for mixed integer linear programs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Feasibility pump is a general purpose technique for finding feasible solutions of mixed integer programs. In this paper we report our computational experience on using geometric random walks and a random ray approach to provide good points for the feasibility pump. Computational results on MIPLIB2003 and COR@L test libraries show that the walk-and-round approach improves the upper bounds of a large number of test problems when compared to running the feasibility pump either at the optimal solution or the analytic center of the continuous relaxation. In our experiments the hit-and-run walk (a specific type of random walk strategy) started from near the analytic center is generally better than other random search approaches, when short walks are used. The performance may be improved by expanding the feasible region before walking. Although the upper bound produced in the geometric random walk approach are generally inferior than the best available upper bounds for the test problems, we managed to prove optimality of three test problems which were considered unsolved in the COR@L benchmark library (though the COR@L bounds available to us seem to be out of date).

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

Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. COIN-OR: Computational infrastructure for operations research. http://www.coin-or.org/

  2. COR@L: Computational optimization research at lehigh http://coral.ie.lehigh.edu/mip-instances/

  3. IBM ILog Cplex optimizer: http://www.ibm.com/

  4. MIPLIB2003: Mixed integer library (2003). http://miplib.zib.de/

  5. Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4(1), 77–86 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X.: Implementation of Interior Point Methods for Large Scale Linear Programming, pp. 189–252. Kluwer Academic, Dordrecht (1996). Chap. 6

    Book  Google Scholar 

  7. Baena, D., Castro, J.: Using the analytic center in the feasibility pump. (2010). http://www.optimization-online.org/DB_HTML/2010/11/2793.html

  8. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: Octane: a new heuristic for pure 0–1 programs. Oper. Res. 49(2), 207–225 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Balas, E., Martin, C.H.: Pivot and complement—a heuristic for 0–1 programming. Manag. Sci. 26(1), 86–96 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Balas, E., Martin, C.H.: Pivot and shift–a heuristic for mixed integer programming. Tech. rep., GSIA, Carnegie Mellon University (August 1986)

  11. Balas, E., Schmieta, S., Wallace, C.: Pivot and shift—a mixed integer programming heuristic. Discrete Optim. 1(1), 3–12 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Baumert, S., Ghate, A., Kiatsupaibul, S., Shen, Y., Smith, R.L., Zabinsky, Z.B.: Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyper-rectangles. Oper. Res. 57, 727–739 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Belisle, C.J.P.: Convergence theorems for a class of simulated annealing algorithms on ℝd. J. Appl. Probab. 29, 885–895 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4(1), 63–76 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51(4), 540–556 (2004)

    MathSciNet  MATH  Google Scholar 

  16. Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71–90 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dolan, E., Moré, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91–104 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1), 23–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1, 201–222 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Fourer, R., Mehrotra, S.: Solving symmetrical indefinite systems in an interior-point method for linear-programming. Math. Program. 62(1), 15–39 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6, 137–156 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kannan, R., Narayanan, H.: Random walks on polytopes and an affine interior point method for linear programming. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 561–570 (2009)

    Chapter  Google Scholar 

  24. Kannan, R., Vempala, S.: Sampling lattice points. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 696–700 (1997)

    Chapter  Google Scholar 

  25. Knuth, D.E.: Seminumerical Algorithms. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

  26. Lovász, L.: Hit-and-run mixes fast. Math. Program. 86(3), 443–461 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  27. Lovász, L., Vempala, S.: Hit-and-run from a corner. SIAM J. Comput. 35(4), 985–1005 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  28. Lovász, L., Vempala, S.: Simulated annealing in convex bodies and an O ∗(n 4) volume algorithm. J. Comput. Syst. Sci. 72(2), 392–417 (2006)

    Article  MATH  Google Scholar 

  29. Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575–601 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  30. Mehrotra, S., Huang, K.-L.: Computational experience with a modified potential reduction algorithm for linear programming. Optim. Methods Softw. 27(4–5), 865–891 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  31. Narayanan, H.: Randomized interior point methods for sampling and optimization (2009). http://arxiv.org/abs/arXiv:0911.3950

  32. Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia (2001)

    Book  MATH  Google Scholar 

  33. Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534–541 (2007)

    Article  MATH  Google Scholar 

  34. Smith, R.L.: Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6), 1296–1308 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  35. Solis, F.J., Wets, R.J.B.: Minimization by random search techniques. Math. Oper. Res. 6(1), 19–30 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  36. Vempala, S.: Geometric random walks: a survey. Comb. Comput. Geom. 52, 573–612 (2005)

    MathSciNet  Google Scholar 

  37. Xu, X., Hung, P., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1), 151–171 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  38. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)

    Book  MATH  Google Scholar 

  39. Zabinsky, Z.B.: Random search algorithms. Tech. rep., Department of Industrial and Systems Engineering, University of Washington, Seattle, WA (2009)

  40. Zabinsky, Z.B., Smith, R.L., McDonald, J.F., Romeijn, H.E., Kaufman, D.E.: Improving hit-and-run for global optimization. J. Glob. Optim. 3(2), 171–192 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 60208, USA

    Kuo-Ling Huang & Sanjay Mehrotra

Authors
  1. Kuo-Ling Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Mehrotra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Mehrotra.

Additional information

The research of both authors was partially supported by grant N00014-09-10518 and NSF-CMMI-05227650.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 546 kB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, KL., Mehrotra, S. An empirical evaluation of walk-and-round heuristics for mixed integer linear programs. Comput Optim Appl 55, 545–570 (2013). https://doi.org/10.1007/s10589-013-9540-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-013-9540-0

Keywords

Search

Navigation