{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T18:10:33Z","timestamp":1731780633478,"version":"3.28.0"},"reference-count":35,"publisher":"Informa UK Limited","issue":"4","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information and Telecommunication"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1080\/24751839.2024.2359180","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T12:26:47Z","timestamp":1717158407000},"page":"548-569","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Chemical reaction inspired approach for routing problems with hard time constraints"],"prefix":"10.1080","volume":"8","author":[{"given":"Imen","family":"Boudali","sequence":"first","affiliation":[{"name":"SERCOM Laboratory, University of Carthage, Carthage, Tunisia"},{"name":"National Engineering School of Tunis, University of Tunis El Manar, Tunis, Tunisia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marwa","family":"Ragmoun","sequence":"additional","affiliation":[{"name":"High Institute of Computer Sciences, University of Tunis El Manar, Tunis, Tunisia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0975"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.07.037"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16210-7_50"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1626\/1\/012097"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.21629\/JSEE.2018.03.20"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1070.0223"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch5"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0761-4_52"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2023.1155356"},{"key":"e_1_3_2_11_1","first-page":"119","article-title":"Optimization of vehicle routing problem with time window cigarette logistics based on hybrid genetic algorithm","volume":"11","author":"Fan W. B.","year":"2018","unstructured":"Fan, W. B., & Feng, W. (2018). Optimization of vehicle routing problem with time window cigarette logistics based on hybrid genetic algorithm. Journal of Modern Electronic Technology, 11, 119\u2013123.","journal-title":"Journal of Modern Electronic Technology"},{"issue":"7","key":"e_1_3_2_12_1","first-page":"641","article-title":"Dynamic hybrid ant colony optimization algorithm for solving vehicle routing problem with time windows","volume":"28","author":"Ge B.","year":"2015","unstructured":"Ge, B., Han, J. H., Wei, W., Cheng, L., & Han, Y. (2015). Dynamic hybrid ant colony optimization algorithm for solving vehicle routing problem with time windows. Journal of Pattern Recognition and Artificial Intelligence, 28(7), 641\u2013650.","journal-title":"Journal of Pattern Recognition and Artificial Intelligence"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/452\/4\/042024"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch1"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0449"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.11.006"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-016-0488-5"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227973"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033580"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-012-0075-1"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161091"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch4"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67669-2_4"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch3"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3299358"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.3390\/app12136486"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch2"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-017-9485-1"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.05.042"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_3_2_33_1","first-page":"110","article-title":"An improved population incremental learning algorithm for solving vehicle routing problem with soft time windows","volume":"1","author":"Xie Y.","year":"2016","unstructured":"Xie, Y., Hu, R., Qian, B., Chen, S. F., Zhang, G. l., & Zhang, X. D. (2016). An improved population incremental learning algorithm for solving vehicle routing problem with soft time windows. Journal of Nanjing University of Science and Technology (Natural Science), 1, 110\u2013116.","journal-title":"Journal of Nanjing University of Science and Technology (Natural Science)"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.35"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0181275"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-1758-8"}],"container-title":["Journal of Information and Telecommunication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/24751839.2024.2359180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T17:53:42Z","timestamp":1731779622000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/24751839.2024.2359180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10.1080\/24751839.2024.2359180"],"URL":"https:\/\/doi.org\/10.1080\/24751839.2024.2359180","relation":{},"ISSN":["2475-1839","2475-1847"],"issn-type":[{"type":"print","value":"2475-1839"},{"type":"electronic","value":"2475-1847"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"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=tjit20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjit20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-01-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}