The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of freedom. Decisions must be made on how to distribute the overall computing load onto multiple computers, where to locate computers and how to take advantage of legacy components. The corresponding optimization problem not only embeds the structure of NP-hard problems, but also represents a challenge with a well-structured heuristic approach. A scientific approach has been rarely applied to cost minimization and a rigorous methodological support to cost issues of infrastructural design is still lacking. The methodological contribution of this paper is the representation of complex infrastructural design issues as a single cost-minimization problem. The problem is decomposed in four interwined cost-minimization sub-prolems; optimization is accomplished by sequentially solving these sub-problems with a heuristic approach and tuning their solution with a final tabusearch step. Results indicate that decomposition significantly reduces optimization time and solutions are also closer to the global optimum if results are compared to those identified without prior decomposition. Cost reductions are also significant when practicioners' solutions, obtained by applying simplified design rules from the professional literature, are considered.
|Titolo:||A Cost-oriented Approach for Infrastructural Design|
|Parole Chiave:||Cost minimization; Tabu-search|
|Settore Scientifico Disciplinare:||Settore MAT/09 - Ricerca Operativa|
|Data di pubblicazione:||2004|
|Enti collegati al convegno:||ACM|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|