{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:26:23Z","timestamp":1725978383763},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319911915"},{"type":"electronic","value":"9783319911922"}],"license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-91192-2_43","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T13:45:41Z","timestamp":1526478341000},"page":"432-442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chemical Reaction Optimization for Traveling Salesman Problem Over a Hypercube Interconnection Network"],"prefix":"10.1007","author":[{"given":"Ameen","family":"Shaheen","sequence":"first","affiliation":[]},{"given":"Azzam","family":"Sleit","sequence":"additional","affiliation":[]},{"given":"Saleh","family":"Al-Sharaeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"43_CR1","unstructured":"Vukmirovi\u0107, S., Pupavac, D.: The Travelling Salesman Problem in the Function of Transport Network Optimalization. Fakulty of Economics, Interdisciplinary Management Research IX, University in Osijek, Osijek (2013)"},{"key":"43_CR2","unstructured":"Zhan, F., Noon, C.: Shortest path algorithms: an evaluation using real road networks. Transp. Sci. (1996)"},{"issue":"6","key":"43_CR3","first-page":"336","volume":"7","author":"A Al-Shaikh","year":"2016","unstructured":"Al-Shaikh, A., Khattab, H., Sharieh, A., Sleit, A.: Resource utilization in cloud computing as an optimization problem. Int. J. Adv. Comput. Sci. Appl. (IJACSA) 7(6), 336\u2013342 (2016)","journal-title":"Int. J. Adv. Comput. Sci. Appl. (IJACSA)"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/978-1-4419-1153-7_1068","volume-title":"Encyclopedia of Operations Research and Management Science","author":"Karla L. Hoffman","year":"2013","unstructured":"Hoffman, K.L., Padberg, M., Rinaldi, G.: Traveling salesman problem. In: Encyclopedia of Operations Research and Management Science, pp 1573\u20131578. Springer (2016)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AYS Lam","year":"2012","unstructured":"Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization: a tutorial. Memet. Comput. 4, 3\u201317 (2012)","journal-title":"Memet. Comput."},{"key":"43_CR6","unstructured":"Barney, B.: Introduction to Parallel Computing. Lawrence Livermore National Laboratory (2007). https:\/\/computing.llnl.gov\/tutorials\/parallel_comp\/"},{"key":"43_CR7","doi-asserted-by":"publisher","unstructured":"Sleit, A., Salah, I., Jabay, R.: Approximating images using minimum bounding rectangles. In: ICADIWT 2008, pp. 394\u2013396 (2008) https:\/\/doi.org\/10.1109\/ICADIWT.2008.4664379","DOI":"10.1109\/ICADIWT.2008.4664379"},{"key":"43_CR8","unstructured":"Ostrouchov, G.: Parallel computing on a hypercube: an overview of the architecture and some applications. In: Heiberger, R.M. (ed.) Proceedings of the 19th Symposium on the Interface of Computer Science and Statistics, pp. 27\u201332. American Statistical Association (1987)"},{"issue":"6","key":"43_CR9","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1016\/j.jcss.2007.07.004","volume":"74","author":"A Kiasari","year":"2008","unstructured":"Kiasari, A., Sarbazi-Azad, H.: Analytic performance comparison of hypercubes and star graphs with implementation constraints. J. Comput. Syst. Sci. 74(6), 1000\u20131012 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR10","unstructured":"Cathleen, L.: \u201cInside a NASA Production Supercomputing Center\u201d Concept To Reality magazines, Summer\/Fall issue (2011)"},{"issue":"8","key":"43_CR11","first-page":"9","volume":"88","author":"A Mohan","year":"2014","unstructured":"Mohan, A., Remya, G.: A parallel implementation of ant colony optimization for TSP based on MapReduce framework. Int. J. Comput. Appl. 88(8), 9\u201312 (2014)","journal-title":"Int. J. Comput. Appl."},{"key":"43_CR12","unstructured":"Er, H.R., Erdogan, N.: Parallel genetic algorithm to solve traveling salesman problem on MapReduce framework using Hadoop cluster\u201d. arXiv preprint arXiv:1401.6267 (2014)"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Sun, J., Wang, Y., Li, J., Gao, K.: Hybrid algorithm based on chemical reaction optimization and Lin-Kernighan local search for the traveling salesman problem (2011)","DOI":"10.1109\/ICNC.2011.6022378"},{"issue":"7","key":"43_CR14","first-page":"1","volume":"16","author":"A Shaheen","year":"2016","unstructured":"Shaheen, A., Sleit, A.: Comparing between different approaches to solve the 0\/1 Knapsack problem. Int. J. Comput. Sci. Netw. Secur. 16(7), 1\u201310 (2016)","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"issue":"8","key":"43_CR15","first-page":"189","volume":"7","author":"R Barham","year":"2016","unstructured":"Barham, R., Sharieh, A., Sliet, A.: Chemical reaction optimization for max flow problem. (IJACSA) Int. J. Adv. Comput. Sci. Appl. 7(8), 189\u2013196 (2016)","journal-title":"(IJACSA) Int. J. Adv. Comput. Sci. Appl."},{"issue":"4\u20135","key":"43_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02823145","volume":"24","author":"K Deb","year":"1999","unstructured":"Deb, K.: An introduction to genetic algorithms. Sadhana 24(4\u20135), 293\u2013315 (1999)","journal-title":"Sadhana"},{"key":"43_CR17","unstructured":"TSP Website: A collection of worldwide benchmark datasets (2009). http:\/\/www.math.uwaterloo.ca\/tsp\/world\/countries.html . Accessed 15 Dec 2017"}],"container-title":["Advances in Intelligent Systems and Computing","Cybernetics and Algorithms in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91192-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T23:53:51Z","timestamp":1571356431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91192-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"ISBN":["9783319911915","9783319911922"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91192-2_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,5,17]]}}}