An optimal sample allocation strategy for partition-based random search

IEEE Transactions on Automation Science and Engineering

Volumn 11, Issue 1, 2014, Pages 177-186

  Chen, Weiwei ^a   Gao, Siyang ^b   Chen, Chun Hung ^c   Shi, Leyuan ^b  

^a GE GLOBAL RESEARCH   (United States)

^b Wisconsin Electric Machines and Power Electronics Consortium   (United States)

^c Krasnow Institute for Advanced Study   (United States)

Author keywords

Global optimization; Optimal sample allocation; Partition based random search

Indexed keywords

ALLOCATION PROBLEMS; ALLOCATION STRATEGY; ASYMPTOTICALLY OPTIMAL; COMPUTING RESOURCE; EFFECTIVE ALGORITHMS; NUMERICAL TESTS; OPTIMAL SAMPLES; RANDOM SEARCHES;

ALGORITHMS; GLOBAL OPTIMIZATION; SAMPLING; SET THEORY;

ITERATIVE METHODS;

EID: 84892435788     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2013.2251881     Document Type: Article

References (31)

1. L. A. Wolsey and G. L. Nemhauser, Integer and Combinatorial Optimization. New York, NY, USA: Wiley, 1999.
2. J. Nocedal and S. Wright, Numerical Optimization, 2nd ed. New York, NY, USA: Springer, 2006.
3. D. E. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning. Reading, MA, USA: Addison-Wesley, 1989.
4. M. Dorigo, G. D. Caro, and L. M. Gambardella, "Ant algorithms for discrete optimization," Artif. Life, vol. 5, no. 2, pp. 137-172, 1999.
5. Y. Song, M. T. Zhang, J. Yi, L. Zhang, and L. Zheng, "Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization," IEEE Trans. Autom. Sci. Eng., vol. 4, no. 4, pp. 569-578, Oct. 2007.
6. L. Pi, Y. Pan, and L. Shi, "Hybrid nested partitions and mathematical programming approach and its applications," IEEE Trans. Autom. Sci. Eng., vol. 5, no. 4, pp. 573-586, Oct. 2008.
7. P. Chen, Z. Fu, A. Lim, and B. Rodrigues, "Port yard storage optimization," IEEE Trans. Autom. Sci. Eng., vol. 1, no. 1, pp. 26-37, Jan. 2004.
8. N. Damavandi and S. Safavi-Naeini, "A hybrid evolutionary programming method for circuit optimization," IEEE Trans. Circuits Syst. I, vol. 52, no. 5, pp. 902-910, May 2005.
9. L. Xia, W. Yin, J. Dong, T. Wu, M. Xie, and Y. Zhao, "A hybrid nested partitions algorithm for banking facility location problems," IEEE Trans. Autom. Sci. Eng., vol. 7, no. 3, pp. 654-658, Jul. 2010.
10. M. Ni, P. B. Luh, and B. Moser, "An optimization-based approach for design project scheduling," IEEE Trans. Autom. Sci. Eng., vol. 5, no. 3, pp. 394-406, Jul. 2008.
11. R. Horst, "A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization," J. Optim. Theory Appl., vol. 51, no. 2, pp. 271-291, 1986.
12. R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, 3rd ed. New York, NY, USA: Springer, 2003.
13. L. Shi and S. Ólafsson, "Nested partitions method for global optimization," Oper. Res., vol. 48, no. 3, pp. 390-407, 2000.
14. W.Chen,L. Pi, andL. Shi, Nested Partitions and Its Applications to the Intermodal Hub Location Problem. New York, NY, USA: Springer, 2009, ch. Supply Chain and Logistics Design, pp. 229-251.
15. W. Chen, L. Pi, and L. Shi, "An enhanced nested partitions algorithm using solution value prediction," IEEE Trans. Autom. Sci. Eng., vol. 8, no. 2, pp. 412-419, Apr. 2011.
16. Z. B. Tang, "Adaptive partitioned random search to global optimization," IEEE Trans. Autom. Control, vol. 39, pp. 2235-2244, 1994.
17. A. A. Zhigljavsky, Theory of Global Random Search, J. Pintér, Ed. Boston, MA, USA: Kluwer, 1991.
18. G. Liuzzi, S. Lucidi, and V. Piccialli, "A partition-based global optimization algorithm," J. Global Optimization, vol. 48, no. 1, pp. 113-128, 2010.
19. C. H. Chen, J. Lin, E. Yücesan, and S. E. Chick, "Simulation budget allocation for further enhancing the efficiency of ordinal optimization," J.Discrete Event Dynamic Syst.: Theory Appl., vol. 10, pp. 251-270, 2000.
20. B.-W. Hsieh, C.-H. Chen, and S.-C. Chang, "Efficient simulation- based composition of scheduling policies by integrating ordinal optimization with design of experiment," IEEE Trans. Autom. Sci. Eng., vol. 4, no. 4, pp. 553-568, Oct. 2007.
21. S. Coles, An Introduction to Statistical Modeling of Extreme Values. New York, NY, USA: Springer, 2001.
22. U. Derigs, "Using confidence limits for the global optimum in combinatorial optimization," Oper. Res., vol. 33, no. 5, pp. 1024-1049, 1985.
23. S. Kotz and S. Nadarajah, Extreme Value Distributions Theory and Applications. London, U.K.: Imperial College Press, 2000.
24. S. H. Zanakis and J. Kyparisis, "A review of maximum likelihood estimation methods for the three-parameter Weibull distribution," J. Stat. Comput. Simulation, vol. 25, pp. 53-72, 1986.
25. R. L. Smith and J. C. Naylor, "Statistics of the three-parameterWeibull distribution," Ann. Oper. Res., vol. 9, pp. 577-587, 1987.
26. C. H. Chen and L. H. Lee, Stochastic Simulation Optimization: An Optimal Computing Budget Allocation. Singapore: World Scientific, 2010.
27. J. A. Buzacott, "Automatic transfer lines with buffer stocks," Int. J. Prod. Res., vol. 5, no. 3, pp. 183-200, 1967.
28. K. C. So, "Optimal buffer allocation strategy for minimizing work-inprogress inventory in unpaced production lines," IIE Trans., vol. 29, no. 1, pp. 81-88, 1997.
29. H. Yamashita and T. Altiok, "Buffer capacity allocation for a desired throughput in production lines," IIE Trans., vol. 30, no. 10, pp. 883-892, 1998.
30. L. Shi and S.Men, "Optimal buffer allocation in production lines," IIE Trans., vol. 35, no. 1, pp. 1-10, 2003.
31. Y. Dallery, R. David, and X.-L. Xie, "Approximate analysis of transfer lines with unreliable machines and finite buffers," IEEE Trans. Autom. Control, vol. 34, no. 9, pp. 943-953, Sep. 1989.