Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Metaheuristics

HM 2014: Hybrid Metaheuristics pp 45–55Cite as

A Local Search Approach for Binary Programming: Feasibility Search

  • Conference paper

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

Abstract

In this paper we propose a Local Search approach for NP-Hard problems expressed as binary programs. Our search method focuses on the fast production of feasible solutions. The method explicitly considers the structure of the problem as a conflict graph and uses a systematic neighbor generation procedure to jump from one feasible solution to another using chains of movements. Computational experiments comparing with two open source integer programming solvers, CBC and GLPK, in MIPLIB 2010 instances, showed that our approach is more reliable for the production of feasible solutions in restricted amounts of time.

This is a preview of subscription content, 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   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a Large-Scale Traveling-Salesman Problem. Journal of the Operations Research Society of America 2(4), 393–410 (1954)

    Article  MathSciNet  Google Scholar 

  2. Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach. Management Science 16(1), 93–108 (1969)

    Article  Google Scholar 

  3. Lancia, G.: Integer programming models for computational biology problems. Journal of Computer Science and Technology 19(1), 60–77 (2004)

    Article  MathSciNet  Google Scholar 

  4. Johnson, E., Nemhauser, G., Savelsbergh, W.: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS Journal on Computing 12 (2000)

    Google Scholar 

  5. Linderoth, J.T., Ralphs, T.K.: Noncommercial Software for Mixed-Integer Linear Programming. In: Karlof, J.K. (ed.) Integer Programming: Theory and Practice, pp. 253–303. CRC Press Operations Research Series (2005)

    Google Scholar 

  6. Land, A.H., Doig, A.G.: An Automatic Method of Solving Discrete Programming Problems. Econometrica 28(3), 497–520 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mittelman, H.: Feasibility benchmark (February 2014), http://plato.asu.edu/ftp/feas_bench.html

  8. 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 

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

    Google Scholar 

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

    Google Scholar 

  11. Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98(1-3), 23–47 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming 102(1), 71–90 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Huy, P.N.A., San, C.T.B., Triantaphyllou, E.: Solving integer programming problems using genetic algorithms. In: ICEIC: International Conference on Electronics, Informations and Commumications, pp. 400–404 (2004)

    Google Scholar 

  14. Benoist, T., Estellon, B., Gardi, F., Megel, R., Nouioua, K.: Localsolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3), 299–316 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  15. Vassilev, V., Genova, K.: An algorithm of internal feasible directions for linear integer programming. European Journal of Operational Research 52(2), 203–214 (1991)

    Article  MATH  Google Scholar 

  16. Atamtürk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Conflict graphs in solving integer programming problems. European Journal of Operational Research 121, 40–55 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Borndorfer, R.: Aspects of Set Packing, Partitioning, and Covering. PhD thesis (1998)

    Google Scholar 

  18. Wu, Q., Hao, J.K., Glover, F.: Multi-neighborhood tabu search for the maximum weight clique problem. Annals of Operations Research 196(1), 611–634 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  19. 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 3(2), 103–163 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Department, Universidade Federal de Ouro Preto (UFOP), Ouro Preto - Minas Gerais, Brasil

    Samuel Souza Brito, Haroldo Gambini Santos & Bruno Henrique Miranda Santos

Authors
  1. Samuel Souza Brito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haroldo Gambini Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruno Henrique Miranda Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona 1-3, edif. Omega, 08034, Barcelona, Spain

    Maria J. Blesa

  2. Dept. of Computer Science, IKERBASQUE and University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, Donostia, Spain

    Christian Blum

  3. Dept. of Business and Informatics, University of Hamburg, Institute of Information Systems, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Souza Brito, S., Gambini Santos, H., Miranda Santos, B.H. (2014). A Local Search Approach for Binary Programming: Feasibility Search. In: Blesa, M.J., Blum, C., Voß, S. (eds) Hybrid Metaheuristics. HM 2014. Lecture Notes in Computer Science, vol 8457. Springer, Cham. https://doi.org/10.1007/978-3-319-07644-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07644-7_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07643-0

  • Online ISBN: 978-3-319-07644-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation