The future of optimization technology

Maria Garcia De La Banda, Peter J. Stuckey, Pascal Van Hentenryck, Mark Wallace

    Research output: Contribution to journalArticleOtherpeer-review

    Abstract

    Technology for combinatorial optimization is rapidly changing, and as the size and scope of problems that can be solved steadily increases, the complexity of the underlying technology is growing. We foresee a huge demand for both the simplification of use of combinatorial optimization technology (so called “model and run” capabilities), as well as increasing need for the ability to quickly build complex hybrid solutions. These demands will place new emphasis on universal modeling languages and model transformation capabilities, as well as flexible and high level ways of specifying hybrid solutions. These changes put constraint programming in an ideal position since: constraint programming has the most high-level view of problems to begin with so we can ease modeling difficulties; and since constraint programming is an integrative technology, we have already spent considerable effort in making different solving technologies work together seamlessly. In this position paper we outline some of the key challenges and important research directions we foresee for optimization technology.
    Original languageEnglish
    Pages (from-to)126-138
    Number of pages13
    JournalConstraints
    Volume19
    Issue number2
    DOIs
    Publication statusPublished - 2014

    Cite this

    Garcia De La Banda, Maria ; Stuckey, Peter J. ; Van Hentenryck, Pascal ; Wallace, Mark. / The future of optimization technology. In: Constraints. 2014 ; Vol. 19, No. 2. pp. 126-138.
    @article{e51e2dddd7b04d91883750290171a052,
    title = "The future of optimization technology",
    abstract = "Technology for combinatorial optimization is rapidly changing, and as the size and scope of problems that can be solved steadily increases, the complexity of the underlying technology is growing. We foresee a huge demand for both the simplification of use of combinatorial optimization technology (so called “model and run” capabilities), as well as increasing need for the ability to quickly build complex hybrid solutions. These demands will place new emphasis on universal modeling languages and model transformation capabilities, as well as flexible and high level ways of specifying hybrid solutions. These changes put constraint programming in an ideal position since: constraint programming has the most high-level view of problems to begin with so we can ease modeling difficulties; and since constraint programming is an integrative technology, we have already spent considerable effort in making different solving technologies work together seamlessly. In this position paper we outline some of the key challenges and important research directions we foresee for optimization technology.",
    author = "{Garcia De La Banda}, Maria and Stuckey, {Peter J.} and {Van Hentenryck}, Pascal and Mark Wallace",
    year = "2014",
    doi = "10.1007/s10601-013-9149-z",
    language = "English",
    volume = "19",
    pages = "126--138",
    journal = "Constraints",
    issn = "1383-7133",
    publisher = "Springer-Verlag London Ltd.",
    number = "2",

    }

    The future of optimization technology. / Garcia De La Banda, Maria; Stuckey, Peter J.; Van Hentenryck, Pascal; Wallace, Mark.

    In: Constraints, Vol. 19, No. 2, 2014, p. 126-138.

    Research output: Contribution to journalArticleOtherpeer-review

    TY - JOUR

    T1 - The future of optimization technology

    AU - Garcia De La Banda, Maria

    AU - Stuckey, Peter J.

    AU - Van Hentenryck, Pascal

    AU - Wallace, Mark

    PY - 2014

    Y1 - 2014

    N2 - Technology for combinatorial optimization is rapidly changing, and as the size and scope of problems that can be solved steadily increases, the complexity of the underlying technology is growing. We foresee a huge demand for both the simplification of use of combinatorial optimization technology (so called “model and run” capabilities), as well as increasing need for the ability to quickly build complex hybrid solutions. These demands will place new emphasis on universal modeling languages and model transformation capabilities, as well as flexible and high level ways of specifying hybrid solutions. These changes put constraint programming in an ideal position since: constraint programming has the most high-level view of problems to begin with so we can ease modeling difficulties; and since constraint programming is an integrative technology, we have already spent considerable effort in making different solving technologies work together seamlessly. In this position paper we outline some of the key challenges and important research directions we foresee for optimization technology.

    AB - Technology for combinatorial optimization is rapidly changing, and as the size and scope of problems that can be solved steadily increases, the complexity of the underlying technology is growing. We foresee a huge demand for both the simplification of use of combinatorial optimization technology (so called “model and run” capabilities), as well as increasing need for the ability to quickly build complex hybrid solutions. These demands will place new emphasis on universal modeling languages and model transformation capabilities, as well as flexible and high level ways of specifying hybrid solutions. These changes put constraint programming in an ideal position since: constraint programming has the most high-level view of problems to begin with so we can ease modeling difficulties; and since constraint programming is an integrative technology, we have already spent considerable effort in making different solving technologies work together seamlessly. In this position paper we outline some of the key challenges and important research directions we foresee for optimization technology.

    UR - http://www.scopus.com/inward/record.url?scp=84898820987&partnerID=8YFLogxK

    U2 - 10.1007/s10601-013-9149-z

    DO - 10.1007/s10601-013-9149-z

    M3 - Article

    VL - 19

    SP - 126

    EP - 138

    JO - Constraints

    JF - Constraints

    SN - 1383-7133

    IS - 2

    ER -