Skip to main content
SpringerLink
Log in

A Pre-processing Aware RINS Based MIP Heuristic

  • Conference paper
Hybrid Metaheuristics (HM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7919))

Included in the following conference series:

Abstract

This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce sub-problems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solver COIN-OR CBC are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glover, F.: Tabu Search and adaptive memory programming - advances, applications and challenges. In: Interfaces in Computer Sciences and Operations Research, pp. 1–75 (1996)

    Google Scholar 

  2. Reeves, C.R.: Genetic Algorithms Modern Heuristic Techniques for Combinatorial Problems. Advanced Topics in Computer Science Series, ch. 4, pp. 151–196. Blackwell Scientific Publications (1993)

    Google Scholar 

  3. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)

    Google Scholar 

  4. Glover, F.: Future paths for Integer Programming and links to Artificial Intelligence. COR 13(5), 533–549 (1986)

    MathSciNet  MATH  Google Scholar 

  5. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11, 4135–4151 (2011)

    Article  Google Scholar 

  6. Eckstein, J., Nediak, M.: Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. Journal Heuristics 13, 471–503 (2007)

    Article  Google Scholar 

  7. Parisini, F., Milano, M.: Improving CP-based Local Branching via Sliced Neighborhood Search. In: Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 887–892 (2011)

    Google Scholar 

  8. Ghosh, S.: DINS, a MIP Improvement Heuristic. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 310–323. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Berthold, T.: Rens: The Relaxation Enforced Neighborhood Search (2009)

    Google Scholar 

  10. Ferreira, D., Morabito, R., Rangel, S.: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Computers and Operations Research 37, 684–691 (2009)

    Article  Google Scholar 

  11. Danna, E., Rothberg, E., Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions 102, 71–90 (2005)

    Google Scholar 

  12. Fischetti, M., Bertacco, L., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Technical report, Università di Bologna D.E.I.S. Operations Research (2005)

    Google Scholar 

  13. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Mathematical Programming 104(1), 9104 (2005)

    Article  MathSciNet  Google Scholar 

  14. Fischetti, M., Lodi, A.: Local branching. Mathematics Programming, ser. B 98, 23–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rothberg, E.: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions. INFORMS Journal on Computing 19(4), 534–541 (2007)

    Article  MATH  Google Scholar 

  16. Forrest, J., Lougee-Heimer, R.: INFORMS Tutorials in Operations Research. CBC User Guide, pp. 257–277 (2005)

    Google Scholar 

  17. Lougee-Heimer, R.: The Common Optimization Interface for Operations Research: Promoting open-source software in the operations research community. IBM Journal of Research and Development 47(1), 57–66 (2003)

    Article  Google Scholar 

  18. Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Haspeslagh, S., De Causmaecker, P., Stolevik, M., Schaerf, A.: First international nurse rostering competition 2010. CODeS, Department of Computer Science. KULeuven Campus Kortrijk, Belgium (2010)

    Google Scholar 

  20. Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D., Wolter, K.: MIPLIB 2010. Mathematical Programming Computation. Mathematics and Statistics 3, 103–163 (2011), http://dx.doi.org/10.1007/s12532-011-0025-9

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computação, Universidade Federal de Ouro Preto (UFOP), Ouro Preto, MG, Brasil

    Thiago M. Gomes, Haroldo G. Santos & Marcone J. F. Souza

Authors
  1. Thiago M. Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haroldo G. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcone J. F. Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. IKERBASQUE, Basque Foundation for Science, Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, San Sebastian, Spain

    Christian Blum

  3. Department of Mathematics and Applications “R. Caccioppoli”, Compl. M.S.A., University of Naples Federico II, Via Cintia, 80126, Naples, Italy

    Paola Festa

  4. DISI, Università di Bologna, Campus of Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. IRIDIA CP 194/6, Université Libre de Bruxelles, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gomes, T.M., Santos, H.G., Souza, M.J.F. (2013). A Pre-processing Aware RINS Based MIP Heuristic. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38516-2_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38515-5

  • Online ISBN: 978-3-642-38516-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation