File(s) under permanent embargo
A mixed integer linear programming model for reliability optimisation in the component deployment problem
journal contribution
posted on 2016-08-01, 00:00 authored by Asef NazariAsef Nazari, Dhananjay ThiruvadyDhananjay Thiruvady, A Aleti, I MoserComponent 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.
History
Journal
Journal of the operational research societyVolume
67Issue
8Pagination
1050 - 1060Publisher
Palgrave MacmillanLocation
Basingstoke, Eng.Publisher DOI
ISSN
0160-5682eISSN
1476-9360Language
engPublication classification
C Journal article; C1.1 Refereed article in a scholarly journalCopyright notice
2016, The Operational Research SocietyUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC