Stochastic Optimization

• Egon Balas and Manfred W. Padberg. Set partitioning — a survey. In Nicos Christofides, editor, Combinatorial Optimization, chapter 7, pages 151–210. Wiley, 1979.
• M. L. Balinski and R. E. Quandt. On an integer program for a delivery problem. Operations Research, 12:300–304, 1964.
• Christian Blum and Andrea Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268–308, September 2003.
• Olli Bräysy and Michel Gendreau. Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science, 39(1):104–118, February 2005. (doi:10.1287/trsc.1030.0056)
• A. A. Bulgak, P. D. Diwan, and B. Inozu. Buffer size optimization in asynchronous assembly systems using genetic algorithms. Computers ind. Engng., 28(2):309–322, 1995.
• V. Cerny. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 45:41–51, 1985.
• Nicos Christofides, Aristide Mingozzi, and Paolo Toth. The vehicle routing problem. In Nicos Christofides, editor, Combinatorial Optimization, chapter 11, pages 315–338. Wiley, 1979.
• G. Clarke and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568–581, 1964.
• R. W. Conway, W. L. Maxwell, J. O. McClain, and L. J. Thomas. The role of work-in-process inventories in series production lines. Operations Research, 36:229–241, 1988.
• A. Corana, M. Marchesi, C. Martini, and S. Ridella. Minimizing multimodal functions of continuous variables with the ``simulated annealing'' algorithm. ACM Transactions on Mathematical Software, 13(3):262–280, September 1987.
• Y. Dallery and Y. Frein. On decomposition methods for tandem queueing networks with blocking. Operations Research, 41(2):386–399, 1993.
• Y. Dallery and S. B. Gershwin. Manufacturing flow line systems: A review of models and analytical results. Queueing Systems: Theory and Applications, 12:3–94, 1992.
• R. W. Eglese. Simulated annealing: A tool for operational research. European Journal of Operational Research, 46:271–281, 1990.
• Jacques A. Ferland and Luc Fortin. Vehicles scheduling with sliding time windows. European Journal of Operational Research, 38:213–226, 1989.
• S. B. Gershwin. An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking. Operations Research, 35(2):291–305, 1987.
• Billy E. Gillett and Leland R. Miller. A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22:340–349, 1974.
• F. Glover and M. Laguna. Tabu search. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization. Oxford Academic Press, 2000. To appear.
• F. Glover. Tabu search — part I. ORSA Journal on Computing, 1:190–206, 1990.
• David E. Goldberg. Genetic Algorithms: In Search of Optimization & Machine Learning. Addison-Wesley, 1989.
• John J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1):122–128, 1986.
• R. Gupta, S. A. Smolka, and S. Bhaskar. On randomization in sequential and distributed algorithms. ACM Computing Surveys, 26(1):7–86, 1994.
• Per Brinch Hansen. An evaluation of high performance Fortran. ACM SIGPLAN Notices, 33(3):57–72, March 1998.
• J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.
• L. Ingber. Very fast simulated re-annealing. Journal of Mathematical Computation Modelling, 12:967–973, 1989.
• L. Ingber. Simulated annealing: Practice versus theory. Journal of Mathematical Computation Modelling, 18(11):29–57, 1993.
• Charles L. Karr. Genetic algorithms for modelling, design, and process control. In CIKM '93. Proceedings of the Second International Conference on Information and Knowledge Management, pages 233–238. ACM, 1993.
• S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671–679, 1983.
• D. E. Knuth. The Art of Computer Programming, volume 2 / Seminumerical Algorithms, pages 171–173. Addison-Wesley, second edition, 1981.
• C. Koulamas, S. R. Antony, and R. Jaen. A survey of simulated annealing applications to operations research problems. Omega International Journal of Management Science, 22(1):41–56, 1994.
• Gilbert Laporte, Yves Nobert, and Martin Desrochers. Optimal routing under capacity and distance restrictions. Operations Research, 33(5):1050–1073, 1985.
• N. Metropolis, A. N. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21(6):1087–1092, 1953.
• R. H. Mole and S. R. Jameson. A sequential route-building algorithm employing a generalised savings criterion. Operational Research Quarterly, 27(2):503–511, 1976.
• H. T. Papadopoulos and G. A. Vouros. A model management system (MMS) for the design and operation of production lines. International Journal of Production Research, 1997. (to be published).
• H. Perros. Queueing Networks with Blocking. Oxford University Press, 1994.
• S. G. Powell. Buffer allocation in unbalanced serial lines. Working Paper 289, The Amos Tuck School of Business Administration, Dartmouth College, 1992.
• W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C, pages 343–352. Cambridge University Press, 1988.
• K. C. So. Optimal buffer allocation strategy for minimizing work-in-process inventory in unpaced production lines. 29:81–88, 1997.
• Marius M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2):254–265, March/April 1987.
• James C. Spall. Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. John Wiley and Sons, 2003.
• George Tompkins and Farhad Azadivar. Genetic algorithms in optimizing simulated systems. In WSC '95. Proceedings of the 1995 Conference on Winter Simulation, pages 757–762. ACM, 1995.
• P. J. M. Van Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel, Dordrecht, The Nethelands, 1987.
• H. R. G. van Landeghem. A bi-criteria heuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 36:217–226, 1988.

 Last change: Friday, March 14, 2008 10:15 am
 Unless otherwise expressly stated, all original material on this page created by Diomidis Spinellis is licensed under a Creative Commons Attribution-Share Alike 3.0 Greece License.