{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:38:35Z","timestamp":1742924315891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031162091"},{"type":"electronic","value":"9783031162107"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16210-7_50","type":"book-chapter","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T23:03:09Z","timestamp":1663714989000},"page":"612-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Memetic Approach for Routing Problem with Capacity and Time Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2885-0085","authenticated-orcid":false,"given":"Imen","family":"Boudali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marwa","family":"Ragmoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"issue":"6","key":"50_CR1","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"G Alvarenga","year":"2007","unstructured":"Alvarenga, G., Mateus, G., De Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6), 1561\u20131584 (2007)","journal-title":"Comput. Oper. Res."},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.001","volume":"83","author":"A Alvarez","year":"2017","unstructured":"Alvarez, A., Munari, P.A.: An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput. Oper. Res. 83, 1\u201312 (2017)","journal-title":"Comput. Oper. Res."},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Azi, N., Gendreau, M., Potvin, J.-Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles.\u00a0Euro. J. Oper. Res. 202(3), 756\u2013763 (2010)","DOI":"10.1016\/j.ejor.2009.06.034"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms\u00a0for\u00a0solving\u00a0the\u00a0vehicle routing problem under capacity\u00a0and\u00a0time window constraints.\u00a0Euro. J. Oper. Res. 218(1),\u00a01\u20136 (2012)","DOI":"10.1016\/j.ejor.2011.07.037"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Boudali, I., Mlayah, I.: A hybrid stochastic HS-GRASP algorithm for the VRP with time windows. In: Proceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence - MedPRAI, pp. 64\u201370 (2016)","DOI":"10.1145\/3038884.3038895"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Boujlil, M., Lissane Elhaq, S.: The vehicle routing problem with time window and stochastic demands: review. In: Proceedings of IEEE 13th International Colloquium of Logistics and Supply Chain Management (LOGISTIQUA), pp. 1\u20136 (2020)","DOI":"10.1109\/LOGISTIQUA49782.2020.9353927"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Madsen, O.-B.G., Ropke, S.: The vehicle routing problems with time windows. In:  Toth, P.,  Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, 2nd edn., Chapter 5, pp. 119\u2013159.  MOS-SIAM Series on Optimization, Philadelphia (2014)","DOI":"10.1137\/1.9781611973594.ch5"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, generalized k-path inequalities, and partial elementarity for the vehicle routing problem with time windows. Transp. Sci. 42, 387\u2013404 (2008)","journal-title":"Transp. Sci."},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Elshaer, R., Awad, H.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants.\u00a0Comput. Ind. Eng. 140, 106242 (2020)","DOI":"10.1016\/j.cie.2019.106242"},{"issue":"2","key":"50_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ejor.2010.02.037","volume":"206","author":"G Guti\u00e9rrez-Jarpa","year":"2010","unstructured":"Guti\u00e9rrez-Jarpa, G., Desaulniers, G., Laporte, G., Marianov, V.: A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. Eur. J. Oper. Res. 206(2), 341\u2013349 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"50_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/TSMCC.2011.2148712","volume":"42","author":"Y-J Gong","year":"2012","unstructured":"Gong, Y.-J., Zhang, J., Liu, O., Huang, R., Shu-Hung Chung, H., Shi, Y.: Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach. IEEE Trans. Syst. Man Cybern. Part C 42(2), 254\u2013267 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle routing problem with time windows. J. Oper. Res. 56, 497\u2013511 (2008)","journal-title":"J. Oper. Res."},{"issue":"3","key":"50_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AYS Lam","year":"2010","unstructured":"Lam, A.Y.S., Li, V.O.K.: Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans. Evol. Comput. 14(3), 381\u2013399 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Lam, A.Y.S., Li, V.O.K, Yu, J.J.Q.: Real-coded chemical reaction optimization. IEEE Trans. Evolut. Comput. 16(3), 339\u2013353 (2012)","DOI":"10.1109\/TEVC.2011.2161091"},{"issue":"5","key":"50_CR15","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TEVC.2012.2227973","volume":"17","author":"AYS Lam","year":"2013","unstructured":"Lam, A.Y.S., Li, V.O.K., Xu, J.: On the convergence of chemical-reaction optimization for combinatorial optimization. IEEE Trans. Evolut. Comput. 17(5), 605\u2013620 (2013)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AYS Lam","year":"2012","unstructured":"Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization: a tutorial. Memetic Comput. 4, 3\u201317 (2012). https:\/\/doi.org\/10.1007\/s12293-012-0075-1","journal-title":"Memetic Comput."},{"key":"50_CR17","unstructured":"Michelini, S., Arda, Y., Crama, Y., K\u00fc\u00e7\u00fckaydin, H.:\u00a0Exact and heuristic solution methods for a VRP with time windows and variable service start time. QuantOM \u2013 HEC- Universit\u00e9 de Li\u00e8ge. In: ORBEL 29th Meeting of the Belgium Operational Research Society (2015)"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic Publishers (2003)","DOI":"10.1007\/0-306-48056-5_8"},{"issue":"2","key":"50_CR19","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time windows constraints. J. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"J. Oper. Res."},{"key":"50_CR20","doi-asserted-by":"publisher","unstructured":"Tan, X., Zhuo, X., Zhang, J.: Ant colony system for optimizing vehicle routing problem with time windows (VRPTW). In: Huang, DS., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCS, vol. 4115, pp. 33\u201338. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11816102_4","DOI":"10.1007\/11816102_4"},{"key":"50_CR21","doi-asserted-by":"publisher","unstructured":"Thangiah,\u00a0S.: Vehicle routing with time windows using genetic algorithms. In: Chambers, L. (eds.) Application Handbook of Genetic Algorithms: New Frontiers, vol. 2, pp. 253\u2013277. CRC Press, Boca Raton (1995). https:\/\/doi.org\/10.1201\/9781420050073.ch11","DOI":"10.1201\/9781420050073.ch11"},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"Xu, J., Lam, A.Y.S., Li, V.O.K.:\u00a0Chemical reaction optimization for task scheduling in grid computing. IEEE Trans. Parallel Distrib. Syst. 22(10), 1624\u20131631 (2011)","DOI":"10.1109\/TPDS.2011.35"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"Yassen, E-T., Masri, A. et al.:\u00a0 Harmony search algorithm for vehicle routing problem with time windows.\u00a0J. Appl. Sci. 13, 633\u2013638 (2013)","DOI":"10.3923\/jas.2013.633.638"},{"key":"50_CR24","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Cattaruzza, D., Ogier, M., Semet, F., Vigo, D.: A column generation based heuristic for the generalized vehicle routing problem with time windows. Transp. Res. Part E Logist. Transp. Rev. 152, 102391 (2021)","DOI":"10.1016\/j.tre.2021.102391"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16210-7_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T12:23:09Z","timestamp":1678364589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16210-7_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031162091","9783031162107"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16210-7_50","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}