{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T10:10:02Z","timestamp":1720433402030},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T00:00:00Z","timestamp":1531785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00521-018-3638-3","type":"journal-article","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T06:49:39Z","timestamp":1531810179000},"page":"63-76","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Novel local restart strategies with hyper-populated ant colonies for dynamic optimization problems"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-4478-5810","authenticated-orcid":false,"given":"Anandkumar","family":"Prakasam","sequence":"first","affiliation":[]},{"given":"Nickolas","family":"Savarimuthu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,17]]},"reference":[{"key":"3638_CR1","doi-asserted-by":"crossref","unstructured":"Bottou L (2010) Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010 Physica-Verlag HD, pp 177\u2013186","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"3638_CR2","unstructured":"Bousquet O, Bottou L (2008) The tradeoffs of large scale learning. In: Advances in neural information processing systems, pp 161\u2013168"},{"key":"3638_CR3","doi-asserted-by":"crossref","unstructured":"Sieminski A (2015) Potentials of hyper populated ant colonies. In: Asian conference on intelligent information and database systems, pp 408\u2013417","DOI":"10.1007\/978-3-319-15702-3_40"},{"key":"3638_CR4","unstructured":"Salimans T, Ho J, Chen X, Sutskever I (2017) Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864"},{"key":"3638_CR5","volume-title":"Encyclopedia of operations research and management science","author":"SI Gass","year":"2012","unstructured":"Gass SI, Harris CM (2012) Encyclopedia of operations research and management science. Springer, New York"},{"issue":"1","key":"3638_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K Sorensen","year":"2015","unstructured":"Sorensen K (2015) Metaheuristicsthe metaphor exposed. Int Trans Oper Res 22(1):3\u201318","journal-title":"Int Trans Oper Res"},{"issue":"4598","key":"3638_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"3","key":"3638_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu searchpart I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"key":"3638_CR9","doi-asserted-by":"crossref","unstructured":"Beni G, Wang J (1993) Swarm intelligence in cellular robotic systems. In: Robots and biological systems: towards a new bionics? Springer, Berlin, pp 703\u2013712","DOI":"10.1007\/978-3-642-58069-7_38"},{"key":"3638_CR10","doi-asserted-by":"crossref","unstructured":"Kennedy J (2011) Particle swarm optimization. In: Encyclopedia of machine learning, pp 760\u2013766","DOI":"10.1007\/978-0-387-30164-8_630"},{"key":"3638_CR11","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) The ant system: an autocatalytic optimizing process. Technical report 1\u201321"},{"key":"3638_CR12","unstructured":"Rosengren R (1971) Route fidelity, visual memory and recruitment behaviour in foraging wood ants of the genus Formica:(Hymenoptera, Formicidae). Societas pro fauna et flora Fennica"},{"issue":"2","key":"3638_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0022-5193(83)80007-1","volume":"105","author":"JL Deneubourg","year":"1983","unstructured":"Deneubourg JL, Pasteels JM, Verhaeghe JC (1983) Probabilistic behaviour in ants: a strategy of errors? J Theor Biol 105(2):259\u2013271","journal-title":"J Theor Biol"},{"issue":"8","key":"3638_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr WJ (2000) A graph-based ant system and its convergence. Future Gen Comput Syst 16(8):873\u2013888","journal-title":"Future Gen Comput Syst"},{"issue":"1","key":"3638_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10462-015-9441-y","volume":"45","author":"A Prakasam","year":"2016","unstructured":"Prakasam A, Savarimuthu N (2016) Metaheuristic algorithms and probabilistic behaviour: a comprehensive analysis of ant colony optimization and its variants. Artif Intell Rev 45(1):97\u2013130","journal-title":"Artif Intell Rev"},{"issue":"2","key":"3638_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TEVC.2016.2591064","volume":"21","author":"Q Yang","year":"2017","unstructured":"Yang Q, Chen WN, Yu Z, Gu T, Li Y, Zhang H, Zhang J (2017) Adaptive multimodal continuous ant colony optimization. IEEE Trans Evol Comput 21(2):191\u2013205","journal-title":"IEEE Trans Evol Comput"},{"issue":"19","key":"3638_CR17","doi-asserted-by":"publisher","first-page":"5829","DOI":"10.1007\/s00500-016-2161-7","volume":"21","author":"J Liu","year":"2017","unstructured":"Liu J, Yang J, Liu H, Tian X, Gao M (2017) An improved ant colony algorithm for robot path planning. Soft Comput 21(19):5829\u20135839","journal-title":"Soft Comput"},{"issue":"2","key":"3638_CR18","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10586-017-0793-8","volume":"20","author":"Z Chen","year":"2017","unstructured":"Chen Z, Wang RL (2017) Ant colony optimization with different crossover schemes for global optimization. Clust Comput 20(2):1247\u20131257","journal-title":"Clust Comput"},{"key":"3638_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2115-6","author":"J Wang","year":"2017","unstructured":"Wang J, Cao J, Sherratt RS, Park JH (2017) An improved ant colony optimization-based approach with mobile sink for wireless sensor networks. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-017-2115-6","journal-title":"J Supercomput"},{"issue":"2","key":"3638_CR20","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s11276-015-1154-2","volume":"23","author":"J Sathiamoorthy","year":"2017","unstructured":"Sathiamoorthy J, Ramakrishnan B (2017) Energy and delay efficient dynamic cluster formation using hybrid AGA with FACO in EAACK MANETs. Wirel Netw 23(2):371\u2013385","journal-title":"Wirel Netw"},{"key":"3638_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2912-0","author":"Q Zhang","year":"2017","unstructured":"Zhang Q, Zhang C (2017) An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-017-2912-0","journal-title":"Neural Comput Appl"},{"key":"3638_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.eswa.2017.02.008","volume":"78","author":"V Rosset","year":"2017","unstructured":"Rosset V, Paulo MA, Cespedes JG, Nascimento MC (2017) Enhancing the reliability on data delivery and energy efficiency by combining swarm intelligence and community detection in large-scale WSNs. Expert Syst Appl 78:89\u2013102","journal-title":"Expert Syst Appl"},{"issue":"8","key":"3638_CR23","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1016\/j.micpro.2015.07.003","volume":"39","author":"CW Tsai","year":"2015","unstructured":"Tsai CW, Tsai PW, Pan JS, Chao HC (2015) Metaheuristics for the deployment problem of WSN: a review. Microprocess Microsyst 39(8):1305\u20131317","journal-title":"Microprocess Microsyst"},{"key":"3638_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2018.01.002","author":"S Kaur","year":"2018","unstructured":"Kaur S, Mahajan R (2018) Hybrid meta-heuristic optimization based energy efficient protocol for wireless sensor networks. Egypt Inform J. https:\/\/doi.org\/10.1016\/j.eij.2018.01.002","journal-title":"Egypt Inform J"},{"key":"3638_CR25","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.future.2017.07.030","volume":"81","author":"M Zhang","year":"2018","unstructured":"Zhang M, Yang M, Wu Q, Zheng R, Zhu J (2018) Smart perception and autonomic optimization: a novel bio-inspired hybrid routing protocol for MANETs. Future Gen Comput Syst 81:505\u2013513","journal-title":"Future Gen Comput Syst"},{"key":"3638_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.07.008","volume":"89","author":"T Zhang","year":"2018","unstructured":"Zhang T, Ke L, Li J, Li J, Huang J, Li Z (2018) Metaheuristics for the tabu clustered traveling salesman problem. Comput Oper Res 89:1\u201312","journal-title":"Comput Oper Res"},{"key":"3638_CR27","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.asoc.2017.06.049","volume":"60","author":"Y Yan","year":"2017","unstructured":"Yan Y, Sohn HS, Reyes G (2017) A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem. Appl Soft Comput 60:256\u2013267","journal-title":"Appl Soft Comput"},{"key":"3638_CR28","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.eswa.2017.09.008","volume":"92","author":"M Elhoseny","year":"2018","unstructured":"Elhoseny M, Tharwat A, Yuan X, Hassanien AE (2018) Optimizing K-coverage of mobile WSNs. Expert Syst Appl 92:142\u2013153. https:\/\/doi.org\/10.1016\/j.eswa.2017.09.008","journal-title":"Expert Syst Appl"},{"key":"3638_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2017.12.022","author":"W Elsayed","year":"2017","unstructured":"Elsayed W, Elhoseny M, Sabbeh S, Riad A (2017) Self-maintenance model for wireless sensor networks. Comput Electr Eng. https:\/\/doi.org\/10.1016\/j.compeleceng.2017.12.022","journal-title":"Comput Electr Eng"},{"issue":"7","key":"3638_CR30","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Muller FM, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47(7):1743\u20131756","journal-title":"IEEE Trans Cybern"},{"key":"3638_CR31","doi-asserted-by":"crossref","unstructured":"Sieminski A (2015) Using ACS for dynamic traveling salesman problem. In: New research in multimedia and internet systems, pp 145\u2013155","DOI":"10.1007\/978-3-319-10383-9_14"},{"issue":"2","key":"3638_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s40595-016-0059-z","volume":"3","author":"A Sieminski","year":"2016","unstructured":"Sieminski A (2016) Using hyper populated ant colonies for solving the TSP. Vietnam J Comput Sci 3(2):103\u2013117","journal-title":"Vietnam J Comput Sci"},{"key":"3638_CR33","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Workshops on applications of evolutionary computation, pp 213\u2013222","DOI":"10.1007\/3-540-45365-2_22"},{"key":"3638_CR34","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2002) A population based approach for ACO. In: Cagnoni S, Gottlieb J, Hart E, Middendorf M, Raidl GR (eds) Applications of evolutionary computing. EvoWorkshops 2002. Lecture notes in computer science, vol 2279. Springer, Berlin","DOI":"10.1007\/3-540-46004-7_8"},{"key":"3638_CR35","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis M, Yang S (2010) Ant colony optimization with immigrants schemes in dynamic environments. Parallel Probl Solving Nat PPSN XI:371\u2013380","DOI":"10.1007\/978-3-642-15871-1_38"},{"key":"3638_CR36","unstructured":"Chen H, Jason T, Nor M (2007) Solving dynamic traveling salesman problem using ant colony system with local search. Int Multi Conf Eng Comput Sci. pp 117\u2013121"},{"key":"3638_CR37","doi-asserted-by":"crossref","unstructured":"Stutzle T, Hoos H (1998) Improvements on the ant-system: introducing the MAX-MIN ant system. In Artificial neural nets and genetic algorithms, pp 245\u2013249","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"3638_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.eswa.2016.05.007","volume":"60","author":"H Zhang","year":"2016","unstructured":"Zhang H, Zhou J (2016) Dynamic multiscale region search algorithm using vitality selection for traveling salesman problem. Expert Syst Appl 60:81\u201395","journal-title":"Expert Syst Appl"},{"issue":"12","key":"3638_CR39","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(12):14439\u201314450","journal-title":"Expert Syst Appl"},{"issue":"10","key":"3638_CR40","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TAS Masutti","year":"2009","unstructured":"Masutti TAS, Castro LND (2009) A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf Sci 179(10):1454\u20131468","journal-title":"Inf Sci"},{"issue":"10","key":"3638_CR41","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"EM Cochrane","year":"2003","unstructured":"Cochrane EM, Beasley JE (2003) The co-adaptive neural network approach to the Euclidean traveling salesman problem. Neural Netw 16(10):1499\u20131525","journal-title":"Neural Netw"},{"key":"3638_CR42","volume-title":"The insect societies","author":"EO Wilson","year":"1971","unstructured":"Wilson EO (1971) The insect societies. Harvard University Press, Cambridge, MA (Distributed by Oxford University Press)"},{"key":"3638_CR43","first-page":"191977","volume-title":"Self-organization in nonequilibrium systems","author":"G Nicolis","year":"1977","unstructured":"Nicolis G, Prigogine I (1977) Self-organization in nonequilibrium systems. Wiley, New York, p 191977"},{"issue":"4","key":"3638_CR44","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00657046","volume":"101","author":"M Moglich","year":"1975","unstructured":"Moglich M, Holldobler B (1975) Communication and orientation during foraging and emigration in the ant Formica fusca. J Comp Physiolo A Neuroethol Sens Neural Behav Physiol 101(4):275\u2013288","journal-title":"J Comp Physiolo A Neuroethol Sens Neural Behav Physiol"},{"issue":"1","key":"3638_CR45","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02224528","volume":"29","author":"JC Verhaeghe","year":"1982","unstructured":"Verhaeghe JC (1982) Food recruitment in Tetramorium impurum. (Hymenoptera: Formicidae). Insectes Soc 29(1):67\u201385","journal-title":"Insectes Soc"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3638-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3638-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3638-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T09:10:42Z","timestamp":1720429842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3638-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,17]]},"references-count":45,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["3638"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3638-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,17]]},"assertion":[{"value":"4 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}