MO-COMPASS: a fast convergent search algorithm for multi-objective discrete optimization via simulation

Discrete Optimization via Simulation (DOvS) has drawn considerable attention from both simulation researchers and industry practitioners, due to its wide application and significant effects. In fact, DOvS usually implies the need to solve large-scale problems, making the efficiency a key factor when designing search algorithms. In this research work, MO-COMPASS (Multi-Objective Convergent Optimization via Most-Promising-Area Stochastic Search) is developed, as an extension of the single-objective COMPASS, for solving DOvS problems with two or more objectives by taking into consideration the Pareto optimality and the probability of correct selection. The algorithm is proven to be locally convergent, and numerical experiments have been carried out to show its ability to achieve high convergence rate.

[1]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[2]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[3]  Douglas J. Morrice,et al.  A Multiple Attribute Utility Theory Approach to Ranking and Selection , 2001, Manag. Sci..

[4]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[5]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[6]  Enver Yücesan,et al.  Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey , 2003, TOMC.

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

[8]  S. Incerti,et al.  Geant4 developments and applications , 2006, IEEE Transactions on Nuclear Science.

[9]  Loo Hay Lee,et al.  Integration of Statistical Selection with Search Mechanism for Solving Multi-Objective Simulation-Optimization Problems , 2006, Proceedings of the 2006 Winter Simulation Conference.

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

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

[12]  Loo Hay Lee,et al.  Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem , 2008, Eur. J. Oper. Res..

[13]  Lucas Bradstreet,et al.  A Fast Incremental Hypervolume Algorithm , 2008, IEEE Transactions on Evolutionary Computation.

[14]  L. Lee,et al.  Finding the non-dominated Pareto set for multi-objective simulation models , 2010 .

[15]  Jie Xu,et al.  Speeding up COMPASS for high-dimensional discrete optimization via simulation , 2010, Oper. Res. Lett..

[16]  Loo Hay Lee,et al.  Integration of indifference-zone with multi-objective computing budget allocation , 2010, Eur. J. Oper. Res..

[17]  Jie Xu,et al.  Industrial strength COMPASS: A comprehensive algorithm and software for optimization via simulation , 2010, TOMC.

[18]  Arnd Schirrmann,et al.  Unlocking value from component exchange contracts in aviation using simulation-based optimisation , 2010, Proceedings of the 2010 Winter Simulation Conference.

[19]  Loo Hay Lee,et al.  Simulation optimization using the cross-entropy method with optimal computing budget allocation , 2010, TOMC.

[20]  Loo Hay Lee,et al.  Multi-objective compass for discrete optimization via simulation , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[21]  J. Norris.  Appendix: probability and measure , 1997 .

[22]  Jie Xu,et al.  An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems , 2013, INFORMS J. Comput..