IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p63-8710.1023-a1018904229454.html
   My bibliography  Save this article

A new approach to integrating mixed integer programming and constraint logicprogramming

Author

Listed:
  • R. Rodosek
  • M.G. Wallace
  • M.T. Hajian

Abstract

This paper represents an integration of Mixed Integer Programming (MIP) and ConstraintLogic Programming (CLP) which, like MIP, tightens bounds rather than adding constraintsduring search. The integrated system combines components of the CLP system ECLiPSe[7] and the MIP system CPLEX [5], in which constraints can be handled by either one orboth components. Our approach is introduced in three stages. Firstly, we present an automatictransformation which maps CLP programs onto such CLP programs that any disjunction iseliminated in favour of auxiliary binary variables. Secondly, we present improvements ofthis mapping by using a committed choice operator and translations of pre‐defined non‐linearconstraints. Thirdly, we introduce a new hybrid algorithm which reduces the solutionspace of the problem progressively by calling finite domain propagation of ECLiPSe aswell as dual simplex of CPLEX. The advantages of this integration are illustrated by efficientlysolving difficult optimisation problems like the Hoist Scheduling Problem [23]and the Progressive Party Problem [27]. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • R. Rodosek & M.G. Wallace & M.T. Hajian, 1999. "A new approach to integrating mixed integer programming and constraint logicprogramming," Annals of Operations Research, Springer, vol. 86(0), pages 63-87, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:63-87:10.1023/a:1018904229454
    DOI: 10.1023/A:1018904229454
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018904229454
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018904229454?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.

    Citations

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


    Cited by:

    1. Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
    2. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    3. Michela Milano & Greger Ottosson & Philippe Refalo & Erlendur S. Thorsteinsson, 2002. "The Role of Integer Programming Techniques in Constraint Programming's Global Constraints," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 387-402, November.
    4. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.
    5. Russell, Robert A. & Urban, Timothy L., 2010. "Multicriteria models for planning power-networking events," European Journal of Operational Research, Elsevier, vol. 207(1), pages 83-91, November.
    6. Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
    7. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.
    8. Sourd, Francis & Rogerie, Jerome, 2005. "Continuous filling and emptying of storage systems in constraint-based scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 510-524, September.

    More about this item

    Statistics

    Access and download statistics

    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:annopr:v:86:y:1999:i:0:p:63-87:10.1023/a:1018904229454. 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.