IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v263y2017i3p946-960.html
   My bibliography  Save this article

Multi-objective retrospective optimization using stochastic zigzag search

Author

Listed:
  • Wang, Honggang

Abstract

We propose a new retrospective optimization (RO) method for multi-objective simulation optimization (MOSO) problems. RO algorithms generate a sequence of sample-path (SP) problems and solve these SP problems iteratively using a nonlinear optimizer. In this study, a stochastic zigzag search algorithm is chosen in the RO framework to solve SP problems. The key idea of zigzag search is searching around the Pareto front by applying an efficient local-search procedure using the gradients of the objective functions. Many continuous MOSO problems have smooth objective functions and their non-dominated objective function values form a smooth surface in the image space. This fact motivates developing the zigzag search method embedded in RO for such relatively well-posed MOSO problems. A numerical implementation of this method—multi-objective retrospective optimization using zigzag search (MOROZS)—is presented particularly for continuous bi-objective simulation optimization (BOSO) problems with well-connected Pareto optimal solutions. MOROZS is designed for BOSO problems in which a simulation oracle returns both objective function values and gradients. Due to the local nature of zigzag search, MOROZS can only guarantee the asymptotic convergence to local Pareto optimality. The efficiency of MOROZS is studied using three BOSO problems with noisy objective functions and is compared to that of Genetic Algorithms based NSGA-II and a recently developed method MO-COMPASS.

Suggested Citation

  • Wang, Honggang, 2017. "Multi-objective retrospective optimization using stochastic zigzag search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 946-960.
    • Handle: RePEc:eee:ejores:v:263:y:2017:i:3:p:946-960
    DOI: 10.1016/j.ejor.2017.06.039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717305805
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.06.039?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Audet, Charles & Savard, Gilles & Zghal, Walid, 2010. "A mesh adaptive direct search algorithm for multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 204(3), pages 545-556, August.
    2. Shukla, Pradyumn Kumar & Deb, Kalyanmoy, 2007. "On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1630-1652, September.
    3. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    4. Haobin Li & Loo Hay Lee & Ek Peng Chew & Peter Lendermann, 2015. "MO-COMPASS: a fast convergent search algorithm for multi-objective discrete optimization via simulation," IISE Transactions, Taylor & Francis Journals, vol. 47(11), pages 1153-1169, November.
    5. Oliver Schütze & Adanay Martín & Adriana Lara & Sergio Alvarado & Eduardo Salinas & Carlos Coello, 2016. "The directed search method for multi-objective memetic algorithms," Computational Optimization and Applications, Springer, vol. 63(2), pages 305-332, March.
    6. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    7. Oliver Schütze & Víctor Adrián Sosa Hernández & Heike Trautmann & Günter Rudolph, 2016. "The hypervolume based directed search method for multi-objective optimization problems," Journal of Heuristics, Springer, vol. 22(3), pages 273-300, June.
    8. Wang, Honggang, 2012. "Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation," European Journal of Operational Research, Elsevier, vol. 217(1), pages 141-148.
    9. Susan R. Hunter & Raghu Pasupathy, 2013. "Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 527-542, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    2. Tsai, Shing Chih & Fu, Sheng Yang, 2014. "Genetic-algorithm-based simulation optimization considering a single stochastic constraint," European Journal of Operational Research, Elsevier, vol. 236(1), pages 113-125.
    3. Honggang Wang, 2017. "Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 305-322, June.
    4. Kyle Cooper & Susan R. Hunter & Kalyani Nagaraj, 2020. "Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1080-1100, October.
    5. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    6. Ameknassi, Lhoussaine & Aït-Kadi, Daoud & Rezg, Nidhal, 2016. "Integration of logistics outsourcing decisions in a green supply chain design: A stochastic multi-objective multi-period multi-product programming model," International Journal of Production Economics, Elsevier, vol. 182(C), pages 165-184.
    7. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    8. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    9. Qi Fan & Jiaqiao Hu, 2018. "Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 677-693, November.
    10. Thai Doan Chuong, 2021. "Optimality and duality in nonsmooth composite vector optimization and applications," Annals of Operations Research, Springer, vol. 296(1), pages 755-777, January.
    11. Yuwei Zhou & Sigrún Andradóttir & Seong-Hee Kim & Chuljin Park, 2022. "Finding Feasible Systems for Subjective Constraints Using Recycled Observations," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3080-3095, November.
    12. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    13. Xu Lei & Tang Shiyun & Deng Yanfei & Yuan Yuan, 2020. "Sustainable operation-oriented investment risk evaluation and optimization for renewable energy project: a case study of wind power in China," Annals of Operations Research, Springer, vol. 290(1), pages 223-241, July.
    14. Shamsuddin Ahmed, 2013. "Performance of derivative free search ANN training algorithm with time series and classification problems," Computational Statistics, Springer, vol. 28(5), pages 1881-1914, October.
    15. Wang, Honggang, 2012. "Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation," European Journal of Operational Research, Elsevier, vol. 217(1), pages 141-148.
    16. Sigrún Andradóttir & Andrei A. Prudius, 2009. "Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 193-208, May.
    17. Walter J. Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    18. Srikanth Reddy, K. & Panwar, Lokesh & Panigrahi, B.K. & Kumar, Rajesh, 2018. "Modeling and analysis of profit based self scheduling of GENCO in electricity markets with renewable energy penetration and emission constraints," Renewable Energy, Elsevier, vol. 116(PA), pages 48-63.
    19. Saeid Delshad & Amin Khademi, 2020. "Information theory for ranking and selection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 239-253, June.
    20. Thai Doan Chuong, 2022. "Second-order cone programming relaxations for a class of multiobjective convex polynomial problems," Annals of Operations Research, Springer, vol. 311(2), pages 1017-1033, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:263:y:2017:i:3:p:946-960. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.