IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v67y2016i8d10.1057_jors.2015.119.html
   My bibliography  Save this article

A mixed integer linear programming model for reliability optimisation in the component deployment problem

Author

Listed:
  • Asef Nazari

    (CSIRO Computational Informatics)

  • Dhananjay Thiruvady

    (CSIRO Computational Informatics
    Bayesian Intelligence)

  • Aldeida Aleti

    (Monash University)

  • Irene Moser

    (Swinburne University of Technology)

Abstract

Component deployment is a combinatorial optimisation problem in software engineering that aims at finding the best allocation of software components to hardware resources in order to optimise quality attributes, such as reliability. The problem is often constrained because of the limited hardware resources, and the communication network, which may connect only certain resources. Owing to the non-linear nature of the reliability function, current optimisation methods have focused mainly on heuristic or metaheuristic algorithms. These are approximate methods, which find near-optimal solutions in a reasonable amount of time. In this paper, we present a mixed integer linear programming (MILP) formulation of the component deployment problem. We design a set of experiments where we compare the MILP solver to methods previously used to solve this problem. Results show that the MILP solver is efficient in finding feasible solutions even where other methods fail, or prove infeasibility where feasible solutions do not exist.

Suggested Citation

  • Asef Nazari & Dhananjay Thiruvady & Aldeida Aleti & Irene Moser, 2016. "A mixed integer linear programming model for reliability optimisation in the component deployment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1050-1060, August.
    • Handle: RePEc:pal:jorsoc:v:67:y:2016:i:8:d:10.1057_jors.2015.119
    DOI: 10.1057/jors.2015.119
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2015.119
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2015.119?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. Andreas Ernst & Houyuan Jiang & Mohan Krishnamoorthy, 2006. "Exact Solutions to Task Allocation Problems," Management Science, INFORMS, vol. 52(10), pages 1634-1646, October.
    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. Subrata Mitra & Balram Avittathur, 2018. "Application of linear programming in optimizing the procurement and movement of coal for an Indian coal-fired power-generating company," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 45(3), pages 207-224, September.

    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. Gudmundsson, Jens & Hougaard, Jens Leth & Platz, Trine Tornøe, 2023. "Decentralized task coordination," European Journal of Operational Research, Elsevier, vol. 304(2), pages 851-864.
    2. Riezebos, Jan & Zhu, Stuart X., 2020. "Inventory control with seasonality of lead times," Omega, Elsevier, vol. 92(C).
    3. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2017. "Linear Reformulation of Polynomial Discrete Programming for Fast Computation," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 108-122, February.
    4. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    5. Gülpınar, Nalan & Çanakoğlu, Ethem & Branke, Juergen, 2018. "Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 291-303.
    6. Michele Samorani & Manuel Laguna, 2012. "Data-Mining-Driven Neighborhood Search," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 210-227, May.
    7. Goutam Sen & Mohan Krishnamoorthy & Narayan Rangaraj & Vishnu Narayanan, 2016. "Facility location models to locate data in information networks: a literature review," Annals of Operations Research, Springer, vol. 246(1), pages 313-348, November.
    8. Giovanni Giallombardo & Giovanna Miglionico & Houyuan Jiang, 2015. "New Reformulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Working Papers 2015/03, Cambridge Judge Business School, University of Cambridge.
    9. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2013. "A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 643-653, November.
    10. A Lusa & C N Potts, 2008. "A variable neighbourhood search algorithm for the constrained task allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 812-822, June.

    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:pal:jorsoc:v:67:y:2016:i:8:d:10.1057_jors.2015.119. 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.palgrave-journals.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.