Abstract
The ring star problem (RSP) involves finding a minimum-length cycle over a set of nodes, for which each node that is non-visited on a cycle is assigned to its closest node on the cycle. The goal is to minimize routing and assignment costs. This study proposes a mathematical model to formulate RSP by using bi-level programming ideas, which consist of one leader and one follower sub-problems. The leader sub-problem refers to constructing a cycle over a subset of nodes in the network, whereas the follower sub-problem is related to assigning the remaining nodes to the nodes on the cycle. An efficient hybrid ant colony system (ACS) algorithm is developed on the basis of the bi-level programming formulations, in which ACS with assignment pheromone is proposed to solve the leader sub-problem. Lastly, the hybrid ACS is tested on 153 benchmark instances. Results show the good performance of the proposed approach.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Perez JAM, Moreno-Vega JM, Martin IR (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151:365–378
Renaud J, Boctor FF, Laporte G (2004) Efficient heuristics for median cycle problems. J Oper Res Soc 55:179–186
Labbe M, Laporte G, Martin IR, Gonzalez JJS (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43:177–189
Kedad-Sidhoum S, Viet Hung N (2010) An exact algorithm for solving the ring star problem. Optimization 59:125–140
Simonetti L, Frota Y, de Souza CC (2011) The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discret Appl Math 159:1901–1914
Calvete HI, Gale C, Iranzo JA (2015) An efficient evolutionary algorithm for the ring star problem (vol 231, pg 22, 2013). Eur J Oper Res 246:343–343
Baldacci R, Dell'Amico M, Gonzalez JS (2007) The capacitated m-ring-star problem. Oper Res 55:1147–1162
Baldacci R, Hill A, Hoshino EA, Lim A (2017) Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur J Oper Res 262:879–893
Naji-Azimi Z, Salari M, Toth P (2010) A heuristic procedure for the capacitated m-ring-star problem. Eur J Oper Res 207:1227–1234
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:17–25
Hoshino EA, de Souza CC (2012) A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret Appl Math 160:2728–2741
Zhang Z, Qin H, Lim A (2014) A memetic algorithm for the capacitated m-ring-star problem. Appl Intell 40:305–321
Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23:208–213
Golden B, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24:534–553
Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39:2594–2602
Shaelaie MH, Salari M, Naji-Azimi Z (2014) The generalized covering traveling salesman problem. Appl Soft Comput 24:867–878
Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244–251
Ozbaygin G, Yaman H, Karasan OE (2016) Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput Oper Res 76:226–237
Venkatesh P, Singh A (2019) An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Appl Soft Comput 78:481–495
Abualigah LM, Khader AT, Hanandeh ES, Gandomi AH (2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. Appl Soft Comput 60:423–435
He L, Huang S (2020) An efficient krill herd algorithm for color image multilevel thresholding segmentation problem, applied soft computing, 89
Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. Journal of Computational Science 25:456–466
Saeedi S, Khorsand R, Bidgoli SG, Ramezanpour M (2020) Improved many-objective particle swarm optimization algorithm for scientific workflow scheduling in cloud computing. Computers & Industrial Engineering, 147
Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110
Andrade CE, Toso RF, Goncalves JF, Resende MGC (2020) The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. Eur J Oper Res 289:17–30
Kilic H, Yuzgec U (2019) Improved antlion optimization algorithm via tournament selection and its application to parallel machine scheduling. Comput Ind Eng 132:166–186
Abualigah L, Diabat A (2020) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Clust Comput
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66
Qin W, Zhuang ZL, Liu Y, Tang O (2019) A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Computers & Industrial Engineering 138:12
Helsgaun K (2000) An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur J Oper Res 126:106–130
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Lin S, Kernighan BW (1973) An effective heuristic algorithm for the travelling-salesman problem. Oper Res 21:498–516
Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1:80–83
Acknowledgments
This research was supported by the Ministry of Chinese Education, Humanities, and Social Sciences Project (Grant Number 17YJA630037); and Graduate teaching reform research project of Hefei University of Technology (Grant Number 2018YJG02).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zang, X., Jiang, L., Ding, B. et al. A hybrid ant colony system algorithm for solving the ring star problem. Appl Intell 51, 3789–3800 (2021). https://doi.org/10.1007/s10489-020-02072-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-020-02072-w