{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:53:13Z","timestamp":1761897193768,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170035","61272420","81674099"],"award-info":[{"award-number":["61170035","61272420","81674099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["30916011328","30918015103","30918012204"],"award-info":[{"award-number":["30916011328","30918015103","30918012204"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Nanjing Science and Technology Development Plan Project","award":["201805036"],"award-info":[{"award-number":["201805036"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10489-020-01636-0","type":"journal-article","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T23:02:37Z","timestamp":1580598157000},"page":"1633-1656","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Discrete selfish herd optimizer for solving graph coloring problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Ruxin","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2219-067X","authenticated-orcid":false,"given":"Yongli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Jelodar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Rabbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,1]]},"reference":[{"key":"1636_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.biosystems.2017.07.010","volume":"160","author":"F Fausto","year":"2017","unstructured":"Fausto F, Cuevas E, Valdivia A, Gonz\u00e1lez A (2017) A global optimization algorithm inspired in the behavior of selfish herds. Biosystems 160:39\u201355","journal-title":"Biosystems"},{"key":"1636_CR2","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.procs.2015.08.223","volume":"60","author":"J Agrawal","year":"2015","unstructured":"Agrawal J, Agrawal S (2015) Acceleration based particle swarm optimization for graph coloring problem. 19th international conference on knowledge based and intelligent information and engineering systems. Procedia Computer Science 60:714\u2013721","journal-title":"Procedia Computer Science"},{"key":"1636_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.procs.2015.12.059","volume":"73","author":"M Bensouyad","year":"2015","unstructured":"Bensouyad M, Guidoum N, Sa\u00efdouni D-E (2015) A new and fast evolutionary algorithm for strict strong graph coloring problem. The international conference on advanced wireless, information, and communication technologies (AWICT 2015). Procedia Computer Science 73:138\u2013145","journal-title":"Procedia Computer Science"},{"key":"1636_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2016.02.051","volume":"16","author":"Y Jin","year":"2016","unstructured":"Jin Y, Hao J-K (2016) Hybrid evolutionary search for the minimum sum-coloring problem of graphs. Inf Sci 16:15\u201334","journal-title":"Inf Sci"},{"key":"1636_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.vlsi.2016.04.009","volume":"55","author":"N Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o N, Martins R, Canelas A, P\u00f3voa R, Horta N (2016) AIDA: layout-aware analog circuit-level sizing with in-loop layout generation. Integr VLSI J 55:316\u2013329","journal-title":"Integr VLSI J"},{"issue":"9","key":"1636_CR6","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.mejo.2014.04.023","volume":"45","author":"D Kasprowicz","year":"2014","unstructured":"Kasprowicz D, Wada H (2014) Methods for automated detection of plagiarism in integrated-circuit layouts. Microelectron J 45(9):1212\u20131219","journal-title":"Microelectron J"},{"key":"1636_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2018.03.013","volume":"95","author":"J Feng","year":"2018","unstructured":"Feng J, Che A (2018) Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments. Comput Oper Res 95:163\u2013171","journal-title":"Comput Oper Res"},{"key":"1636_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.visres.2018.06.005","volume":"149","author":"R Rideaux","year":"2018","unstructured":"Rideaux R, Baker E, Edwards M (2018) Parallel consolidation into visual working memory results in reduced precision representations. Vis Res 149:24\u201329","journal-title":"Vis Res"},{"key":"1636_CR9","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2018.02.009","volume":"94","author":"N Leite","year":"2018","unstructured":"Leite N, Fernandes CM, Mel\u00edcio F, Rosa AC (2018) A cellular memetic algorithm for the examination-timetabling problem. Comput Oper Res 94:118\u2013138","journal-title":"Comput Oper Res"},{"key":"1636_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.asoc.2018.04.034","volume":"68","author":"T Song","year":"2018","unstructured":"Song T, Liu S, Tang X, Peng X, Chen M (2018) An iterated local search algorithm for the university course timetabling problem. Appl Soft Comput 68:597\u2013608","journal-title":"Appl Soft Comput"},{"key":"1636_CR11","doi-asserted-by":"publisher","unstructured":"Jianguo Q, Yang L, Gao Y, Di Z (2018) Service-oriented train timetabling problem with consideration of women-only passenger cars. Comput Ind Eng In Press 5. https:\/\/doi.org\/10.1016\/j.cie.2018.04.054","DOI":"10.1016\/j.cie.2018.04.054"},{"key":"1636_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.micpro.2017.09.005","volume":"55","author":"S-MM Je-HyungLee","year":"2017","unstructured":"Je-HyungLee S-MM, Park J (2017) Region-based dual bank register allocation for reduced instruction encoding architectures. Microprocess Microsyst 55:26\u201343","journal-title":"Microprocess Microsyst"},{"key":"1636_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jksuci.2015.04.001","volume":"29","author":"DC Kiran","year":"2017","unstructured":"Kiran DC, Gurunarayanan S, Misra JP, Bhatia M (2017) Register allocation for fine grain threads on multicore processor. Journal of King Saud University - Computer and Information Sciences 29:85\u201392","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"1636_CR14","first-page":"41","volume":"6","author":"M Faraji","year":"2011","unstructured":"Faraji M (2011) Proposing a new algorithm based on bees behavior for solving graph coloring. Int J Contemp Math Sciences 6:41\u201349","journal-title":"Int J Contemp Math Sciences"},{"key":"1636_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jksues.2013.04.001","volume":"27","author":"SM Douiri","year":"2015","unstructured":"Douiri SM, Elbernoussi S (2015) Solving the graph coloring problem via hybrid genetic algorithms. Journal of King Saud University \u2013 Engineering Sciences 27:114\u2013118","journal-title":"Journal of King Saud University \u2013 Engineering Sciences"},{"key":"1636_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2013.03.064","volume":"132","author":"I Rebollo-Ruiz","year":"2014","unstructured":"Rebollo-Ruiz I, Gra\u00f1a M (2014) An empirical evaluation of gravitational swarm intelligence for graph coloring algorithm. Neurocomputing 132:79\u201384","journal-title":"Neurocomputing"},{"issue":"16","key":"1636_CR17","first-page":"232","volume":"11","author":"B Hong","year":"1999","unstructured":"Hong B (1999) Generic algorithm of color planar graph. J Guizhou Univ (Nat Sci) 11(16):232\u2013297","journal-title":"J Guizhou Univ (Nat Sci)"},{"issue":"5","key":"1636_CR18","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1021\/ci025546e","volume":"42","author":"W Liu","year":"2002","unstructured":"Liu W, Zhang F, Xu J (2002) A DNA algorithm for the graph-coloring problem. J Chem Inf Comput Sci 42(5):1176\u20131178","journal-title":"J Chem Inf Comput Sci"},{"key":"1636_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2006.07.012","volume":"156","author":"TN Bui","year":"2008","unstructured":"Bui TN, Nguyen TH, Patel CM, Phan K-AT (2008) An ant-based algorithm for coloring graphs. Discret Appl Math 156:190\u2013200","journal-title":"Discret Appl Math"},{"key":"1636_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.pnsc.2007.11.009","volume":"18","author":"G Cui","year":"2008","unstructured":"Cui G, Qin L, Liu S, Wang Y, Zhang X, Cao X (2008) Modified PSO algorithm for solving planar graph coloring problem. Prog Nat Sci 18:353\u2013357","journal-title":"Prog Nat Sci"},{"key":"1636_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ejor.2007.08.034","volume":"191","author":"PM Talavan","year":"2008","unstructured":"Talavan PM, Yanez J (2008) The graph-coloring problem: a neuronal network approach. Eur J Oper Res 191:100\u2013111","journal-title":"Eur J Oper Res"},{"key":"1636_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-11169-3_11","volume":"5851","author":"DC Porumbel","year":"2009","unstructured":"Porumbel DC, Hao J-K, Kuntz P (2009) Position-guided Tabu search algorithm for the graph coloring problem. Learning and Intelligent Optimization 5851:148\u2013162","journal-title":"Learning and Intelligent Optimization"},{"key":"1636_CR23","doi-asserted-by":"publisher","first-page":"5525","DOI":"10.1016\/j.eswa.2010.10.084","volume":"38","author":"L-Y Hsu","year":"2011","unstructured":"Hsu L-Y, Horng S-J, Fan P, Khan MK, Wang Y-R, Run R-S, Lai J-L, Chen R-J (2011) MTPSO algorithm for solving planar graph coloring problem. Expert Syst Appl 38:5525\u20135531","journal-title":"Expert Syst Appl"},{"key":"1636_CR24","first-page":"112","volume-title":"Using Dierential evolution for the graph coloring. Symposium on differential evolution (SDE)","author":"I Fister","year":"2011","unstructured":"Fister I, Brest J (2011) Using Dierential evolution for the graph coloring. Symposium on differential evolution (SDE), vol 4. IEEE, Paris, pp 112\u2013121"},{"key":"1636_CR25","unstructured":"Hongshun C, Peng Z (2013) An ant algorithm for solving the four coloring map problem. Ninth International Conference on Natural Computation (ICNC): 491\u2013495"},{"key":"1636_CR26","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.asoc.2015.04.020","volume":"33","author":"S Mahmoudi","year":"2015","unstructured":"Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48\u201364","journal-title":"Appl Soft Comput"},{"key":"1636_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1166\/jctn.2015.3687","volume":"12","author":"R Wang","year":"2015","unstructured":"Wang R, Zhou Y, Zhou Y, Bao Z (2015) Local greedy flower pollination algorithm for solving planar graph coloring problem. J Comput Theor Nanosci 12:1\u201310","journal-title":"J Comput Theor Nanosci"},{"key":"1636_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cam.2015.04.030","volume":"293","author":"S Fidanova","year":"2016","unstructured":"Fidanova S, Pop P (2016) An improved hybrid ant-local search algorithm for the partition graph coloring problem. J Comput Appl Math 293:55\u201361","journal-title":"J Comput Appl Math"},{"key":"1636_CR29","doi-asserted-by":"crossref","unstructured":"Chen K, Kanoh H (2016) A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems. International Conference on Theory and Practice of Natural Computing: 73\u201384","DOI":"10.1007\/978-3-319-49001-4_6"},{"key":"1636_CR30","unstructured":",Chen K, Kanoh H (2017) A discrete firefly algorithm based on similarity for graph coloring problems. 18th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD): 65\u201370"},{"issue":"2","key":"1636_CR31","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s13369-017-2686-9","volume":"43","author":"R Marappan","year":"2018","unstructured":"Marappan R, Sethumadhavan G (2018) Solution to graph coloring using genetic and Tabu search procedures. Arab J Sci Eng 43(2):525\u2013542","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"1636_CR32","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0022-5193(71)90189-5","volume":"31","author":"WD Hamilton","year":"1971","unstructured":"Hamilton WD (1971) Geometry to the selfish herd. J Theory Biology 31(2):295\u2013311","journal-title":"J Theory Biology"},{"key":"1636_CR33","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, coloring, and Satisfiability: second DIMACS implementation challenge","author":"DS Johnson","year":"1996","unstructured":"Johnson DS, Trick MA (1996) Cliques, coloring, and Satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence"},{"key":"1636_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11721-012-0067-2","volume":"6","author":"H Hern\u00e1ndez","year":"2012","unstructured":"Hern\u00e1ndez H, Blum C (2012) Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs. Swarm Intelligence 6:117\u2013150","journal-title":"Swarm Intelligence"},{"key":"1636_CR35","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11235-013-9776-0","volume":"55","author":"H Hern\u00e1ndez","year":"2014","unstructured":"Hern\u00e1ndez H, Blum C (2014) FrogSim: distributed graph coloring in wireless ad hoc networks. Telecommun Syst 55:211\u2013223","journal-title":"Telecommun Syst"},{"issue":"1","key":"1636_CR36","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10589-016-9862-9","volume":"66","author":"SF Gal\u00e1n","year":"2017","unstructured":"Gal\u00e1n SF (2017) Simple decentralized graph coloring. Comput Optim Appl 66(1):163\u2013185","journal-title":"Comput Optim Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01636-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-020-01636-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01636-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,31]],"date-time":"2021-01-31T00:18:39Z","timestamp":1612052319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-020-01636-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1636"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01636-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2020,2,1]]},"assertion":[{"value":"1 February 2020","order":1,"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":"All authors have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}