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

A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem

Author

Listed:
  • Sahinkoc, H. Mert
  • Bilge, Ümit

Abstract

Despite the growing interest on many-objective evolutionary algorithms, studies on combinatorial problems are still rare. In this study, we choose many-objective knapsack problem (MaOKP) as the benchmark and target the challenges imposed by many-objectives in discrete search spaces by investigating several reference set handling approaches and combining several prominent evolutionary strategies in an innovative fashion. Our proposed algorithm uses elitist nondominated sorting and reference set based sorting, however reference points are mapped onto a fixed hyperplane obtained at the beginning of the algorithm. All evolutionary mechanisms are designed in a way to complement the reference set based sorting. Reference point guided path relinking is proposed as the recombination scheme for this purpose. Repair and local improvement procedures are also guided by reference points. Moreover, the reference set co-evolves simultaneously with the solution set, using both cooperative and competitive interactions to balance diversity and convergence, and adapts to the topology of the Pareto front in a self-adaptive parametric way. Numerical experiments display the success of the proposed algorithm compared to state-of-art approaches and yield the best results for MaOKP. The findings are inspiring and encouraging for the use of co-evolutionary reference set based techniques for combinatorial optimization.

Suggested Citation

  • Sahinkoc, H. Mert & Bilge, Ümit, 2022. "A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 405-417.
  • Handle: RePEc:eee:ejores:v:300:y:2022:i:2:p:405-417
    DOI: 10.1016/j.ejor.2021.10.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721008833
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2021.10.033?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. Sato, Hiroyuki & Aguirre, Hernan E. & Tanaka, Kiyoshi, 2007. "Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1708-1723, September.
    2. Wang, Rui & Purshouse, Robin C. & Fleming, Peter J., 2015. "Preference-inspired co-evolutionary algorithms using weight vectors," European Journal of Operational Research, Elsevier, vol. 243(2), pages 423-441.
    3. Ishibuchi, Hisao & Narukawa, Kaname & Tsukamoto, Noritaka & Nojima, Yusuke, 2008. "An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 188(1), pages 57-75, July.
    4. Figueira, J.R. & Liefooghe, A. & Talbi, E.-G. & Wierzbicki, A.P., 2010. "A parallel multiple reference point approach for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 205(2), pages 390-400, September.
    5. Goh, C.K. & Tan, K.C. & Liu, D.S. & Chiam, S.C., 2010. "A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design," European Journal of Operational Research, Elsevier, vol. 202(1), pages 42-54, April.
    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. Jaszczur, Marek & Hassan, Qusay & Palej, Patryk & Abdulateef, Jasim, 2020. "Multi-Objective optimisation of a micro-grid hybrid power system for household application," Energy, Elsevier, vol. 202(C).
    2. Gui Li & Gai-Ge Wang & Shan Wang, 2021. "Two-Population Coevolutionary Algorithm with Dynamic Learning Strategy for Many-Objective Optimization," Mathematics, MDPI, vol. 9(4), pages 1-34, February.
    3. Cem P. Cetinkaya & Mert Can Gunacti, 2018. "Multi-Criteria Analysis of Water Allocation Scenarios in a Water Scarce Basin," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(8), pages 2867-2884, June.
    4. Guozheng Li & Rui Wang & Tao Zhang & Mengjun Ming, 2018. "Multi-Objective Optimal Design of Renewable Energy Integrated CCHP System Using PICEA-g," Energies, MDPI, vol. 11(4), pages 1-26, March.
    5. Mancini, Simona & Triki, Chefi & Piya, Sujan, 2022. "Optimal selection of touristic packages based on user preferences during sports mega-events," European Journal of Operational Research, Elsevier, vol. 302(3), pages 819-830.
    6. Mengjun Ming & Rui Wang & Yabing Zha & Tao Zhang, 2017. "Multi-Objective Optimization of Hybrid Renewable Energy System Using an Enhanced Multi-Objective Evolutionary Algorithm," Energies, MDPI, vol. 10(5), pages 1-15, May.
    7. Steuer, Ralph E. & Utz, Sebastian, 2023. "Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing," European Journal of Operational Research, Elsevier, vol. 306(2), pages 742-753.
    8. Qiang Yang & Yuanpeng Zhu & Xudong Gao & Dongdong Xu & Zhenyu Lu, 2022. "Elite Directed Particle Swarm Optimization with Historical Information for High-Dimensional Problems," Mathematics, MDPI, vol. 10(9), pages 1-29, April.
    9. Luda Zhao & Bin Wang & Congyong Shen, 2021. "A multi-objective scheduling method for operational coordination time using improved triangular fuzzy number representation," PLOS ONE, Public Library of Science, vol. 16(6), pages 1-31, June.
    10. Taher Ahmadi & Bo van der Rhee, 2023. "Multiobjective Line Balancing Game: Collaboration and Peer Evaluation," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 179-195, May.
    11. Jiang, Yuanchun & Liu, Yezheng & Shang, Jennifer & Yildirim, Pinar & Zhang, Qingfu, 2018. "Optimizing online recurring promotions for dual-channel retailers: Segmented markets with multiple objectives," European Journal of Operational Research, Elsevier, vol. 267(2), pages 612-627.
    12. Liang, Wen Yau & Huang, Chun-Che & Lin, Yin-Chen & Chang, Tsun Hsien & Shih, Meng Hao, 2013. "The multi-objective label correcting algorithm for supply chain modeling," International Journal of Production Economics, Elsevier, vol. 142(1), pages 172-178.
    13. Goh, C.K. & Tan, K.C. & Liu, D.S. & Chiam, S.C., 2010. "A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design," European Journal of Operational Research, Elsevier, vol. 202(1), pages 42-54, April.
    14. Lakmali Weerasena & Aniekan Ebiefung & Anthony Skjellum, 2022. "Design of a heuristic algorithm for the generalized multi-objective set covering problem," Computational Optimization and Applications, Springer, vol. 82(3), pages 717-751, July.
    15. Kristina Yancey Spencer & Pavel V. Tsvetkov & Joshua J. Jarrell, 2019. "A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects," Journal of Heuristics, Springer, vol. 25(1), pages 1-45, February.
    16. Yadav, Deepanshu & Nagar, Deepak & Ramu, Palaniappan & Deb, Kalyanmoy, 2023. "Visualization-aided multi-criteria decision-making using interpretable self-organizing maps," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1183-1200.
    17. Lin, Qiuzhen & Li, Jianqiang & Du, Zhihua & Chen, Jianyong & Ming, Zhong, 2015. "A novel multi-objective particle swarm optimization with multiple search strategies," European Journal of Operational Research, Elsevier, vol. 247(3), pages 732-744.
    18. Neungmatcha, Woraya, 2016. "Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operationsAuthor-Name: Sethanan, Kanchana," European Journal of Operational Research, Elsevier, vol. 252(3), pages 969-984.
    19. Liefooghe, Arnaud & Jourdan, Laetitia & Talbi, El-Ghazali, 2011. "A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO," European Journal of Operational Research, Elsevier, vol. 209(2), pages 104-112, March.
    20. Wang, Rui & Li, Guozheng & Ming, Mengjun & Wu, Guohua & Wang, Ling, 2017. "An efficient multi-objective model and algorithm for sizing a stand-alone hybrid renewable energy system," Energy, Elsevier, vol. 141(C), pages 2288-2299.

    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:300:y:2022:i:2:p:405-417. 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.