IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4419-1644-0_4.html
   My bibliography  Save this book chapter

Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems

In: Hybrid Optimization

Author

Listed:
  • Pedro M. Castro

    (Unidade de Modelação e Optimização de Sistemas Energéticos)

  • Ignacio E. Grossmann
  • Louis-Martin Rousseau

Abstract

This chapter provides a review of decomposition algorithms for models that are formulated as hybrid mixed-integer linear/constraint programming problems, such as logic Bender Decomposition and Constraint Programming-Based Column Generation. We first focus the decomposition techniques on single stage scheduling problems with parallel machines where the hybrid model provides a natural representation as the decisions decompose into assignment and sequencing decisions. We describe a general decomposition algorithm for the hybrid MILP/CP model in terms of a Benders decomposition scheme, as well as in terms of a branch and cut framework. We then consider Vehicle Routing and Crew Rostering applications to illustrate how Hybrid Branch-and-Price method can be applied, and we discuss the different models that have been proposed in the literature.

Suggested Citation

  • Pedro M. Castro & Ignacio E. Grossmann & Louis-Martin Rousseau, 2011. "Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems," Springer Optimization and Its Applications, in: Pascal van Hentenryck & Michela Milano (ed.), Hybrid Optimization, edition 1, pages 135-167, Springer.
    • Handle: RePEc:spr:spochp:978-1-4419-1644-0_4
    DOI: 10.1007/978-1-4419-1644-0_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.

    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:spochp:978-1-4419-1644-0_4. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.