{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T17:32:29Z","timestamp":1770831149837,"version":"3.50.1"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s11235-021-00833-7","type":"journal-article","created":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T09:56:50Z","timestamp":1633514210000},"page":"609-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Compact Sine Cosine Algorithm applied in vehicle routing problem with time window"],"prefix":"10.1007","volume":"78","author":[{"given":"Jeng-Shyang","family":"Pan","sequence":"first","affiliation":[]},{"given":"Qing-yong","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2117-0618","authenticated-orcid":false,"given":"Shu-Chuan","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Kuo-Chi","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"issue":"10","key":"833_CR1","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35(10), 3202\u20133212.","journal-title":"Computers & Operations Research"},{"key":"833_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","volume":"115","author":"M Nazarahari","year":"2019","unstructured":"Nazarahari, M., Khanmirza, E., & Doostie, S. (2019). Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Systems with Applications, 115, 106\u2013120.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"833_CR3","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1007\/s00500-013-1195-3","volume":"18","author":"X Zhou","year":"2014","unstructured":"Zhou, X., Wu, Z., Wang, H., & Rahnamayan, S. (2014). Enhancing differential evolution with role assignment scheme. Soft Computing, 18(11), 2209\u20132225.","journal-title":"Soft Computing"},{"key":"833_CR4","doi-asserted-by":"publisher","first-page":"112820","DOI":"10.1016\/j.eswa.2019.07.037","volume":"138","author":"O Tarkhaneh","year":"2019","unstructured":"Tarkhaneh, O., & Shen, H. (2019). An adaptive differential evolution algorithm to optimal multi-level thresholding for MRI brain image segmentation. Expert Systems with Applications, 138, 112820.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"833_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. Swarm Intelligence, 1(1), 33\u201357.","journal-title":"Swarm Intelligence"},{"issue":"6","key":"833_CR6","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.ins.2010.11.033","volume":"181","author":"S Cl","year":"2011","unstructured":"Cl, S., Jc, Z., & Js, P. (2011). An improved vector particle swarm optimization for constrained optimization problems. Information Sciences, 181(6), 1153\u20131163.","journal-title":"Information Sciences"},{"key":"833_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ins.2012.09.030","volume":"221","author":"C Sun","year":"2013","unstructured":"Sun, C., Zeng, J., Pan, J., Xue, S., & Jin, Y. (2013). A new fitness estimation strategy for particle swarm optimization. Information Sciences, 221, 355\u2013370.","journal-title":"Information Sciences"},{"key":"833_CR8","doi-asserted-by":"crossref","unstructured":"Chu, S. C., Tsai, P., & Pan, J. S. (2006). Cat swarm optimization. In Q. Yang & G. Webb (Eds.), PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science (Vol. 4099). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"833_CR9","unstructured":"Tsai, P. W., Pan, J. S., Chen, S. M., Liao, B. Y., & Hao, S. P. (2008). Parallel cat swarm optimization (Vol. 6, pp. 3328\u20133333)."},{"issue":"5","key":"833_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"X Yang","year":"2012","unstructured":"Yang, X., & Hossein Gandomi, A. (2012). Bat algorithm: A novel approach for global engineering optimization. Engineering Computations, 29(5), 464\u2013483. https:\/\/doi.org\/10.1108\/02644401211235834.","journal-title":"Engineering Computations"},{"issue":"2","key":"833_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s13042-017-0739-8","volume":"9","author":"X Cai","year":"2018","unstructured":"Cai, X., Wang, H., Cui, Z., Cai, J., Xue, Y., & Wang, L. (2018). Bat algorithm with triangle-flipping strategy for numerical optimization. International Journal of Machine Learning and Cybernetics, 9(2), 199\u2013215.","journal-title":"International Journal of Machine Learning and Cybernetics"},{"key":"833_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey wolf optimizer. Advances in Engineering Software, 69, 46\u201361.","journal-title":"Advances in Engineering Software"},{"issue":"21","key":"833_CR13","doi-asserted-by":"publisher","first-page":"4514","DOI":"10.3390\/app9214514","volume":"9","author":"P Hu","year":"2019","unstructured":"Hu, P., Pan, J. S., Chu, S. C., Chai, Q. W., Liu, T., & Li, Z. C. (2019). New hybrid algorithms for prediction of daily load of power network. Applied Sciences, 9(21), 4514.","journal-title":"Applied Sciences"},{"issue":"11","key":"833_CR14","doi-asserted-by":"publisher","first-page":"845","DOI":"10.3390\/pr7110845","volume":"7","author":"JS Pan","year":"2019","unstructured":"Pan, J. S., Hu, P., & Chu, S. C. (2019). Novel parallel heterogeneous meta-heuristic and its communication strategies for the prediction of wind power. Processes, 7(11), 845.","journal-title":"Processes"},{"key":"833_CR15","doi-asserted-by":"publisher","first-page":"105746","DOI":"10.1016\/j.knosys.2020.105746","volume":"195","author":"P Hu","year":"2020","unstructured":"Hu, P., Pan, J. S., & Chu, S. C. (2020). Improved binary grey wolf optimizer and its application for feature selection. Knowledge-Based Systems, 195, 105746. https:\/\/doi.org\/10.1016\/j.knosys.2020.105746.","journal-title":"Knowledge-Based Systems"},{"key":"833_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in Engineering Software, 95, 51\u201367.","journal-title":"Advances in Engineering Software"},{"key":"833_CR17","first-page":"1","volume":"1","author":"QW Chai","year":"2020","unstructured":"Chai, Q. W., Chu, S. C., Pan, J. S., Hu, P., & Zheng, W. M. (2020). A parallel WOA with two communication strategies applied in DV-Hop localization method. EURASIP Journal on Wireless Communications and Networking, 1, 1\u201310.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"issue":"2","key":"833_CR18","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Mirjalili, S. M., & Hatamlou, A. (2016). Multi-verse optimizer: A nature-inspired algorithm for global optimization. Neural Computing and Applications, 27(2), 495\u2013513.","journal-title":"Neural Computing and Applications"},{"key":"833_CR19","doi-asserted-by":"publisher","first-page":"32018","DOI":"10.1109\/ACCESS.2020.2973411","volume":"8","author":"X Wang","year":"2020","unstructured":"Wang, X., Pan, J. S., & Chu, S. C. (2020). A parallel multi-verse optimizer for application in multilevel image segmentation. IEEE Access, 8, 32018\u201332030.","journal-title":"IEEE Access"},{"key":"833_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.knosys.2016.06.029","volume":"109","author":"Z Meng","year":"2016","unstructured":"Meng, Z., Pan, J. S., & Xu, H. (2016). Quasi-affine transformation evolutionary (QUATRE) algorithm: A cooperative swarm based algorithm for global optimization. Knowledge-Based Systems, 109, 104\u2013121.","journal-title":"Knowledge-Based Systems"},{"key":"833_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.knosys.2018.04.034","volume":"155","author":"Z Meng","year":"2018","unstructured":"Meng, Z., & Pan, J. S. (2018). Quasi-affine transformation evolution with external archive (QUATRE-EAR): An enhanced structure for differential evolution. Knowledge-Based Systems, 155, 35\u201353.","journal-title":"Knowledge-Based Systems"},{"key":"833_CR22","doi-asserted-by":"publisher","first-page":"8583","DOI":"10.1109\/ACCESS.2020.2964783","volume":"8","author":"ZG Du","year":"2020","unstructured":"Du, Z. G., Pan, J. S., Chu, S. C., Luo, H. J., & Hu, P. (2020). Quasi-affine transformation evolutionary algorithm with communication schemes for application of RSSI in wireless sensor networks. IEEE Access, 8, 8583\u20138594.","journal-title":"IEEE Access"},{"key":"833_CR23","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.eswa.2018.10.045","volume":"119","author":"AE Ezugwu","year":"2019","unstructured":"Ezugwu, A. E., & Prayogo, D. (2019). Symbiotic organisms search algorithm: Theory, recent advances and applications. Expert Systems with Applications, 119, 184\u2013209.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"833_CR24","doi-asserted-by":"publisher","first-page":"930","DOI":"10.3390\/app10030930","volume":"10","author":"SC Chu","year":"2020","unstructured":"Chu, S. C., Du, Z. G., & Pan, J. S. (2020). Symbiotic organism search algorithm with multi-group quantum-behavior communication scheme applied in wireless sensor networks. Applied Sciences, 10(3), 930.","journal-title":"Applied Sciences"},{"issue":"1","key":"833_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"833_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S. (2016). SCA: A sine cosine algorithm for solving optimization problems. Knowledge-Based Systems, 96, 120\u2013133.","journal-title":"Knowledge-Based Systems"},{"key":"833_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105746","author":"C Qu","year":"2018","unstructured":"Qu, C., Zeng, Z., Dai, J., Yi, Z., & He, W. (2018). A modified sine\u2013cosine algorithm based on neighborhood search and greedy levy mutation. Computational Intelligence and Neuroscience. https:\/\/doi.org\/10.1016\/j.knosys.2020.105746.","journal-title":"Computational Intelligence and Neuroscience"},{"issue":"2","key":"833_CR28","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jcde.2017.08.002","volume":"5","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah, R. M. (2018). Hybridizing sine cosine algorithm with multi-orthogonal search strategy for engineering design problems. Journal of Computational Design and Engineering, 5(2), 249\u2013273.","journal-title":"Journal of Computational Design and Engineering"},{"key":"833_CR29","doi-asserted-by":"publisher","first-page":"113395","DOI":"10.1016\/j.eswa.2020.113395","volume":"154","author":"S Gupta","year":"2020","unstructured":"Gupta, S., Deep, K., Mirjalili, S., & Kim, J. H. (2020). A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Systems with Applications, 154, 113395.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"833_CR30","first-page":"15","volume":"21","author":"SC Chu","year":"2020","unstructured":"Chu, S. C., Xue, X., Pan, J. S., & Wu, X. (2020). Optimizing ontology alignment in vector space. Journal of Internet Technology, 21(1), 15\u201322.","journal-title":"Journal of Internet Technology"},{"issue":"4","key":"833_CR31","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik, G. R., Lobo, F. G., & Goldberg, D. E. (1999). The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3(4), 287\u2013297.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"833_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TEVC.2007.896689","volume":"12","author":"E Mininno","year":"2008","unstructured":"Mininno, E., Cupertino, F., & Naso, D. (2008). Real-valued compact genetic algorithms for embedded microcontroller optimization. IEEE Transactions on Evolutionary Computation, 12(2), 203\u2013219.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"833_CR33","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TEVC.2010.2058120","volume":"15","author":"E Mininno","year":"2010","unstructured":"Mininno, E., Neri, F., Cupertino, F., & Naso, D. (2010). Compact differential evolution. IEEE Transactions on Evolutionary Computation, 15(1), 32\u201354.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"833_CR34","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.3390\/app10062195","volume":"10","author":"X Sui","year":"2020","unstructured":"Sui, X., Chu, S. C., Pan, J. S., & Luo, H. (2020). Parallel compact differential evolution for optimization applied to image segmentation. Applied Sciences, 10(6), 2195.","journal-title":"Applied Sciences"},{"key":"833_CR35","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ins.2013.03.026","volume":"239","author":"F Neri","year":"2013","unstructured":"Neri, F., Mininno, E., & Iacca, G. (2013). Compact particle swarm optimization. Information Sciences, 239, 96\u2013121.","journal-title":"Information Sciences"},{"issue":"3","key":"833_CR36","doi-asserted-by":"publisher","first-page":"767","DOI":"10.3390\/su12030767","volume":"12","author":"AQ Tian","year":"2020","unstructured":"Tian, A. Q., Chu, S. C., Pan, J. S., Cui, H., & Zheng, W. M. (2020). A compact pigeon-inspired optimization for maximum short-term generation mode in cascade hydroelectric power station. Sustainability, 12(3), 767.","journal-title":"Sustainability"},{"issue":"3","key":"833_CR37","doi-asserted-by":"publisher","first-page":"333","DOI":"10.3390\/math8030333","volume":"8","author":"JS Pan","year":"2020","unstructured":"Pan, J. S., Song, P. C., Chu, S. C., & Peng, Y. J. (2020). Improved compact cuckoo search algorithm applied to location of drone logistics hub. Mathematics, 8(3), 333.","journal-title":"Mathematics"},{"key":"833_CR38","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/869627","author":"HW Wang","year":"2015","unstructured":"Wang, H. W., Chen, C. H., Cheng, D. Y., Lin, C. H., & Lo, C. C. (2015). A real-time pothole detection approach for intelligent transportation system. Mathematical Problems in Engineering. https:\/\/doi.org\/10.1155\/2015\/869627.","journal-title":"Mathematical Problems in Engineering"},{"issue":"5","key":"833_CR39","doi-asserted-by":"publisher","first-page":"4231","DOI":"10.1109\/JIOT.2018.2863555","volume":"5","author":"CH Chen","year":"2018","unstructured":"Chen, C. H. (2018). An arrival time prediction method for bus system. IEEE Internet of Things Journal, 5(5), 4231\u20134232.","journal-title":"IEEE Internet of Things Journal"},{"key":"833_CR40","doi-asserted-by":"crossref","unstructured":"Wang, W., Wu, B., Zhao, Y., & Feng, D. (2006). Particle swarm optimization for open vehicle routing problem. In D. S. Huang, K. Li, & G. W. Irwin (Eds.), Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science (Vol. 4114). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-37275-2_126"},{"key":"833_CR41","unstructured":"Prosser, P., & Shaw, P. (1996). Study of greedy search with multiple improvement heuristics for vehicle routing problems. Technical report, RR96\/201, Department of Computer Science, Glasgow, Scotland: University of Strathclyde."},{"issue":"3","key":"833_CR42","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan, K. C., Lee, L. H., Zhu, Q., & Ou, K. (2001). Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, 15(3), 281\u2013295.","journal-title":"Artificial Intelligence in Engineering"},{"issue":"7","key":"833_CR43","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.cor.2006.11.006","volume":"35","author":"B Kallehauge","year":"2008","unstructured":"Kallehauge, B. (2008). Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & Operations Research, 35(7), 2307\u20132330.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"833_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1\u20136.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"833_CR45","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"JF Bard","year":"2002","unstructured":"Bard, J. F., Kontoravdis, G., & Yu, G. (2002). A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science, 36(2), 250\u2013269.","journal-title":"Transportation Science"},{"issue":"5","key":"833_CR46","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies, 19(5), 723\u2013740.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"833_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01714-3","author":"M Bruglieri","year":"2021","unstructured":"Bruglieri, M., Mancini, S., & Pisacane, O. (2021). A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations. Optimization Letters. https:\/\/doi.org\/10.1007\/s11590-021-01714-3.","journal-title":"Optimization Letters"},{"key":"833_CR48","unstructured":"Cook, W., & Rich, J. L. (1999). A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report. https:\/\/hdl.handle.net\/1911\/101910"},{"key":"833_CR49","doi-asserted-by":"crossref","unstructured":"Moradi, B. (2020). The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model. Soft Computing, 24(9), 6741\u20136769.","DOI":"10.1007\/s00500-019-04312-9"},{"issue":"1","key":"833_CR50","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jksues.2014.04.007","volume":"29","author":"B Afshar-Nadjafi","year":"2017","unstructured":"Afshar-Nadjafi, B., & Afshar-Nadjafi, A. (2017). A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet. Journal of King Saud University-Engineering Sciences, 29(1), 29\u201334.","journal-title":"Journal of King Saud University-Engineering Sciences"},{"key":"833_CR51","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cor.2017.06.021","volume":"88","author":"S Mancini","year":"2017","unstructured":"Mancini, S. (2017). A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times. Computers & Operations Research, 88, 290\u2013296.","journal-title":"Computers & Operations Research"},{"key":"833_CR52","doi-asserted-by":"crossref","unstructured":"Dixit, A., Mishra, A., & Shukla, A. (2019). Vehicle routing problem with time windows using meta-heuristic algorithms: A survey. In N. Yadav, A. Yadav, J. Bansal, K. Deep, & J. Kim (Eds.), Harmony search and nature inspired optimization algorithms. Advances in Intelligent Systems and Computing (Vol. 741). Singapore: Springer.","DOI":"10.1007\/978-981-13-0761-4_52"},{"issue":"1","key":"833_CR53","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1), 119\u2013139.","journal-title":"Transportation Science"},{"key":"833_CR54","unstructured":"Lysgaard, J. (1997). Clarke & Wright\u2019s savings algorithm (p. 44). The Aarhus School of Business: Department of Management Science and Logistics."},{"key":"833_CR55","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2011.09.040","volume":"98","author":"Q Ding","year":"2012","unstructured":"Ding, Q., Hu, X., Sun, L., & Wang, Y. (2012). An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing, 98, 101\u2013107.","journal-title":"Neurocomputing"},{"issue":"2","key":"833_CR56","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jmsy.2011.04.005","volume":"30","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam, R., Gazanfari, M., Alinaghian, M., Salamatbakhsh, A., & Norouzi, N. (2011). A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. Journal of Manufacturing Systems, 30(2), 83\u201392.","journal-title":"Journal of Manufacturing Systems"},{"issue":"12","key":"833_CR57","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1016\/S0305-0548(03)00163-1","volume":"31","author":"J Berger","year":"2004","unstructured":"Berger, J., & Barkaoui, M. (2004). A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 31(12), 2037\u20132053.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"833_CR58","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02579017","volume":"10","author":"O Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2002). Tabu search heuristics for the vehicle routing problem with time windows. Top, 10(2), 211\u2013237.","journal-title":"Top"},{"issue":"2","key":"833_CR59","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/TSMCC.2011.2148712","volume":"42","author":"YJ Gong","year":"2011","unstructured":"Gong, Y. J., Zhang, J., Liu, O., Huang, R. Z., Chung, H. S. H., & Shi, Y. H. (2011). Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 42(2), 254\u2013267.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)"},{"key":"833_CR60","doi-asserted-by":"publisher","first-page":"102861","DOI":"10.1016\/j.trc.2020.102861","volume":"121","author":"K Zhang","year":"2020","unstructured":"Zhang, K., He, F., Zhang, Z., Lin, X., & Li, M. (2020). Multi-vehicle routing problems with soft time windows: A multi-agent reinforcement learning approach. Transportation Research Part C: Emerging Technologies, 121, 102861.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"5","key":"833_CR61","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1051\/ro\/2019080","volume":"54","author":"B Chen","year":"2020","unstructured":"Chen, B., Qu, R., Bai, R., & Laesanklang, W. (2020). A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO-Operations Research, 54(5), 1467\u20131494.","journal-title":"RAIRO-Operations Research"},{"issue":"4","key":"833_CR62","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1002\/oca.2591","volume":"41","author":"R Devarapalli","year":"2020","unstructured":"Devarapalli, R., & Bhattacharyya, B. (2020). A hybrid modified grey wolf optimization-sine cosine algorithm-based power system stabilizer parameter tuning in a multimachine power system. Optimal Control Applications and Methods, 41(4), 1143\u20131159.","journal-title":"Optimal Control Applications and Methods"},{"key":"833_CR63","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ijepes.2018.01.024","volume":"99","author":"AF Attia","year":"2018","unstructured":"Attia, A. F., El Sehiemy, R. A., & Hasanien, H. M. (2018). Optimal power flow solution in power systems using a novel sine\u2013cosine algorithm. International Journal of Electrical Power & Energy Systems, 99, 331\u2013343.","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"833_CR64","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.enconman.2018.02.012","volume":"163","author":"J Wang","year":"2018","unstructured":"Wang, J., Yang, W., Du, P., & Niu, T. (2018). A novel hybrid forecasting system of wind speed based on a newly developed multi-objective sine cosine algorithm. Energy Conversion and Management, 163, 134\u2013150.","journal-title":"Energy Conversion and Management"},{"issue":"19","key":"833_CR65","doi-asserted-by":"publisher","first-page":"25761","DOI":"10.1007\/s11042-018-5815-x","volume":"77","author":"D Oliva","year":"2018","unstructured":"Oliva, D., Hinojosa, S., Abd Elaziz, M., & Ortega-S\u00e1nchez, N. (2018). Context based image segmentation using antlion optimization and sine cosine algorithm. Multimedia Tools and Applications, 77(19), 25761\u201325797.","journal-title":"Multimedia Tools and Applications"},{"issue":"19","key":"833_CR66","doi-asserted-by":"publisher","first-page":"6409","DOI":"10.1007\/s00500-017-2695-3","volume":"22","author":"S Das","year":"2018","unstructured":"Das, S., Bhattacharya, A., & Chakraborty, A. K. (2018). Solution of short-term hydrothermal scheduling using sine cosine algorithm. Soft Computing, 22(19), 6409\u20136427.","journal-title":"Soft Computing"},{"key":"833_CR67","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.knosys.2018.12.008","volume":"165","author":"S Gupta","year":"2019","unstructured":"Gupta, S., & Deep, K. (2019). Improved sine cosine algorithm with crossover scheme for global optimization. Knowledge-Based Systems, 165, 374\u2013406.","journal-title":"Knowledge-Based Systems"},{"key":"833_CR68","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.eswa.2017.07.043","volume":"90","author":"M Abd Elaziz","year":"2017","unstructured":"Abd Elaziz, M., Oliva, D., & Xiong, S. (2017). An improved opposition-based sine cosine algorithm for global optimization. Expert Systems with Applications, 90, 484\u2013500.","journal-title":"Expert Systems with Applications"},{"key":"833_CR69","doi-asserted-by":"publisher","first-page":"105481","DOI":"10.1016\/j.asoc.2019.04.044","volume":"81","author":"W Guo","year":"2019","unstructured":"Guo, W., Wang, Y., Zhao, F., & Dai, F. (2019). Riesz fractional derivative elite-guided sine cosine algorithm. Applied Soft Computing, 81, 105481.","journal-title":"Applied Soft Computing"},{"key":"833_CR70","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.asoc.2017.09.039","volume":"62","author":"H Nenavath","year":"2018","unstructured":"Nenavath, H., & Jatoth, R. K. (2018). Hybridizing sine cosine algorithm with differential evolution for global optimization and object tracking. Applied Soft Computing, 62, 1019\u20131043.","journal-title":"Applied Soft Computing"},{"key":"833_CR71","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.asoc.2018.09.019","volume":"73","author":"SN Chegini","year":"2018","unstructured":"Chegini, S. N., Bagheri, A., & Najafi, F. (2018). PSOSCALF: A new hybrid PSO based on sine cosine algorithm and levy flight for solving optimization problems. Applied Soft Computing, 73, 697\u2013726.","journal-title":"Applied Soft Computing"},{"key":"833_CR72","doi-asserted-by":"publisher","first-page":"17744","DOI":"10.1109\/ACCESS.2021.3054053","volume":"9","author":"H Xian","year":"2021","unstructured":"Xian, H., Yang, C., Wang, H., & Yang, X. (2021). A modified sine cosine algorithm with teacher supervision learning for global optimization. IEEE Access, 9, 17744\u201317766.","journal-title":"IEEE Access"},{"key":"833_CR73","doi-asserted-by":"publisher","first-page":"28211","DOI":"10.1109\/ACCESS.2019.2900486","volume":"7","author":"C Li","year":"2019","unstructured":"Li, C., Luo, Z., Song, Z., Yang, F., Fan, J., & Liu, P. X. (2019). An enhanced brain storm sine cosine algorithm for global optimization problems. IEEE Access, 7, 28211\u201328229.","journal-title":"IEEE Access"},{"key":"833_CR74","unstructured":"Liang, J., Qu, B., Suganthan, P., & Hern\u00e1ndez-D\u00edaz, A. G. (2013). Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. In Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical report (Vol. 201212, No. 34, pp. 281\u2013295)."},{"issue":"10","key":"833_CR75","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.3390\/app9101973","volume":"9","author":"TT Nguyen","year":"2019","unstructured":"Nguyen, T. T., Pan, J. S., & Dao, T. K. (2019). A compact bat algorithm for unequal clustering in wireless sensor networks. Applied Sciences, 9(10), 1973.","journal-title":"Applied Sciences"},{"key":"833_CR76","doi-asserted-by":"crossref","unstructured":"Dao, T. K., Chu, S. C., Shieh, C. S., & Horng, M. F. (2014). Compact artificial bee colony (pp. 96\u2013105).","DOI":"10.1007\/978-3-319-07455-9_11"},{"issue":"1","key":"833_CR77","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., & Taillard, \u00c9. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1), 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"833_CR78","doi-asserted-by":"crossref","unstructured":"Homberger, J. (2000). Verteilt-parallele metaheuristiken zur tourenplanung. Deutscher Universit\u00e4tsverlag.","DOI":"10.1007\/978-3-322-97815-8"},{"issue":"1","key":"833_CR79","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0377-2217(02)00486-1","volume":"150","author":"H Li","year":"2003","unstructured":"Li, H., & Lim, A. (2003). Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research, 150(1), 115\u2013127.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"833_CR80","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., & Potvin, J. Y. (1997). A Tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170\u2013186.","journal-title":"Transportation Science"},{"key":"833_CR81","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming (pp. 417\u2013431). Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"3","key":"833_CR82","doi-asserted-by":"publisher","first-page":"671","DOI":"10.3390\/s19030671","volume":"19","author":"J Wang","year":"2019","unstructured":"Wang, J., Gao, Y., Liu, W., Sangaiah, A. K., & Kim, H. J. (2019). An improved routing schema with special clustering using PSO algorithm for heterogeneous wireless sensor network. Sensors, 19(3), 671.","journal-title":"Sensors"},{"key":"833_CR83","doi-asserted-by":"crossref","unstructured":"Wang, J., Xu, H., Teo, K. L., Sun, J., & Ye, J. (2020). Mixed-integer minimax dynamic optimization for structure identification of glycerol metabolic network. Applied Mathematical Modelling, 82, 503\u2013520.","DOI":"10.1016\/j.apm.2020.01.042"},{"issue":"2","key":"833_CR84","first-page":"422","volume":"10","author":"GB Sun","year":"2019","unstructured":"Sun, G. B., Chiu, Y. J., Cao, J. H., & Wang, Y. (2019). A dynamic programming based fuzzy logic energy management strategy for series\u2013parallel hybrid electric vehicles. Journal of Information Hiding and Multimedia Signal Processing, 10(2), 422\u2013433.","journal-title":"Journal of Information Hiding and Multimedia Signal Processing"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-021-00833-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-021-00833-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-021-00833-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T17:11:12Z","timestamp":1635441072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-021-00833-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,6]]},"references-count":84,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["833"],"URL":"https:\/\/doi.org\/10.1007\/s11235-021-00833-7","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,6]]},"assertion":[{"value":"16 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}