{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:42:10Z","timestamp":1743115330331,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":7,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789401787970"},{"type":"electronic","value":"9789401787987"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-94-017-8798-7_8","type":"book-chapter","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T05:40:19Z","timestamp":1397799619000},"page":"57-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simulated Annealing for the Design of Location Management System and Relation Map"],"prefix":"10.1007","author":[{"given":"Si-Hwan","family":"Jang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghyun","family":"Joo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.comcom.2006.08.034","volume":"30","author":"J Taheri","year":"2007","unstructured":"Taheri J, Zomaya AY (2007) A simulated annealing approach for mobile location management. Comput Commun 30:714\u2013730","journal-title":"Comput Commun"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10852-007-9066-5","volume":"6","author":"J Taheri","year":"2007","unstructured":"Taheri J, Zomaya AY (2007) A combined genetic-neural algorithm for mobility management. J Math Model Algorithm 6:481\u2013507","journal-title":"J Math Model Algorithm"},{"key":"8_CR3","volume-title":"Advances in metaheuristics for hard optimization","author":"SS Kim","year":"2008","unstructured":"Kim SS, Smith AE, Hong SJ (2008) Dynamic load balancing using an ant colony approach in micro-cellular mobile communications system. In: Michalewicz Z, Siarry P (eds) Advances in metaheuristics for hard optimization. Springer, Berlin"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1109\/TSMCB.2002.999810","volume":"32","author":"S Pierre","year":"2002","unstructured":"Pierre S, Hou\u2032eto F (2002) Assigning cells to switches in cellular mobile networks using taboo search. IEEE Trans Syst Man Cybern Part B: Cybern 32(3):351\u2013356","journal-title":"IEEE Trans Syst Man Cybern Part B: Cybern"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Chen Y-W, Kohatsu T (2007) 3D image reconstruction from limited projections by simulated annealing. The 2nd international conference on innovative computing, information and control, Kumamoto, Japan","DOI":"10.1109\/ICICIC.2007.1"},{"issue":"7","key":"8_CR6","first-page":"2885","volume":"6","author":"V Kroumou","year":"2010","unstructured":"Kroumou V, Yu J, Shibayama K (2010) 3D path planning for mobile robot using simulated annealing neural networks. Int J Innovative Comput Inf Control 6(7):2885\u20132899","journal-title":"Int J Innovative Comput Inf Control"},{"issue":"3","key":"8_CR7","first-page":"1181","volume":"7","author":"G Kim","year":"2011","unstructured":"Kim G, Kim SS, Kim I-H, Mani V, Moon J-K (2011) An efficient simulated annealing with a valid solution mechanism for TDMA broadcast scheduling problem. Int J Innovative Comput Inf Control 7(3):1181\u20131191","journal-title":"Int J Innovative Comput Inf Control"}],"container-title":["Lecture Notes in Electrical Engineering","Frontier and Innovation in Future Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-017-8798-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T15:25:14Z","timestamp":1676388314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-017-8798-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9789401787970","9789401787987"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-94-017-8798-7_8","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}