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

Asef Nazari, Dhananjay Thiruvady, Aldeida Aleti, Irene Moser

    Research output: Contribution to journalArticleResearchpeer-review

    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.
    Original languageEnglish
    Pages (from-to)1050-1060
    Number of pages11
    JournalJournal of the Operational Research Society
    Volume67
    Issue number8
    DOIs
    Publication statusPublished - Aug 2016

    Keywords

    • Integer programming
    • Linear programming
    • Reliability
    • Search

    Cite this

    @article{890b02904a314cd1bd89dbc5f3820080,
    title = "A mixed integer linear programming model for reliability optimisation in the component deployment problem",
    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.",
    keywords = "Integer programming, Linear programming, Reliability, Search",
    author = "Asef Nazari and Dhananjay Thiruvady and Aldeida Aleti and Irene Moser",
    year = "2016",
    month = "8",
    doi = "10.1057/jors.2015.119",
    language = "English",
    volume = "67",
    pages = "1050--1060",
    journal = "Journal of the Operational Research Society",
    issn = "0160-5682",
    publisher = "Palgrave Macmillan",
    number = "8",

    }

    A mixed integer linear programming model for reliability optimisation in the component deployment problem. / Nazari, Asef; Thiruvady, Dhananjay; Aleti, Aldeida; Moser, Irene.

    In: Journal of the Operational Research Society, Vol. 67, No. 8, 08.2016, p. 1050-1060.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

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

    AU - Nazari, Asef

    AU - Thiruvady, Dhananjay

    AU - Aleti, Aldeida

    AU - Moser, Irene

    PY - 2016/8

    Y1 - 2016/8

    N2 - 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.

    AB - 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.

    KW - Integer programming

    KW - Linear programming

    KW - Reliability

    KW - Search

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

    U2 - 10.1057/jors.2015.119

    DO - 10.1057/jors.2015.119

    M3 - Article

    VL - 67

    SP - 1050

    EP - 1060

    JO - Journal of the Operational Research Society

    JF - Journal of the Operational Research Society

    SN - 0160-5682

    IS - 8

    ER -