This paper introduces a new problem in the field of combinatorial optimization. This problem can be named as the ring star problem with secondary sub-depots (RSPSSD). RSPSSD has one fixed main depot, and it allows a network to be divided into three types of nodes, namely primary sub-depots (includes the main depot too), secondary sub-depots and left out nodes. The challenge of the problem is to select some primary and secondary sub-depots that minimize the total routing cost which has three components. The first one is the routing cost of the main circuit that covers all the primary sub-depots including the main depot. The second one is the total routing cost of all the secondary circuits, each of which covers a set of few secondary sub-depots and their nearest primary sub-depot. The secondary circuits also have a constraint on the number of secondary sub-depots in it. The last one is the assignment cost of the left out nodes to their nearest concentrators which is nothing but anyone from the main depot, primary or secondary sub-depots. The proposed RSPSSD problem is solved with the proposed modified discrete antlion optimizer and tested using some TSP benchmark instances. The random walk of an antlion and an ant is encoded with ternary number system. The statistical analysis and comparison of the result against some other algorithms are also presented. A real-life case study has also been shown to validate the proposed model and algorithm.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Baldacci R, Dell’Amico M (2010) Heuristic algorithms for the multi-depot ring star problem. Eur J Oper Res 203(1):270–281
Baldacci R, Dell’Amico M, Salazar González JJ (2007) The capacitated m-ring star problem. Oper Res 55(6):1147–1162
Bodin P, Horton S (2004) Source parameters and tectonic implications of aftershocks of the \(M_w\) 7.6 Bhuj earthquake of 26 January 2001. Bull Seismol Soc Am 94(3):818–827
Calvete HI, Galé C, Iranzo JA (2013) An efficient evolutionary algorithm for the ring star problem. Eur J Oper Res 231:22–33
Dias TCS, de Sousa Filho GF, Macambira EM, Cabral LAF, Fampa MHC (2006) An efficient heuristic for the ring star problem. In: Alvarez C, Serna M (eds) Experimental algorithms. Lecture notes in computer science. Springer, Berlin, pp 24–35 (No. 4007)
Kedad-Sidhoum S, Nguyen VH (2010) An exact algorithm for solving the ring star problem. Optimization 59(1):125–140
Labbe M, Laporte G, Rodriguez Martin I, Salazar Gonzalez JJ (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177–189
Labbe M, Laporte G, Rodriguez Martin I, Salazar Gonzalez JJ (1999) The median cycle problem. Working paper, CRT-99-29, Université de Montréal
Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98
Mirjalili S, Jangir P, Saremi S (2016) Multi-objective ant lion optimizer: a multiobjective optimization algorithm for solving engineering problems. Appl Intell 45(1):79–95
Moreno Perez JA, Moreno Vega JM, Rodriguez Martin I (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151(2):365–378
Naji-Azimi Z, Salari M, Toth P (2012) An integer linear programming based heuristic for the capacitated m-ring-star problem. Eur J Oper Res 217(1):17–25
Rikalovic A, Soares GA, Ignjatic J (2018) Spatial analysis of logistics center location: a comprehensive approach. Decis Mak Appl Manag Eng 1(1):38–50. https://doi.org/10.31181/dmame180138r
Simonetti L, Frota Y, de Souza CC (2011) The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discrete Appl Math 159(16):1901–1914
Sinha A (2016) The Gujarat earthquake 2001, Asian Disaster Reduction Center. Asian Disaster Reduction Center. Retrieved 20 July 2016
Yang J, Shi X, Marchese Y, Liang Y (2008) An ant colony optimization method for generalized TSP problem. Prog Nat Sci 18:1417–1422
Yogaranjan G, Revathi T (2016) A discrete ant lion optimization (DALO) algorithm for solving data gathering tour problem in wireless sensor networks. Middle-East J Sci Res 24(10):3113–3120
Conflict of interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Mukherjee, A., Barma, P.S., Dutta, J. et al. A modified discrete antlion optimizer for the ring star problem with secondary sub-depots. Neural Comput & Applic 32, 8143–8156 (2020). https://doi.org/10.1007/s00521-019-04292-9
- Network optimization
- Ring star problem
- Median cycle problem
- Discrete antlion optimizer