{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:27:43Z","timestamp":1767338863817,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030504250"},{"type":"electronic","value":"9783030504267"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50426-7_9","type":"book-chapter","created":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T20:09:52Z","timestamp":1592510992000},"page":"109-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deep Learning Assisted Memetic Algorithm for Shortest Route Problems"],"prefix":"10.1007","author":[{"given":"Ayad","family":"Turky","sequence":"first","affiliation":[]},{"given":"Mohammad Saiedur","family":"Rahaman","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Flora D.","family":"Salim","sequence":"additional","affiliation":[]},{"given":"Doug","family":"Bradbrook","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"9_CR1","unstructured":"Chollet, F.: Keras (2015). https:\/\/keras.io. Accessed 24 Dec 2019"},{"key":"9_CR2","unstructured":"Devin, M. et al.: TensorFlow: large-scale machine learning on heterogeneous systems (2015). https:\/\/www.tensorflow.org. Accessed 24 Dec 2019"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Fu, T., Lee, W.: DeepIST: deep image-based spatio-temporal network for travel time estimation. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 69\u201378. ACM (2019)","DOI":"10.1145\/3357384.3357870"},{"key":"9_CR4","first-page":"69","volume":"1","author":"DE Goldberg","year":"1991","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Found. Genet. Algorithms 1, 69\u201393 (1991)","journal-title":"Found. Genet. Algorithms"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95\u201399 (1988)","journal-title":"Mach. Learn."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Lan, W., Xu, Y., Zhao, B.: Travel time estimation without road networks: an urban morphological layout representation approach. arXiv preprint arXiv:1907.03381 (2019)","DOI":"10.24963\/ijcai.2019\/245"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Li, Y., Fu, K., Wang, Z., Shahabi, C., Ye, J., Liu, Y.: Multi-task representation learning for travel time estimation. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1695\u20131704. ACM (2018)","DOI":"10.1145\/3219819.3220033"},{"key":"9_CR9","unstructured":"Moscato, P., et al.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Comput. Program, C3P Rep. 826, 1989 (1989)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Qin, K.K., Shao, W., Ren, Y., Chan, J., Salim, F.D.: Solving multiple travelling officers problem with population-based optimization algorithms. Neural Comput. Appl. 1\u201327 (2019). https:\/\/doi.org\/10.1007\/s00521-019-04237-2","DOI":"10.1007\/s00521-019-04237-2"},{"key":"9_CR12","unstructured":"Rahaman, M.S., Hamilton, M., Salim, F.D.: Predicting imbalanced taxi and passenger queue contexts in airport. In: PACIS, p. 172 (2017)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Rahaman, M.S., Hamilton, M., Salim, F.D.: Queue context prediction using taxi driver knowledge. In: Proceedings of the Knowledge Capture Conference, p. 35. ACM (2017)","DOI":"10.1145\/3148011.3154474"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Rahaman, M.S., Hamilton, M., Salim, F.D.: Coact: a framework for context-aware trip planning using active transport. In: 2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), pp. 645\u2013650. IEEE (2018)","DOI":"10.1109\/PERCOMW.2018.8480351"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-77525-8","volume-title":"Encyclopedia of Big Data Technologies","author":"MS Rahaman","year":"2018","unstructured":"Rahaman, M.S., Hamilton, M., Salim, F.D.: Using big spatial data for planning user mobility. In: Sakr, S., Zomaya, A. (eds.) Encyclopedia of Big Data Technologies, pp. 1\u20136. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77525-8"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.ins.2016.12.041","volume":"385","author":"MS Rahaman","year":"2017","unstructured":"Rahaman, M.S., Mei, Y., Hamilton, M., Salim, F.D.: CAPRA: a contour-based accessible path routing algorithm. Inf. Sci. 385, 157\u2013173 (2017)","journal-title":"Inf. Sci."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"74660","DOI":"10.1109\/ACCESS.2018.2882580","volume":"6","author":"MS Rahaman","year":"2018","unstructured":"Rahaman, M.S., Ren, Y., Hamilton, M., Salim, F.D.: Wait time prediction for airport taxis using weighted nearest neighbor regression. IEEE Access 6, 74660\u201374672 (2018)","journal-title":"IEEE Access"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Turky, A., Song, A., Sattar, A.: Optimising deep belief networks by hyper-heuristic approach. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2738\u20132745. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969640"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Sabar, N.R., Turky, A., Song, A., Sattar, A.: An evolutionary hyper-heuristic to optimise deep belief networks for image reconstruction. Appl. Soft Comput. 105510 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105510","DOI":"10.1016\/j.asoc.2019.105510"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Song, H., Qin, A.K., Salim, F.D.: Evolutionary model construction for electricity consumption prediction. Neural Comput. Appl. 1\u201318. https:\/\/doi.org\/10.1007\/s00521-019-04310-w","DOI":"10.1007\/s00521-019-04310-w"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-319-70139-4_61","volume-title":"Neural Information Processing","author":"H Song","year":"2017","unstructured":"Song, H., Qin, A.K., Salim, F.D.: Multi-resolution selective ensemble extreme learning machine for electricity consumption prediction. In: Liu, D., Xie, S., Li, Y., Zhao, D., El-Alfy, E.-S.M. (eds.) ICONIP 2017. LNCS, vol. 10638, pp. 600\u2013609. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70139-4_61"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, J., Cao, W., Li, J., Zheng, Y.: When will you arrive? Estimating travel time based on deep neural networks. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11877"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.trb.2019.07.009","volume":"129","author":"H Wang","year":"2019","unstructured":"Wang, H., Yang, H.: Ridesourcing systems: a framework and review. Transp. Res. Part B Methodol. 129, 122\u2013155 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Z., Fu, K., Ye, J.: Learning to estimate the travel time. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 858\u2013866. ACM (2018)","DOI":"10.1145\/3219819.3219900"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50426-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T23:06:45Z","timestamp":1718665605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50426-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504250","9783030504267"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50426-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}