{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T08:41:14Z","timestamp":1782463274217,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00521-019-04218-5","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T18:25:06Z","timestamp":1557339906000},"page":"3649-3674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Transportation scheduling optimization by a collaborative strategy in supply chain management with TPL using chemical reaction optimization"],"prefix":"10.1007","volume":"32","author":[{"given":"Md. Rafiqul","family":"Islam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md. Riaz","family":"Mahmud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rayhan Morshed","family":"Pritom","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,8]]},"reference":[{"key":"4218_CR1","unstructured":"Mittal AK, Thaker CS, Sutaria GN (2011) Multi-objective supply chain model through an ant colony optimization approach. In: International conference on computer communication and networks CSI-COMNET-2011"},{"key":"4218_CR2","first-page":"1","volume":"3","author":"A Uzorh","year":"2014","unstructured":"Uzorh A, Innocent N (2014) Supply chain management optimization problem. Int J Eng Sci (IJES) 3:1\u20139","journal-title":"Int J Eng Sci (IJES)"},{"issue":"3","key":"4218_CR3","doi-asserted-by":"publisher","first-page":"e114","DOI":"10.4172\/2169-0316.1000e114","volume":"2","author":"SK Rajeshwar","year":"2013","unstructured":"Rajeshwar SK (2013) Optimization solution to supply chain network architecture using new-PSO algorithm. Ind Eng Manage 2(3):e114. \nhttps:\/\/doi.org\/10.4172\/2169-0316.1000e114","journal-title":"Ind Eng Manage"},{"issue":"1","key":"4218_CR4","first-page":"33","volume":"9","author":"P Radhakrishnan","year":"2009","unstructured":"Radhakrishnan P, Prasad V, Gopalan M (2009) Inventory optimization in supply chain management using genetic algorithm. Int J Comput Sci Netw Secur 9(1):33\u201340","journal-title":"Int J Comput Sci Netw Secur"},{"key":"4218_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.eswa.2016.11.016","volume":"71","author":"S Xu","year":"2017","unstructured":"Xu S, Liu Y, Chen M (2017) Optimisation of partial collaborative transportation scheduling in supply chain management with 3PL using ACO. Expert Syst Appl 71:173\u2013191","journal-title":"Expert Syst Appl"},{"issue":"8","key":"4218_CR6","first-page":"1","volume":"5","author":"A Habib","year":"2016","unstructured":"Habib A, Rahman N, Alam J, Joarder A, Haque M (2016) A genetic algorithm based approach for cost worthy route selection in complex supply chain architecture. Int J Adv Stud Comput Sci Eng 5(8):1","journal-title":"Int J Adv Stud Comput Sci Eng"},{"key":"4218_CR7","unstructured":"Khan MA (2014) Transportation cost optimization using linear programming. In: International conference on mechanical, industrial and energy engineering"},{"issue":"1","key":"4218_CR8","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cie.2006.07.011","volume":"51","author":"F Altiparmak","year":"2006","unstructured":"Altiparmak F, Gen M, Lin L, Paksoy T (2006) A genetic algorithm approach for multi-objective optimization of supply chain networks. Comput Ind Eng 51(1):196\u2013215","journal-title":"Comput Ind Eng"},{"issue":"2","key":"4218_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cie.2006.02.006","volume":"51","author":"YH Lee","year":"2006","unstructured":"Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in the supply chain. Comput Ind Eng 51(2):247\u2013256","journal-title":"Comput Ind Eng"},{"key":"4218_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.compbiolchem.2016.05.004","volume":"64","author":"CK Saifullah","year":"2016","unstructured":"Saifullah CK, Islam MR (2016) Chemical reaction optimization for solving shortest common supersequence problem. Comput Biol Chem 64:82\u201393","journal-title":"Comput Biol Chem"},{"issue":"4","key":"4218_CR11","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13(4):1774\u20131780","journal-title":"Appl Soft Comput"},{"issue":"10","key":"4218_CR12","doi-asserted-by":"publisher","first-page":"13170","DOI":"10.1016\/j.eswa.2011.04.126","volume":"38","author":"B Alatas","year":"2011","unstructured":"Alatas B (2011) ACROA: artificial chemical reaction optimization algorithm for global optimization. Expert Syst Appl 38(10):13170\u201313180","journal-title":"Expert Syst Appl"},{"issue":"8","key":"4218_CR13","first-page":"189","volume":"7","author":"R Barham","year":"2016","unstructured":"Barham R, Sharieh A, Sliet A (2016) Chemical reaction optimization for max flow problem. Int J Adv Comput Sci Appl 7(8):189\u2013196","journal-title":"Int J Adv Comput Sci Appl"},{"issue":"10","key":"4218_CR14","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TPDS.2011.35","volume":"22","author":"J Xu","year":"2011","unstructured":"Xu J, Lam AY, Li VO (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Transa Parallel Distrib Syst 22(10):1624\u20131631","journal-title":"IEEE Transa Parallel Distrib Syst"},{"issue":"2","key":"4218_CR15","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s10489-018-1281-4","volume":"49","author":"R Kabir","year":"2019","unstructured":"Kabir R, Islam R (2019) Chemical reaction optimization for RNA structure prediction. Appl Intell 49(2):352\u2013375","journal-title":"Appl Intell"},{"key":"4218_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3200-3","author":"MR Islam","year":"2018","unstructured":"Islam MR, Saifullah CK, Asha ZT, Ahamed R (2018) Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Comput. \nhttps:\/\/doi.org\/10.1007\/s00500-018-3200-3","journal-title":"Soft Comput"},{"issue":"33","key":"4218_CR17","first-page":"8","volume":"15","author":"L Nicolescu","year":"2013","unstructured":"Nicolescu L, Galalae C, Voicu A (2013) Solving a supply chain management problem to near optimality using ant colony optimization, in an international context. Amfiteatru Econ 15(33):8","journal-title":"Amfiteatru Econ"},{"key":"4218_CR18","unstructured":"Wu B (2016) Bi-objective integrated supply chain network design under supply and demand uncertainties. Thesis, Industrial Engineering and Operations Research, Pennsylvania State University, Graduate School, College of Engineering. \nhttps:\/\/etda.libraries.psu.edu\/files\/final_submissions\/12438"},{"issue":"8","key":"4218_CR19","first-page":"6719","volume":"67","author":"A Kir\u00e1ly","year":"2012","unstructured":"Kir\u00e1ly A, Varga T, Abonyi J (2012) Constrained particle swarm optimization of supply chains. World Acad Sci Eng Technol 67(8):6719\u20136731","journal-title":"World Acad Sci Eng Technol"},{"key":"4218_CR20","unstructured":"Sitek P, Wikarek J (2012) Cost optimization of supply chain with multimodal transport. In: Computer science and information systems (FedCSIS), 2012 federated conference on. IEEE, pp 1111\u20131118"},{"issue":"3","key":"4218_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AY Lam","year":"2010","unstructured":"Lam AY, Li VO (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14(3):381\u2013399","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4218_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AY Lam","year":"2012","unstructured":"Lam AY, Li VO (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3\u201317","journal-title":"Memet Comput"},{"issue":"5","key":"4218_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TEVC.2012.2227973","volume":"17","author":"AY Lam","year":"2013","unstructured":"Lam AY, Li VO, Xu J (2013) On the convergence of chemical reaction optimization for combinatorial optimization. IEEE Trans Evol Comput 17(5):605\u2013620","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"4218_CR24","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04218-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04218-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04218-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T23:29:16Z","timestamp":1588807756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04218-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,8]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4218"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04218-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,8]]},"assertion":[{"value":"2 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}