Real world problems usually have to deal with some uncertainties. This is particularly true for the planning of services whose requests are unknown a priori. Several approaches for solving stochastic problems are reported in the literature. Metaheuristics seem to be a powerful tool for computing good and robust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move. In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.
Solving chance-constrained programs combining Tabu search and simulation / Roberto Aringhieri - In: Experimental and efficient algorithms : third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004 : proceedings / Celso C. Ribeiro, Simone L. Martins. - Berlin : Springer, 2004. - ISBN 3540220674. - pp. 30-41 (( Intervento presentato al 3. convegno Third International Workshop on Experimental and Efficient Algorithms (WEA '2004) tenutosi a Angra dos Reis, Brazil nel 2004.
Solving chance-constrained programs combining Tabu search and simulation
Roberto Aringhieri
2004
Abstract
Real world problems usually have to deal with some uncertainties. This is particularly true for the planning of services whose requests are unknown a priori. Several approaches for solving stochastic problems are reported in the literature. Metaheuristics seem to be a powerful tool for computing good and robust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move. In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
