{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:01:50Z","timestamp":1747177310135,"version":"3.40.5"},"reference-count":29,"publisher":"Informa UK Limited","issue":"14","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Applied Artificial Intelligence"],"published-print":{"date-parts":[[2020,12,5]]},"DOI":"10.1080\/08839514.2020.1824094","type":"journal-article","created":{"date-parts":[[2020,10,4]],"date-time":"2020-10-04T16:02:40Z","timestamp":1601827360000},"page":"1159-1175","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic"],"prefix":"10.1080","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4833-9068","authenticated-orcid":false,"given":"W. C.","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6590-8787","authenticated-orcid":false,"given":"R.","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan"}]}],"member":"301","published-online":{"date-parts":[[2020,10,4]]},"reference":[{"journal-title":"International Journal of Engineering and Advanced Technology 4 (10): 76-79","year":"2015","author":"Abdulkarim H.","key":"cit0001"},{"key":"cit0002","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90106-3"},{"key":"cit0003","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/012\/22"},{"key":"cit0004","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100034095"},{"volume-title":"Combinatorial processes and dynamic programming","year":"1958","author":"Bellman R.","key":"cit0005"},{"key":"cit0006","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"cit0007","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.4.387"},{"key":"cit0008","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"cit0009","first-page":"577","volume":"24","author":"Giesen J.","year":"2000","journal-title":"Discrete & Computational Geometry"},{"key":"cit0010","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"volume-title":"Adaptation in natural and artificial systems","year":"1975","author":"Holland J. H","key":"cit0011"},{"key":"cit0012","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3400-2_12"},{"key":"cit0013","unstructured":"Jahanshahi, H., and N. N. Sari. 2018. Robot path planning algorithms: A review of theory and experiment. arXiv preprint arXiv:1805.08137v3"},{"key":"cit0014","doi-asserted-by":"publisher","DOI":"10.1109\/34.824819"},{"key":"cit0015","doi-asserted-by":"crossref","unstructured":"Johnson, D. S., and L. A. McGeoch. 2007. Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A. P. (eds) The traveling salesman problem and its variations, 369\u2013443. Boston, MA, USA: Springer","DOI":"10.1007\/0-306-48213-4_9"},{"key":"cit0016","first-page":"341","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Johnson D. S.","year":"1996"},{"key":"cit0017","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.209"},{"key":"cit0018","unstructured":"Karp, R. M. and J. M. Steele. 1985. Probabilistic analysis of heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (eds) The Traveling Salesman Problem, 181\u2013205. Chichester, UK: John Wiley & Sons"},{"key":"cit0019","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"key":"cit0020","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"cit0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2016.07.010"},{"key":"cit0022","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"volume-title":"The travelling salesman problem: A guided tour of combinatorial optimization","year":"1985","author":"Lawler E. L","key":"cit0023"},{"key":"cit0024","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76361"},{"key":"cit0025","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125403"},{"key":"cit0026","unstructured":"Reineit, G. Discrete and combinatorial optimization. Accessed June 20, 2020. http:\/\/comopt.ifi.uni-heidelberg.de"},{"volume-title":"Combinatorial optimization: Polyhedra and efficiency","year":"2003","author":"Schrijver A.","key":"cit0027"},{"key":"cit0028","doi-asserted-by":"crossref","unstructured":"Selamoglu, B. I., A. Salhi, and M. Sulaiman. 2017. Strip algorithms as an efficient way to initialise population-based metaheuristics. In: Amodeo, L., Talbi, EG., Yalaoui, F. (eds) Recent Developments in Metaheuristics, 319\u2013331. Cham, ZG: Springer","DOI":"10.1007\/978-3-319-58253-5_18"},{"key":"cit0029","unstructured":"Wagstaff, K., C. Cardie, S. Rogers and S. Schr\u00f6dl. 2001. Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, 577\u2013584, Williamstown, MA, USA"}],"container-title":["Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/08839514.2020.1824094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T23:21:29Z","timestamp":1621898489000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/08839514.2020.1824094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,4]]},"references-count":29,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2020,12,5]]}},"alternative-id":["10.1080\/08839514.2020.1824094"],"URL":"https:\/\/doi.org\/10.1080\/08839514.2020.1824094","relation":{},"ISSN":["0883-9514","1087-6545"],"issn-type":[{"type":"print","value":"0883-9514"},{"type":"electronic","value":"1087-6545"}],"subject":[],"published":{"date-parts":[[2020,10,4]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uaai20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uaai20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-10-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}