Skip to main content
SpringerLink
Log in

A New Algorithm for Stochastic Discrete Resource Allocation Optimization

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the Nested Partitions method, the Ordinal Optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the Nested Partitions method and the fast convergence properties of the Ordinal Optimization. Numerical results demonstrate that the hybrid algorithm can be effectively used for many large-scale stochastic discrete optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andradottir, S. 1995. A method for discrete stochastic optimization. Management Science 41: 1946–1961.

    Google Scholar 

  • Bechhofer, R. E., Santner, T. J., and Goldsman, D. M. 1995. Design and Analysis of Experiments for Statistical Selection, Screening, and Multiple Comparisons. John Wiley & Sons, Inc.

  • Cassandras, C. G., and Bao, G. 1994. A stochastic comparison algorithm for continuous optimization with estimations. Proceedings of the 33rd IEEE Conference on Decision and Control, pp. 676–677.

  • Cassandras, C., Dai, L., and Panayiotou, C. G. 1998. Ordinal optimization for a class of deterministic and stochastic discrete resource allocation problems. IEEE Trans. on AC. 43(7): 881–900.

    Google Scholar 

  • Cassandras, C. G., and Julka, V. 1994. Descent algorithms for discrete resource allocation problems. Proceedings of the 33rd IEEE Conference on Decision and Control, pp. 676–677.

  • Chalermdamrichai, V. 1998. A hybrid computer-intelligent, user-interactive, process plan optimizer for four-axis CNC turning centers. Manuscript of Ph.D. thesis, Dept of Industrial Eng., University of Wisconsin-Madison.

    Google Scholar 

  • Chen, C. H. 1996. A lower bound for the correct subset-selection probability and its application to discrete event system simulations. IEEE Transactions on Automatic Control 41(8): 1227–1231.

    Google Scholar 

  • Chen, C. H., and Ho, Y. C. 1995. An approximation approach of the standard clock method for general discrete event simulation. IEEE Transactions on Control Systems Technology 3(3): 309–317.

    Google Scholar 

  • Chen, C. H., Chen, H. C., and Dai, L. 1996. A gradient approach of smartly allocating computing budget for discrete event simulation. Proceedings of the 1996 Winter Simulation Conference, pp. 398–405.

  • Chen, H. C., Chen, C. H., Dai, L., Yücesan, E. 1997. New development of optimal computing budget allocation for discrete event simulation. Proceedings of the 1997 Winter Simulation Conference, pp. 334–341.

  • Chen, C. H., Kumar, V., and Luo, Y. C. 1998. Motion planning of walking robots using ordinal optimization. IEEE Robotics and Automation Magazine, pp. 22–32.

  • Chen, C. H., Yücesan, E., Yuan, Y., Chen, H. C., and Dai, L. 1998. Computing budget allocation for simulation experiments with different system structures. Proceedings of the 1998 Winter Simulation Conference, pp. 735–741.

  • Chen, C. H., Wu, S. D., and Dai, L. 1999. Ordinal comparison of heuristic algorithms using stochastic optimization. IEEE Transactions on Robotics and Automation 15(1): 44–56.

    Google Scholar 

  • Chen, C. H., Yücesan, E., Dai, L., and Chen, H. C. 2000a. Efficient computation of optimal budget allocation for discrete event simulation experiment. To appear in IIE Transactions.

  • Chen, H. C., Chen, C. H., and Yücesan, E. 2000b. Computing efforts allocation for ordinal optimization and discrete event simulation. To appear in IEEE Transactions on Automatic Control.

  • Chick, S. E. 1997. Bayesian analysis for simulation input and output. Proceedings of the 1997 Winter Simulation Conference, pp. 253–260.

  • Chick, S. E., Inoue, K., and Chen, C. H. 1999. An evaluation of six modeling methodologies for selecting the best system. To appear in the ACM Transitions on Modeling and Computer Simulation.

  • Dai, L. 1996. Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems. Journal of Optimization Theory and Applications 91(2): 363–388.

    Google Scholar 

  • Fabian, V. 1971. Stochastic Approximation, Optimization Methods in Statistics. J. S. Rustagi, ed., Academic Press, New York.

    Google Scholar 

  • Gelfand, S. B., and Mitter, S. K. 1989. Simulated annealing with noisy or imprecise energy measurements. Journal of Optimization: Theory and Application 62: 49–62.

    Google Scholar 

  • Gong, W. B., Ho, Y. C., and Zhai, W. 1995. Stochastic comparison algorithm for discrete optimization with estimations. Discrete Event Dynamic Systems: Theory and Applications.

  • Ho, Y. C., Sreenivas, R. S., and Vakili, P. 1992. Ordinal optimization of DEDS. Journal of Discrete Event Dynamic Systems 2(2): 61–88.

    Google Scholar 

  • Kushner, H. J., and Clark, D. S. 1978. Stochastic Approximation for Constrained and Unconstrained Systems. Springer-Verlag.

  • Law, A. M., and Kelton, W. D. 1991. Simulation Modeling & Analysis. McGraw-Hill, Inc.

  • Norkin, W. I., Ermoliev, Y. M., and Ruszczynski, A. 1996. On optimal allocation of indivisables under uncertainty. Operations Research 46: 381–395.

    Google Scholar 

  • Patsis, N. T., Chen, C. H., and Larson, M. E. 1997. SIMD parallel discrete event dynamic system simulation. IEEE Transactions on Control Systems Technology 5(3): 30–41.

    Google Scholar 

  • Rubinstein, R.Y. 1999. The simulated entropy method for combinatorial and continuous optimization. Manuscript.

  • Shi, L., and Olafsson, S. 1999. Convergence rate of the nested partitions method for stochastic optimization. Methodology and Computing in Applied Probability (in press).

  • Shi, L., and Olafsson, S. 1999. Nested partitions method for global optimization. To appear in Operations Research.

  • Shi, L., Olafsson, S., and Sun, N. 1999. New parallel randomized algorithms for the traveling salesman problem. Computers and Operations Research 26: 371–394.

    Google Scholar 

  • Shi, L., Olafsson, S., and Chen, Q. 1999. An optimization framework for product design. Submitted to publication.

  • Yan, D., and Mukai, H. 1993. Optimization algorithm with probabilistic estimation. Journal of Optimization Theory and Applications 79: 345–371.

    Google Scholar 

  • Yokowitz, L'Ecuyer, and Vazqez-Abad. 1999. Global stochastic optimization with low-dispersion point sets. To appear in Operations Research.

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Wisconsin-Madison, Madison, WI, 53706

    Leyuan Shi

Authors
  1. Leyuan Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, L. A New Algorithm for Stochastic Discrete Resource Allocation Optimization. Discrete Event Dynamic Systems 10, 271–294 (2000). https://doi.org/10.1023/A:1017214011352

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017214011352

Search

Navigation