{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:45:40Z","timestamp":1742928340146,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959320"},{"type":"electronic","value":"9783319959337"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95933-7_84","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:48:38Z","timestamp":1530773318000},"page":"763-770","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on Vehicle Routing Problem with Time Windows Restrictions"],"prefix":"10.1007","author":[{"given":"Yun-Qi","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Qing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Qin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing-Rui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Ping","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Yong","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"84_CR1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-30235-5_2","volume-title":"Nature-Inspired Computation in Engineering","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Carballedo, R., Yang, X.-S., Diaz, F.: An evolutionary discrete firefly algorithm with novel operators for solving the vehicle routing problem with time windows. In: Yang, X.-S. (ed.) Nature-Inspired Computation in Engineering. SCI, vol. 637, pp. 21\u201341. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30235-5_2"},{"issue":"18","key":"84_CR2","doi-asserted-by":"publisher","first-page":"5295","DOI":"10.1007\/s00500-016-2114-1","volume":"21","author":"E Osaba","year":"2017","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Onieva, E., Masegosa, A.D., Perallos, A.: A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft. Comput. 21(18), 5295\u20135308 (2017)","journal-title":"Soft. Comput."},{"issue":"1","key":"84_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24(1), 17\u201330 (2006)","journal-title":"Appl. Intell."},{"issue":"2","key":"84_CR4","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.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"issue":"2","key":"84_CR5","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 window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"84_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342\u2013354 (1992)","journal-title":"Oper. Res."},{"issue":"1","key":"84_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Survey paper\u2014time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1\u201313 (1988)","journal-title":"Transp. Sci."},{"key":"84_CR8","unstructured":"Gambardella, L.M., Taillard, \u00c9., Agazzi, G.: MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization (1999)"},{"key":"84_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ijpe.2013.12.028","volume":"152","author":"K Govindan","year":"2014","unstructured":"Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K.: Two-echelon multiple-vehicle location\u2013routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152, 9\u201328 (2014)","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"84_CR10","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"key":"84_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.cor.2017.08.015","volume":"89","author":"K Dalmeijer","year":"2018","unstructured":"Dalmeijer, K., Spliet, R.: A branch-and-cut algorithm for the time window assignment vehicle routing problem. Comput. Oper. Res. 89, 140\u2013152 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"84_CR12","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.34.5.803","volume":"34","author":"BL Golden","year":"1986","unstructured":"Golden, B.L., Assad, A.A.: OR forum\u2014perspectives on vehicle routing: exciting new developments. Oper. Res. 34(5), 803\u2013810 (1986)","journal-title":"Oper. Res."},{"issue":"3","key":"84_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216\u2013229 (2004)","journal-title":"Networks"},{"issue":"23\u201324","key":"84_CR14","doi-asserted-by":"publisher","first-page":"7156","DOI":"10.1080\/00207543.2012.757668","volume":"51","author":"LC Coelho","year":"2013","unstructured":"Coelho, L.C., Laporte, G.: A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51(23\u201324), 7156\u20137169 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"84_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"84_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"S Raff","year":"1983","unstructured":"Raff, S.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63\u2013211 (1983)","journal-title":"Comput. Oper. Res."}],"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-319-95933-7_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:12Z","timestamp":1709827452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95933-7_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959320","9783319959337"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95933-7_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","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":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"275","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.46","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}