Solving Chance-Constrained Programs Combining Tabu Search and Simulation

  • Roberto Aringhieri
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3059)


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.


Tabu Search Local Ring Stochastic Program Random Parameter Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aringhieri, R., Dell’Amico, M.: Comparing Intensification and Diversification Strategies for the SONET Network Design Problem. Technical report, DISMI (2003); submitted to Journal of HeuristicsGoogle Scholar
  2. 2.
    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.)Google Scholar
  3. 3.
    Bertsimas, D.J., Jaillet, P., Odoni, A.R.: A Priori Optimization. Operations Research 38(6), 1019–1033 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  5. 5.
    Charnes, A., Cooper, W.: Chance-constrained programming. Management Science 6, 73–79 (1959)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)zbMATHCrossRefGoogle Scholar
  7. 7.
    Dror, M., Trudeau, P.: Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 23, 228–235 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Glover, F., Kelly, J.: New Advanced combining Optimization and Simulation. In: Airo 1999 Proceedings (1999)Google Scholar
  10. 10.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)zbMATHGoogle Scholar
  11. 11.
    Goldschmidt, O., Laugier, A., Olinick, E.V.: SONET/SDH Ring Assignment with Capacity Constraints. Discrete Applied Mathematics (129), 99–128 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Laporte, G., Louveaux, F.V.: The Integer L-Shaped Method for Stochastic Integer Problems with Complete Recourse. Operations Research Letters 13, 133–142 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Marsaglia, G., Zaman, A.: Toward a Universal Random Number Generator. Technical Report FSU-SCRI-87-50, Florida State University (1987)Google Scholar
  15. 15.
    Marsaglia, G., Zaman, A.: A New Class of Random Number Generators. Annals of Applied Probability 3(3), 462–480 (1991)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Roberto Aringhieri
    • 1
  1. 1.DTIUniversity of MilanCremaItaly

Personalised recommendations