IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v26y2020i1d10.1007_s10732-019-09418-9.html
   My bibliography  Save this article

Objective scaling ensemble approach for integer linear programming

Author

Listed:
  • Weili Zhang

    (University of Oklahoma)

  • Charles D. Nicholson

    (University of Oklahoma)

Abstract

The objective scaling ensemble approach is a novel two-phase heuristic for integer linear programming problems shown to be effective on a wide variety of integer linear programming problems. The technique identifies and aggregates multiple partial solutions to modify the problem formulation and significantly reduce the search space. An empirical analysis on publicly available benchmark problems demonstrate the efficacy of our approach by outperforming standard solution strategies implemented in modern optimization software.

Suggested Citation

  • Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
    • Handle: RePEc:spr:joheur:v:26:y:2020:i:1:d:10.1007_s10732-019-09418-9
    DOI: 10.1007/s10732-019-09418-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-019-09418-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-019-09418-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Egon Balas & Clarence H. Martin, 1980. "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science, INFORMS, vol. 26(1), pages 86-96, January.
    2. J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
    3. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    4. Lihui Bai & Donald Hearn & Siriphong Lawphongpanich, 2010. "A heuristic method for the minimum toll booth problem," Journal of Global Optimization, Springer, vol. 48(4), pages 533-548, December.
    5. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    6. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
    7. Bernard Gendron & Jean-Yves Potvin & Patrick Soriano, 2003. "A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements," Annals of Operations Research, Springer, vol. 122(1), pages 193-217, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Meijia Han & Wenxing Zhu, 2023. "Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-37, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2011. "A new class of functions for measuring solution integrality in the Feasibility Pump approach," DIS Technical Reports 2011-08, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2013. "A new class of functions for measuring solution integrality in the Feasibility Pump approach: Complete Results," DIAG Technical Reports 2013-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    3. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "Feasibility Pump-Like Heuristics for Mixed Integer Problems," DIS Technical Reports 2010-15, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    4. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "New concave penalty functions for improving the Feasibility Pump," DIS Technical Reports 2010-10, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    5. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    6. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
    7. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    8. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    9. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    10. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    11. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    12. Sriram, Chellappan & Haghani, Ali, 2003. "An optimization model for aircraft maintenance scheduling and re-assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(1), pages 29-48, January.
    13. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    14. Rossi, Fabrizio & Smriglio, Stefano, 2001. "A set packing model for the ground holding problem in congested networks," European Journal of Operational Research, Elsevier, vol. 131(2), pages 400-416, June.
    15. Erwin Abbink & Matteo Fischetti & Leo Kroon & Gerrit Timmer & Michiel Vromans, 2005. "Reinventing Crew Scheduling at Netherlands Railways," Interfaces, INFORMS, vol. 35(5), pages 393-401, October.
    16. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    17. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    18. Sciau, Jean-Baptiste & Goyon, Agathe & Sarazin, Alexandre & Bascans, Jérémy & Prud’homme, Charles & Lorca, Xavier, 2024. "Using constraint programming to address the operational aircraft line maintenance scheduling problem," Journal of Air Transport Management, Elsevier, vol. 115(C).
    19. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    20. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:26:y:2020:i:1:d:10.1007_s10732-019-09418-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.