Industrial strength COMPASS: A comprehensive algorithm and software for optimization via simulation

Industrial Strength COMPASS (ISC) is a particular implementation of a general framework for optimizing the expected value of a performance measure of a stochastic simulation with respect to integer-ordered decision variables in a finite (but typically large) feasible region defined by linear-integer constraints. The framework consists of a global-search phase, followed by a local-search phase, and ending with a “clean-up” (selection of the best) phase. Each phase provides a probability 1 convergence guarantee as the simulation effort increases without bound: Convergence to a globally optimal solution in the global-search phase; convergence to a locally optimal solution in the local-search phase; and convergence to the best of a small number of good solutions in the clean-up phase. In practice, ISC stops short of such convergence by applying an improvement-based transition rule from the global phase to the local phase; a statistical test of convergence from the local phase to the clean-up phase; and a ranking-and-selection procedure to terminate the clean-up phase. Small-sample validity of the statistical test and ranking-and-selection procedure is proven for normally distributed data. ISC is compared to the commercial optimization via simulation package OptQuest on five test problems that range from 2 to 20 decision variables and on the order of 104 to 1020 feasible solutions. These test cases represent response-surface models with known properties and realistic system simulation problems.

[1]  Yu-Chi Ho,et al.  Ordinal optimization of DEDS , 1992, Discret. Event Dyn. Syst..

[2]  S. Andradóttir A method for discrete stochastic optimization , 1995 .

[3]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[4]  Stephen E. Chick,et al.  New Two-Stage and Sequential Procedures for Selecting the Best Simulated System , 2001, Oper. Res..

[5]  Sigrún Andradóttir,et al.  Simulation optimization with countably infinite feasible regions: Efficiency and convergence , 2006, TOMC.

[6]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[7]  Rupert G. Miller Simultaneous Statistical Inference , 1966 .

[8]  Barry L. Nelson,et al.  Discrete optimization via simulation: algorithms and error control , 2004 .

[9]  Barry L. Nelson,et al.  A combined procedure for optimization via simulation , 2002, Proceedings of the Winter Simulation Conference.

[10]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[11]  Loo Hay Lee,et al.  A new approach to discrete stochastic optimization problems , 2006, Eur. J. Oper. Res..

[12]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[13]  Barry L. Nelson,et al.  Selecting the best system when systems are revealed sequentially , 2007 .

[14]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[15]  Barry L. Nelson,et al.  A framework for locally convergent random-search algorithms for discrete optimization via simulation , 2007, TOMC.

[16]  J. Telgen Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints , 1983 .

[17]  Barry L. Nelson,et al.  Search and selection for large-scale stochastic optimization , 1999 .

[18]  Michael C. Fu,et al.  Feature Article: Optimization for simulation: Theory vs. Practice , 2002, INFORMS J. Comput..

[19]  Sigrún Andradóttir,et al.  Simulation optimization using balanced explorative and exploitative search , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[20]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[21]  Barry L. Nelson,et al.  Using Ranking and Selection to "Clean Up" after Simulation Optimization , 2003, Oper. Res..

[22]  Richard E. Nance,et al.  Perspectives on the Evolution of Simulation , 2002, Oper. Res..

[23]  Seong-Hee Kim,et al.  Comparison with a standard via fully sequential procedures , 2005, TOMC.

[24]  Barry L. Nelson,et al.  Comparisons with a Standard in Simulation Experiments , 2001, Manag. Sci..

[25]  J. Banks,et al.  Discrete-Event System Simulation , 1995 .

[26]  Barry L. Nelson,et al.  Discrete Optimization via Simulation Using COMPASS , 2006, Oper. Res..

[27]  Fred W. Glover,et al.  Simulation optimization: a review, new developments, and applications , 2005, Proceedings of the Winter Simulation Conference, 2005..

[28]  Sigrún Andradóttir,et al.  Accelerating the convergence of random search methods for discrete stochastic optimization , 1999, TOMC.

[29]  Sigrún Andradóttir,et al.  Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization , 2009, INFORMS J. Comput..

[30]  R. H. Smith Optimization for Simulation : Theory vs . Practice , 2002 .

[31]  Leyuan Shi,et al.  Nested Partitions Method for Stochastic Optimization , 2000 .

[32]  Julie L. Swann,et al.  Simple Procedures for Selecting the Best Simulated System When the Number of Alternatives is Large , 2001, Oper. Res..

[33]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[34]  Garrett J. van Ryzin,et al.  Stocking Retail Assortments Under Dynamic Consumer Substitution , 2001, Oper. Res..

[35]  S. Andradóttir,et al.  A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization , 1999 .

[36]  Yu-Chi Ho,et al.  Stochastic Comparison Algorithm for Discrete Optimization with Estimation , 1999, SIAM J. Optim..

[37]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[38]  Barry L. Nelson,et al.  A framework for simulation-optimization software , 2003 .

[39]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.