IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i3d10.1007_s12351-021-00623-8.html
   My bibliography  Save this article

A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots

Author

Listed:
  • Anupam Mukherjee

    (National Institute of Technology Durgapur)

  • Partha Sarathi Barma

    (NSHM Knowledge Campus)

  • Joydeep Dutta

    (Kazi Nazrul University)

  • Goutam Panigrahi

    (National Institute of Technology Durgapur)

  • Samarjit Kar

    (National Institute of Technology Durgapur)

  • Manoranjan Maiti

    (Vidyasagar University)

Abstract

This article proposes a multi-objective ring tree problem with secondary sub-depots (MORTPSSD), which focusses on the problems of telecommunication and logistics networks. In this problem, we have considered a fixed node as the main depot. Other nodes are divided into primary sub-depots, secondary sub-depots, and left-out nodes referred to type 1, type 2, and type 3 customers. The first objective of the proposed model MORTPSSD is to minimize the circuits’ total routing cost through type 1 and type 2 customers added by the minimal spanning tree cost of type 3 customers. The second objective is to minimize the total number of type 3 customers, which influences the first objective. The model is solved by a discrete multi-objective antlion optimizer (DMOALO) with a ternary encoding. The proposed algorithm is also tested on some instances derived from TSP benchmark problems. Statistical analyses are performed to compare the convergence and the diversity of the proposed DMOALO against NSGAII and MOPSO, which yields a better efficiency of DMOALO for most instances.

Suggested Citation

  • Anupam Mukherjee & Partha Sarathi Barma & Joydeep Dutta & Goutam Panigrahi & Samarjit Kar & Manoranjan Maiti, 2022. "A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots," Operational Research, Springer, vol. 22(3), pages 1813-1851, July.
  • Handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00623-8
    DOI: 10.1007/s12351-021-00623-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-021-00623-8
    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/s12351-021-00623-8?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. Rahul Roy & Satchidananda Dehuri & Sung Bae Cho, 2011. "A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(4), pages 41-57, October.
    2. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    3. Madhabananda Das & Rahul Roy & Satchidananda Dehuri & Sung-Bae Cho, 2011. "A New Approach to Associative Classification Based on Binary Multi-objective Particle Swarm Optimization," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(2), pages 51-73, April.
    4. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2013. "An efficient evolutionary algorithm for the ring star problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 22-33.
    5. Alessandro Hill & Stefan Voß, 2016. "Optimal capacitated ring trees," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 137-166, May.
    6. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    7. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2012. "An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 17-25.
    8. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    9. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
    10. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    11. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, 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. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    2. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    3. Baldacci, Roberto & Hoshino, Edna A. & Hill, Alessandro, 2023. "New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 538-553.
    4. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    5. Baldacci, Roberto & Hill, Alessandro & Hoshino, Edna A. & Lim, Andrew, 2017. "Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms," European Journal of Operational Research, Elsevier, vol. 262(3), pages 879-893.
    6. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 2021. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 499-523, October.
    7. Alessandro Hill & Roberto Baldacci & Edna Ayako Hoshino, 2019. "Capacitated ring arborescence problems with profits," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 357-389, June.
    8. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    9. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 0. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-25.
    10. Olmez, Omer Berk & Gultekin, Ceren & Balcik, Burcu & Ekici, Ali & Özener, Okan Örsan, 2022. "A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 187-202.
    11. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    12. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
    13. Amiri, Mosleh & Farvaresh, Hamid, 2023. "Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 596-617.
    14. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2012. "An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 17-25.
    15. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2013. "An efficient evolutionary algorithm for the ring star problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 22-33.
    16. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    17. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    18. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    19. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    20. Agatz, N.A.H. & Bouman, P.C. & Schmidt, M.E., 2016. "Optimization Approaches for the Traveling Salesman Problem with Drone," ERIM Report Series Research in Management ERS-2015-011-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00623-8. 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.