IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v125y2005i2d10.1007_s10957-004-1837-9.html
   My bibliography  Save this article

Vector Ordinal Optimization

Author

Listed:
  • Q. C. Zhao

    (Tsinghua University,Harvard University)

  • Y. C. Ho

    (Harvard University, Tsinghua University)

  • Q. S. Jia

    (Tsinghua University)

Abstract

Ordinal optimization is a tool to reduce the computational burden in simulation-based optimization problems. So far, the major effort in this field focuses on single-objective optimization. In this paper, we extend this to multiobjective optimization and develop vector ordinal optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multiobjective optimization. Our results lead to quantifiable subset selection sizes in the multiobjective case, which supplies guidance in solving practical problems, as demonstrated by the examples in this paper.

Suggested Citation

  • Q. C. Zhao & Y. C. Ho & Q. S. Jia, 2005. "Vector Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(2), pages 259-274, May.
    • Handle: RePEc:spr:joptap:v:125:y:2005:i:2:d:10.1007_s10957-004-1837-9
    DOI: 10.1007/s10957-004-1837-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-004-1837-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-004-1837-9?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. Michael C. Fu, 2002. "Feature Article: Optimization for simulation: Theory vs. Practice," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 192-215, August.
    2. S.Y. Lin & Y.C. Ho, 2002. "Universal Alignment Probability Revisited," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 399-407, May.
    3. T. W. Edward Lau & Y. C. Ho, 1997. "Universal Alignment Probabilities and Subset Selection for Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 93(3), pages 455-489, June.
    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. Noordhoek, Marije & Dullaert, Wout & Lai, David S.W. & de Leeuw, Sander, 2018. "A simulation–optimization approach for a service-constrained multi-echelon distribution network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 292-311.
    2. Roberto Aringhieri & Giuliana Carello & Daniela Morale, 2016. "Supporting decision making to improve the performance of an Italian Emergency Medical Service," Annals of Operations Research, Springer, vol. 236(1), pages 131-148, January.
    3. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    4. Vladimir I. Norkin & Yuri M. Ermoliev & Andrzej Ruszczyński, 1998. "On Optimal Allocation of Indivisibles Under Uncertainty," Operations Research, INFORMS, vol. 46(3), pages 381-395, June.
    5. Warren B. Powell, 2009. "What you should know about approximate dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 239-249, April.
    6. Jack P. C. Kleijnen & Susan M. Sanchez & Thomas W. Lucas & Thomas M. Cioppa, 2005. "State-of-the-Art Review: A User’s Guide to the Brave New World of Designing Simulation Experiments," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 263-289, August.
    7. S.-C. Horng & S.-Y. Lin, 2009. "Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 213-231, February.
    8. 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.
    9. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    10. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    11. Kleijnen, J.P.C. & Sanchez, S.M. & Lucas, T.W. & Cioppa, T.M., 2003. "A User's Guide to the Brave New World of Designing Simulation Experiments," Discussion Paper 2003-1, Tilburg University, Center for Economic Research.
    12. Junjie Jia & Nan Yang & Chao Xing & Haoze Chen & Songkai Liu & Yuehua Huang & Binxin Zhu, 2019. "An Improved Constrained Order Optimization Algorithm for Uncertain SCUC Problem Solving," Energies, MDPI, vol. 12(23), pages 1-19, November.
    13. Fu, Quanlu & Wu, Jiyan & Wu, Xuemian & Sun, Jian & Tian, Ye, 2024. "Managing network congestion with link-based incentives: A surrogate-based optimization approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 182(C).
    14. S.Y. Lin & Y.C. Ho, 2002. "Universal Alignment Probability Revisited," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 399-407, May.
    15. Michael C. Fu, 2008. "What you should know about simulation and derivatives," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(8), pages 723-736, December.
    16. Yue Zhang & Martin L. Puterman & Matthew Nelson & Derek Atkins, 2012. "A Simulation Optimization Approach to Long-Term Care Capacity Planning," Operations Research, INFORMS, vol. 60(2), pages 249-261, April.
    17. Majed Hadid & Adel Elomri & Regina Padmanabhan & Laoucine Kerbache & Oualid Jouini & Abdelfatteh El Omri & Amir Nounou & Anas Hamad, 2022. "Clustering and Stochastic Simulation Optimization for Outpatient Chemotherapy Appointment Planning and Scheduling," IJERPH, MDPI, vol. 19(23), pages 1-34, November.
    18. Simone Baldi & Iakovos Michailidis & Vasiliki Ntampasi & Elias Kosmatopoulos & Ioannis Papamichail & Markos Papageorgiou, 2019. "A Simulation-Based Traffic Signal Control for Congested Urban Traffic Networks," Service Science, INFORMS, vol. 53(1), pages 6-20, February.
    19. Kleijnen, J.P.C. & van Beers, W.C.M. & van Nieuwenhuyse, I., 2008. "Constrained Optimization in Simulation : A Novel Approach," Discussion Paper 2008-95, Tilburg University, Center for Economic Research.
    20. Jie Xu & Barry L. Nelson & L. Jeff Hong, 2013. "An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 133-146, February.

    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:spr:joptap:v:125:y:2005:i:2:d:10.1007_s10957-004-1837-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.