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

An elitism based multi-objective artificial bee colony algorithm

Author

Listed:
  • Xiang, Yi
  • Zhou, Yuren
  • Liu, Hailin

Abstract

In this paper, we suggest a new multi-objective artificial bee colony (ABC) algorithm by introducing an elitism strategy. The algorithm uses a fixed-size archive that is maintained based on crowding-distance to store non-dominated solutions found during the search process. In the proposed algorithm, an improved artificial bee colony algorithm with an elitism strategy is adopted for the purpose of avoiding premature convergence. Specifically, the elites in the archive are selected and used to generate new food sources in both employed and onlooker bee phases in each cycle. To keep diversity, a member located at the most crowded region will be removed when the archive overflows. The algorithm is very easy to be implemented and it employs only a few control parameters. The proposed algorithm is tested on a wide range of multi-objective problems, and compared with other state-of-the-art algorithms in terms of often-used quality indicators with the help of a nonparametric test. It is revealed by the test procedure that the algorithm produces better or comparable results when compared with other well-known algorithms, and it can be used as a promising alternative tool to solve multi-objective problems with the advantage of being simple and effective.

Suggested Citation

  • Xiang, Yi & Zhou, Yuren & Liu, Hailin, 2015. "An elitism based multi-objective artificial bee colony algorithm," European Journal of Operational Research, Elsevier, vol. 245(1), pages 168-193.
    • Handle: RePEc:eee:ejores:v:245:y:2015:i:1:p:168-193
    DOI: 10.1016/j.ejor.2015.03.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715001988
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.03.005?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. Bahriye Akay, 2013. "Synchronous and asynchronous Pareto-based multi-objective Artificial Bee Colony algorithms," Journal of Global Optimization, Springer, vol. 57(2), pages 415-445, October.
    2. Yi Xiang & Yuming Peng & Yubin Zhong & Zhenyu Chen & Xuwen Lu & Xuejun Zhong, 2014. "A particle swarm inspired multi-elitist artificial bee colony algorithm for real-parameter optimization," Computational Optimization and Applications, Springer, vol. 57(2), pages 493-516, March.
    3. Szeto, W.Y. & Wu, Yongzhong & Ho, Sin C., 2011. "An artificial bee colony algorithm for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 126-135, November.
    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. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2020. "Multiobjective optimization inspired by behavior of jellyfish for solving structural design problems," Chaos, Solitons & Fractals, Elsevier, vol. 135(C).
    2. Zouache, Djaafar & Moussaoui, Abdelouahab & Ben Abdelaziz, Fouad, 2018. "A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 74-88.
    3. Jiang, Haiyan & Wang, Jianzhou & Wu, Jie & Geng, Wei, 2017. "Comparison of numerical methods and metaheuristic optimization algorithms for estimating parameters for wind energy potential assessment in low wind regions," Renewable and Sustainable Energy Reviews, Elsevier, vol. 69(C), pages 1199-1217.
    4. Nien-Che Yang & Danish Mehmood & Kai-You Lai, 2021. "Multi-Objective Artificial Bee Colony Algorithm with Minimum Manhattan Distance for Passive Power Filter Optimization Problems," Mathematics, MDPI, vol. 9(24), pages 1-19, December.
    5. Cui, Yibing & Hu, Wei & Rahmani, Ahmed, 2023. "Fractional-order artificial bee colony algorithm with application in robot path planning," European Journal of Operational Research, Elsevier, vol. 306(1), pages 47-64.

    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. Nien-Che Yang & Danish Mehmood & Kai-You Lai, 2021. "Multi-Objective Artificial Bee Colony Algorithm with Minimum Manhattan Distance for Passive Power Filter Optimization Problems," Mathematics, MDPI, vol. 9(24), pages 1-19, December.
    2. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.
    3. Huang, Wentao & Jian, Sisi & Rey, David, 2024. "Non-additive network pricing with non-cooperative mobility service providers," European Journal of Operational Research, Elsevier, vol. 318(3), pages 802-824.
    4. Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    5. Qi Liu & Gengzhong Feng & Nengmin Wang & Giri Kumar Tayi, 2018. "A multi-objective model for discovering high-quality knowledge based on data quality and prior knowledge," Information Systems Frontiers, Springer, vol. 20(2), pages 401-416, April.
    6. Qi Liu & Gengzhong Feng & Giri Kumar Tayi & Jun Tian, 2021. "Managing Data Quality of the Data Warehouse: A Chance-Constrained Programming Approach," Information Systems Frontiers, Springer, vol. 23(2), pages 375-389, April.
    7. Jonathan Oesterle & Lionel Amodeo & Farouk Yalaoui, 2019. "A comparative study of Multi-Objective Algorithms for the Assembly Line Balancing and Equipment Selection Problem under consideration of Product Design Alternatives," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1021-1046, March.
    8. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    9. Min-Xia Zhang & Hong-Fan Yan & Jia-Yu Wu & Yu-Jun Zheng, 2020. "Quarantine Vehicle Scheduling for Transferring High-Risk Individuals in Epidemic Areas," IJERPH, MDPI, vol. 17(7), pages 1-17, March.
    10. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    11. Janmenjoy Nayak & Bighnaraj Naik, 2018. "A Novel Honey-Bees Mating Optimization Approach with Higher order Neural Network for Classification," Journal of Classification, Springer;The Classification Society, vol. 35(3), pages 511-548, October.
    12. Gao, Wei-feng & Huang, Ling-ling & Liu, San-yang & Chan, Felix T.S. & Dai, Cai & Shan, Xian, 2015. "Artificial bee colony algorithm with multiple search strategies," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 269-287.
    13. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    14. Fu, Hao & Lam, William H.K. & Shao, Hu & Ma, Wei & Chen, Bi Yu & Ho, H.W., 2022. "Optimization of multi-type sensor locations for simultaneous estimation of origin-destination demands and link travel times with covariance effects," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 19-47.
    15. Ling Wang & Lu An & Jiaxing Pi & Minrui Fei & Panos M. Pardalos, 2017. "A diverse human learning optimization algorithm," Journal of Global Optimization, Springer, vol. 67(1), pages 283-323, January.
    16. Chen, Jingxu & Liu, Zhiyuan & Zhu, Senlai & Wang, Wei, 2015. "Design of limited-stop bus service with capacity constraint and stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 1-15.
    17. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    18. Tingxi Wen & Zhongnan Zhang & Kelvin K L Wong, 2016. "Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-22, May.
    19. Phan Nguyen Ky Phuc & Nguyen Le Phuong Thao, 2021. "Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets," Logistics, MDPI, vol. 5(2), pages 1-13, May.
    20. Abbas Tarhini & Kassem Danach & Antoine Harfouche, 2022. "Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers," Annals of Operations Research, Springer, vol. 308(1), pages 549-570, January.

    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:245:y:2015:i:1:p:168-193. 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.