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

Cross entropy for multiobjective combinatorial optimization problems with linear relaxations

Author

Listed:
  • Caballero, Rafael
  • Hernández-Díaz, Alfredo G.
  • Laguna, Manuel
  • Molina, Julián

Abstract

While the cross entropy methodology has been applied to a fair number of combinatorial optimization problems with a single objective, its adaptation to multiobjective optimization has been sporadic. We develop a multiobjective optimization cross entropy (MOCE) procedure for combinatorial optimization problems for which there is a linear relaxation (obtained by ignoring the integrality restrictions) that can be solved in polynomial time. The presence of a relaxation that can be solved with modest computational time is an important characteristic of the problems under consideration because our procedure is designed to exploit relaxed solutions. This is done with a strategy that divides the objective function space into areas and a mechanism that seeds these areas with relaxed solutions. Our main interest is to tackle problems whose solutions are represented by binary variables and whose relaxation is a linear program. Our tests with multiobjective knapsack problems and multiobjective assignment problems show the merit of the proposed procedure.

Suggested Citation

  • Caballero, Rafael & Hernández-Díaz, Alfredo G. & Laguna, Manuel & Molina, Julián, 2015. "Cross entropy for multiobjective combinatorial optimization problems with linear relaxations," European Journal of Operational Research, Elsevier, vol. 243(2), pages 362-368.
    • Handle: RePEc:eee:ejores:v:243:y:2015:i:2:p:362-368
    DOI: 10.1016/j.ejor.2014.07.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714006122
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.07.046?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. Bekker, James & Aldrich, Chris, 2011. "The cross-entropy method in multi-objective optimisation: An assessment," European Journal of Operational Research, Elsevier, vol. 211(1), pages 112-121, May.
    2. Rubinstein, Reuven Y., 1997. "Optimization of computer simulation models with rare events," European Journal of Operational Research, Elsevier, vol. 99(1), pages 89-112, May.
    3. Dirk P. Kroese & Sergey Porotsky & Reuven Y. Rubinstein, 2006. "The Cross-Entropy Method for Continuous Multi-Extremal Optimization," Methodology and Computing in Applied Probability, Springer, vol. 8(3), pages 383-407, September.
    4. A. Charnes & W. W. Cooper & A. Stedry, 1969. "Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design," Management Science, INFORMS, vol. 15(8), pages 365-375, April.
    5. Pieter-Tjerk de Boer & Dirk Kroese & Shie Mannor & Reuven Rubinstein, 2005. "A Tutorial on the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 19-67, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang-peng Tian & Hong-yu Zhang & Jing Wang & Jian-qiang Wang & Xiao-hong Chen, 2016. "Multi-criteria decision-making method based on a cross-entropy with interval neutrosophic sets," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(15), pages 3598-3608, November.

    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. Heath, Jeffrey W. & Fu, Michael C. & Jank, Wolfgang, 2009. "New global optimization algorithms for model-based clustering," Computational Statistics & Data Analysis, Elsevier, vol. 53(12), pages 3999-4017, October.
    2. Nguyen, Hoa T.M. & Chow, Andy H.F. & Ying, Cheng-shuo, 2021. "Pareto routing and scheduling of dynamic urban rail transit services with multi-objective cross entropy method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    3. Hao Su & Qun Niu & Zhile Yang, 2023. "Optimal Power Flow Using Improved Cross-Entropy Method," Energies, MDPI, vol. 16(14), pages 1-33, July.
    4. Fahimnia, Behnam & Sarkis, Joseph & Eshragh, Ali, 2015. "A tradeoff model for green supply chain planning:A leanness-versus-greenness analysis," Omega, Elsevier, vol. 54(C), pages 173-190.
    5. Zheng Peng & Donghua Wu & Quan Zheng, 2013. "A Level-Value Estimation Method and Stochastic Implementation for Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 156(2), pages 493-523, February.
    6. Qun Niu & Ming You & Zhile Yang & Yang Zhang, 2021. "Economic Emission Dispatch Considering Renewable Energy Resources—A Multi-Objective Cross Entropy Optimization Approach," Sustainability, MDPI, vol. 13(10), pages 1-33, May.
    7. Zheng Peng & Donghua Wu & Wenxing Zhu, 2016. "The robust constant and its applications in random global search for unconstrained global optimization," Journal of Global Optimization, Springer, vol. 64(3), pages 469-482, March.
    8. Charles Audet & Jean Bigeon & Romain Couderc, 2021. "Combining Cross-Entropy and MADS Methods for Inequality Constrained Global Optimization," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    9. Erik Hintz & Marius Hofert & Christiane Lemieux & Yoshihiro Taniguchi, 2022. "Single-Index Importance Sampling with Stratification," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 3049-3073, December.
    10. Mattrand, C. & Bourinet, J.-M., 2014. "The cross-entropy method for reliability assessment of cracked structures subjected to random Markovian loads," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 171-182.
    11. Kin-Ping Hui, 2011. "Cooperative Cross-Entropy method for generating entangled networks," Annals of Operations Research, Springer, vol. 189(1), pages 205-214, September.
    12. Mathieu Balesdent & Jérôme Morio & Loïc Brevault, 2016. "Rare Event Probability Estimation in the Presence of Epistemic Uncertainty on Input Probability Distribution Parameters," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 197-216, March.
    13. 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.
    14. Karim Sebaa & Abdelhalim Tlemçani & Mounir Bouhedda & Noureddine Henini, 2013. "Multiobjective Optimization Using Cross-Entropy Approach," Journal of Optimization, Hindawi, vol. 2013, pages 1-9, December.
    15. A. Shibu & M. Reddy, 2014. "Optimal Design of Water Distribution Networks Considering Fuzzy Randomness of Demands Using Cross Entropy Optimization," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 28(12), pages 4075-4094, September.
    16. Papaioannou, Iason & Geyer, Sebastian & Straub, Daniel, 2019. "Improved cross entropy-based importance sampling with a flexible mixture model," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    17. Govindan, Kannan & Gholizadeh, Hadi, 2021. "Robust network design for sustainable-resilient reverse logistics network using big data: A case study of end-of-life vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    18. Ferdinand Bollwein & Stephan Westphal, 2022. "Oblique decision tree induction by cross-entropy optimization based on the von Mises–Fisher distribution," Computational Statistics, Springer, vol. 37(5), pages 2203-2229, November.
    19. Dirk P. Kroese & Sergey Porotsky & Reuven Y. Rubinstein, 2006. "The Cross-Entropy Method for Continuous Multi-Extremal Optimization," Methodology and Computing in Applied Probability, Springer, vol. 8(3), pages 383-407, September.
    20. Jiaqiao Hu & Michael C. Fu & Steven I. Marcus, 2007. "A Model Reference Adaptive Search Method for Global Optimization," Operations Research, INFORMS, vol. 55(3), pages 549-568, June.

    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:243:y:2015:i:2:p:362-368. 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.