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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aringhieri, R., Dell’Amico, M.: Comparing Intensification and Diversification Strategies for the SONET Network Design Problem. Technical report, DISMI (2003); submitted to Journal of Heuristics
Aringhieri, R., Dell’Amico, M., Grasselli, L.: Solution of the SONET Ring Assignment Problem with capacity constraints. Technical Report 12, DISMI (2001); To appear in Adaptive Memory and Evolution: Tabu Search and Scatter Search Rego, C., Alidaee, B. (eds.)
Bertsimas, D.J., Jaillet, P., Odoni, A.R.: A Priori Optimization. Operations Research 38(6), 1019–1033 (1990)
Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Heidelberg (1997)
Charnes, A., Cooper, W.: Chance-constrained programming. Management Science 6, 73–79 (1959)
Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512–522 (2002)
Dror, M., Trudeau, P.: Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 23, 228–235 (1986)
Gendreau, M., Laporte, G., Seguin, R.: A Tabu Search heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers. Operations Research 44(3), 469–447 (1996)
Glover, F., Kelly, J.: New Advanced combining Optimization and Simulation. In: Airo 1999 Proceedings (1999)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Goldschmidt, O., Laugier, A., Olinick, E.V.: SONET/SDH Ring Assignment with Capacity Constraints. Discrete Applied Mathematics (129), 99–128 (2003)
Laporte, G., Louveaux, F.V.: The Integer L-Shaped Method for Stochastic Integer Problems with Complete Recourse. Operations Research Letters 13, 133–142 (1993)
Linderoth, J., Shapiro, A., Wright, S.: The Empirical Behavior of Sampling Methods for Stochastic Programming. Technical report, Computer Science Department, University of Wisconsin-Madison (2001)
Marsaglia, G., Zaman, A.: Toward a Universal Random Number Generator. Technical Report FSU-SCRI-87-50, Florida State University (1987)
Marsaglia, G., Zaman, A.: A New Class of Random Number Generators. Annals of Applied Probability 3(3), 462–480 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aringhieri, R. (2004). Solving Chance-Constrained Programs Combining Tabu Search and Simulation. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive