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

Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions

Author

Listed:
  • Liagkouras, Konstantinos
  • Metaxiotis, Konstantinos

Abstract

The fundamental unit of each evolutionary algorithm is the individual. Each individual represents a potential solution to the problem at hand. Despite the importance of individual solution for multi-objective algorithms’ performance the majority of the existing implementations select a simplistic approach by assuming identical behavior for all candidate solutions of a population. However, from the biological analogue we know that individuals do not react similarly to the same stimulus. This is called character and it is lacking from existing implementations. In this paper, we emulate the corresponding human social analogue by generating individuals that exhibit different behavior when are subject to the same stimulus. The implementation of different behaviors is facilitated through a novel mutation operator. The experimental results favor the proposed approach when compared with other state-of-the-art algorithms for a number of test instances.

Suggested Citation

  • Liagkouras, Konstantinos & Metaxiotis, Konstantinos, 2021. "Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1019-1036.
    • Handle: RePEc:eee:ejores:v:292:y:2021:i:3:p:1019-1036
    DOI: 10.1016/j.ejor.2020.11.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720309747
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.11.028?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. K. Liagkouras & K. Metaxiotis, 2015. "Efficient Portfolio Construction with the Use of Multiobjective Evolutionary Algorithms: Best Practices and Performance Metrics," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 14(03), pages 535-564.
    2. Beume, Nicola & Naujoks, Boris & Emmerich, Michael, 2007. "SMS-EMOA: Multiobjective selection based on dominated hypervolume," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1653-1669, September.
    3. Deb, Kalyanmoy & Tiwari, Santosh, 2008. "Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1062-1087, March.
    4. Drake, John H. & Starkey, Andrew & Owusu, Gilbert & Burke, Edmund K., 2020. "Multiobjective evolutionary algorithms for strategic deployment of resources in operational units," European Journal of Operational Research, Elsevier, vol. 282(2), pages 729-740.
    5. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F. & Sainz-Pardo, José L., 2020. "Multi-objective evolutionary algorithms for a reliability location problem," European Journal of Operational Research, Elsevier, vol. 283(1), pages 83-93.
    6. K. Liagkouras & K. Metaxiotis, 2019. "Improving the performance of evolutionary algorithms: a new approach utilizing information from the evolutionary process and its application to the fuzzy portfolio optimization problem," Annals of Operations Research, Springer, vol. 272(1), pages 119-137, January.
    7. Oliveira, Beatriz B. & Carravilla, Maria Antónia & Oliveira, José F. & Costa, Alysson M., 2019. "A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem," European Journal of Operational Research, Elsevier, vol. 276(2), pages 637-655.
    8. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    9. Guerreiro, Andreia P. & Fonseca, Carlos M., 2020. "An analysis of the Hypervolume Sharpe-Ratio Indicator," European Journal of Operational Research, Elsevier, vol. 283(2), pages 614-629.
    10. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    11. Konstantinos Liagkouras & Konstantinos Metaxiotis, 2018. "Examining the effect of different configuration issues of the multiobjective evolutionary algorithms on the efficient frontier formulation for the constrained portfolio optimization problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(3), pages 416-438, March.
    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. Koziel, Slawomir & Pietrenko-Dabrowska, Anna, 2022. "Constrained multi-objective optimization of compact microwave circuits by design triangulation and pareto front interpolation," European Journal of Operational Research, Elsevier, vol. 299(1), pages 302-312.

    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. K. Liagkouras & K. Metaxiotis & G. Tsihrintzis, 2022. "Incorporating environmental and social considerations into the portfolio optimization process," Annals of Operations Research, Springer, vol. 316(2), pages 1493-1518, September.
    2. Audet, Charles & Bigeon, Jean & Cartier, Dominique & Le Digabel, Sébastien & Salomon, Ludovic, 2021. "Performance indicators in multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 292(2), pages 397-422.
    3. K. Liagkouras & K. Metaxiotis, 2019. "Improving the performance of evolutionary algorithms: a new approach utilizing information from the evolutionary process and its application to the fuzzy portfolio optimization problem," Annals of Operations Research, Springer, vol. 272(1), pages 119-137, January.
    4. Duro, João A. & Ozturk, Umud Esat & Oara, Daniel C. & Salomon, Shaul & Lygoe, Robert J. & Burke, Richard & Purshouse, Robin C., 2023. "Methods for constrained optimization of expensive mixed-integer multi-objective problems, with application to an internal combustion engine design problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 421-446.
    5. K. Liagkouras & K. Metaxiotis, 2018. "A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem," Annals of Operations Research, Springer, vol. 267(1), pages 281-319, August.
    6. Londe, Mariana A. & Pessoa, Luciana S. & Andrade, Carlos E. & Resende, Mauricio G.C., 2025. "Biased random-key genetic algorithms: A review," European Journal of Operational Research, Elsevier, vol. 321(1), pages 1-22.
    7. Vahid Baradaran & Amir Hossein Hosseinian, 2020. "A bi-objective model for redundancy allocation problem in designing server farms: mathematical formulation and solution approaches," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(5), pages 935-952, October.
    8. Gong, Wenyin & Cai, Zhihua, 2009. "An improved multiobjective differential evolution based on Pareto-adaptive [epsilon]-dominance and orthogonal design," European Journal of Operational Research, Elsevier, vol. 198(2), pages 576-601, October.
    9. Andrea Ponti & Antonio Candelieri & Ilaria Giordani & Francesco Archetti, 2023. "Intrusion Detection in Networks by Wasserstein Enabled Many-Objective Evolutionary Algorithms," Mathematics, MDPI, vol. 11(10), pages 1-14, May.
    10. David Quintana & Roman Denysiuk & Sandra García-Rodríguez & Antonio Gaspar-Cunha, 2017. "Portfolio implementation risk management using evolutionary multiobjective optimization," Post-Print hal-01881379, HAL.
    11. Wang, Long & Wu, Jianghai & Wang, Tongguang & Han, Ran, 2020. "An optimization method based on random fork tree coding for the electrical networks of offshore wind farms," Renewable Energy, Elsevier, vol. 147(P1), pages 1340-1351.
    12. Yunsong Han & Hong Yu & Cheng Sun, 2017. "Simulation-Based Multiobjective Optimization of Timber-Glass Residential Buildings in Severe Cold Regions," Sustainability, MDPI, vol. 9(12), pages 1-18, December.
    13. Yeudiel Lara Moreno & Carlos Ignacio Hernández Castellanos, 2024. "A Hierarchical Approach to a Tri-Objective Portfolio Optimization Problem Considering an ESG Index," Mathematics, MDPI, vol. 12(19), pages 1-16, October.
    14. Laumanns, Marco & Zenklusen, Rico, 2011. "Stochastic convergence of random search methods to fixed size Pareto front approximations," European Journal of Operational Research, Elsevier, vol. 213(2), pages 414-421, September.
    15. Ivo Couckuyt & Dirk Deschrijver & Tom Dhaene, 2014. "Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization," Journal of Global Optimization, Springer, vol. 60(3), pages 575-594, November.
    16. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
    17. Hang Xu, 2024. "A Dynamic Tasking-Based Evolutionary Algorithm for Bi-Objective Feature Selection," Mathematics, MDPI, vol. 12(10), pages 1-23, May.
    18. Ziqian Wang & Xin Huang & Yan Zhang & Danju Lv & Wei Li & Zhicheng Zhu & Jian’e Dong, 2024. "Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance," Mathematics, MDPI, vol. 12(22), pages 1-19, November.
    19. Massimiliano Kaucic & Filippo Piccotto & Gabriele Sbaiz & Giorgio Valentinuz, 2023. "Optimal Portfolio with Sustainable Attitudes under Cumulative Prospect Theory," Journal of Applied Finance & Banking, SCIENPRESS Ltd, vol. 13(4), pages 1-4.
    20. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, 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:292:y:2021:i:3:p:1019-1036. 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.