{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:09:33Z","timestamp":1743142173179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030845216"},{"type":"electronic","value":"9783030845223"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-84522-3_56","type":"book-chapter","created":{"date-parts":[[2021,8,8]],"date-time":"2021-08-08T23:04:24Z","timestamp":1628463864000},"page":"684-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Grey Wolf Optimizer for Vehicle Routing Problem with Multiple Time Windows"],"prefix":"10.1007","author":[{"given":"Nan","family":"Li","sequence":"first","affiliation":[]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Nai-Kang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"issue":"2","key":"56_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(98)00248-3","volume":"117","author":"G Pesant","year":"1999","unstructured":"Pesant, G., Gendreau, M., Potvin, J.Y., et al.: On the flexibility of constraint programming models: from single to multiple time windows for the traveling salesman problem. Eur. J. Oper. Res. 117(2), 253\u2013263 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"56_CR2","first-page":"2359","volume":"39","author":"G Asvin","year":"2011","unstructured":"Asvin, G.: The Canadian minimum duration truck driver scheduling problem. Comput. Oper. Res. 39(10), 2359\u20132367 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"56_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/trsc.1110.0377","volume":"47","author":"W Souffriau","year":"2013","unstructured":"Souffriau, W., Vansteenwegen, P., Berghe, G.V., et al.: The multiconstraint team orienteering problem with multiple time windows. Transport. Sci. 47(1), 53\u201363 (2013)","journal-title":"Transport. Sci."},{"issue":"2","key":"56_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1080\/09720502.2007.10700491","volume":"10","author":"D Favaretto","year":"2007","unstructured":"Favaretto, D., Moretti, E.: Ant colony system for a VRP with multiple time windows and multiple visits. J. Interdisc. Math. 10(2), 263\u2013284 (2007)","journal-title":"J. Interdisc. Math."},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.cie.2015.10.005","volume":"90","author":"AK Beheshti","year":"2015","unstructured":"Beheshti, A.K., Hejazi, S.R., Alinaghian, M.: The vehicle routing problem with multiple prioritized time windows: a case study. Comput. Ind. Eng. 90, 402\u2013413 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Belhaiza, S., M'Hallah, R.: A pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE (2016)","DOI":"10.1109\/CEC.2016.7744235"},{"issue":"2","key":"56_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/trsc.2019.0912","volume":"54","author":"M Hoogeboom","year":"2020","unstructured":"Hoogeboom, M., Dullaert, W., Lai, D., et al.: Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows. Transport. Sci. 54(2), 400\u2013416 (2020)","journal-title":"Transport. Sci."},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Bogue, E.T., Ferreira, H.S., Noronha, T.F., et al.: A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows. Optim. Lett. (6) (2020)","DOI":"10.1007\/s11590-019-01530-w"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"2010","unstructured":"Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (2010)","journal-title":"Networks"},{"key":"56_CR11","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.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"56_CR12","first-page":"278","volume":"16","author":"BP Sahoo","year":"2018","unstructured":"Sahoo, B.P., Panda, S.: Improved grey wolf optimization technique for fuzzy aided PID controller design for power system frequency control. Sustain. Energy. Grids. 16, 278\u2013299 (2018)","journal-title":"Sustain. Energy. Grids."},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2018.07.055","volume":"72","author":"H Esmaeil","year":"2018","unstructured":"Esmaeil, H., Sobhan, M., Parham, S.: A grey wolf optimizer-based neural network coupled with response surface method for modeling the strength of siro-spun yarn in spinning mills. Appl Soft Comput. 72, 1\u201313 (2018)","journal-title":"Appl Soft Comput."},{"issue":"1","key":"56_CR14","doi-asserted-by":"publisher","first-page":"012014","DOI":"10.1088\/1757-899X\/83\/1\/012014","volume":"83","author":"L Korayem","year":"2015","unstructured":"Korayem, L., Khorsid, M., Kassem, S.S.: Using grey wolf algorithm to solve the capacitated vehicle routing problem. IOP Conf. Ser. Mater. Sci. Eng. 83(1), 012014 (2015)","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"issue":"07","key":"56_CR15","first-page":"1655","volume":"37","author":"CC Huang","year":"2020","unstructured":"Huang, C.C., Wei, X., Huang, D.Q., Ye, J.H.: Hybrid frog leaping gray wolf optimization algorithm for solving high dimensional complex functions. Contl. Theor. Appl. 37(07), 1655\u20131666 (2020)","journal-title":"Contl. Theor. Appl."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84522-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:53:46Z","timestamp":1710345226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84522-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030845216","9783030845223"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84522-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2021\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}