针对一类随机规划问题构造了基于蒙特卡罗的回溯优化求解法,该方法本质属于一种动态搜索算法,通过迭代求解一系列样本确定性优化问题并经样本容量逐渐增加过程而逼近随机问题的最优解,而迭代终止条件由需求的计算精度确定,并具体给出了近似解的计算方法及迭代终止条件.最后,通过算列验证了该方法的有效性.
[1] 刘宝碇, 赵瑞清. 随机规划与模糊规划 [M]. 北京:清华大学出版社 1998.
[2] FISHMAN G S. Monte carlo:concepts, algorithms and applications [M]. New York:springer-verlag 1995.
[3] HEALY K, SCHRUBEN L W. Retrospective simulation response optimization [A]. Phoenix, USA 1991.
[4] CHEN H, SCHREIBERR B W. Retrospective approximation algorithms for stochastic root finding [A]. Lake Buena Vista, USA 1994.
[5] HUIFEN CHEN, BRUCE W. SCHMEISER. Stochastic root finding via retrospective approximation [J]. IIE Transactions 2001, 3(3).
[6] JIN J, SCHMEISER B. Simulation-based retrospective optimization of stochastic systems:a family of algorithms [A]. New Orleans, USA 2003.
[7] NELDER J A, MEAD R. A simplex method for function minimization [J]. Computer Journal 1965, 17.
