الگوریتم چند مدل برای طراحی هزینه های مبتنی بر سیستم های مبتنی بر اینترنت

A scientific approach has been rarely applied to cost minimization and a rigorous methodological support to cost issues of the design of Internet-based distributed systems is still lacking. The methodological contribution of this paper is the representation of complex design issues as a set of four intertwined cost-minimization sub-problems: two set-partitionings, a set-packing and a min k-cut with a non-linear objective function. Optimization is accomplished by sequentially solving these sub-problems with a heuristic approach and tuning their solution with a local-search approach. Results indicate that decomposition significantly reduces optimization time and solutions have also lower costs than those identified without prior decomposition (20–60%). Cost reductions considerably grow (25–70%) when methodological outputs are compared with practitioners’ solutions.