{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:45:29Z","timestamp":1743086729213,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819755776"},{"type":"electronic","value":"9789819755783"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-5578-3_36","type":"book-chapter","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:04:14Z","timestamp":1724137454000},"page":"443-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Branch-and-Price Heuristic Algorithm for Vehicle Routing Problem with Soft Time Windows"],"prefix":"10.1007","author":[{"given":"Han","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nai-kang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuo-cheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"21258","DOI":"10.1109\/ACCESS.2021.3056067","volume":"9","author":"M He","year":"2021","unstructured":"He, M., Wei, Z., Wu, X., et al.: An adaptive variable neighborhood search ant colony algorithm for vehicle routing problem with soft time windows. IEEE Access 9, 21258\u201321266 (2021)","journal-title":"IEEE Access"},{"issue":"4","key":"36_CR2","doi-asserted-by":"publisher","first-page":"2473","DOI":"10.1007\/s11831-022-09874-w","volume":"30","author":"M Salehi Sarbijan","year":"2023","unstructured":"Salehi Sarbijan, M., Behnamian, J.: Emerging research fields in vehicle routing problem: a short review. Archives Comput. Methods Eng. 30(4), 2473\u20132491 (2023)","journal-title":"Archives Comput. Methods Eng."},{"issue":"3\u20134","key":"36_CR3","first-page":"369","volume":"6","author":"TR Sexton","year":"1986","unstructured":"Sexton, T.R., Choi, Y.M.: Pickup and delivery of partial loads with \u201csoft\u201d time windows. Am. J. Math. Manag. Sci. 6(3\u20134), 369\u2013398 (1986)","journal-title":"Am. J. Math. Manag. Sci."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Liberatore, F., Righini, G., Salani, M.: A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9, 49\u201382 (2011)","DOI":"10.1007\/s10288-010-0136-6"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s12532-014-0064-0","volume":"6","author":"A Bettinelli","year":"2014","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6, 171\u2013197 (2014)","journal-title":"Math. Program. Comput."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.cie.2014.08.011","volume":"76","author":"KS Abdallah","year":"2014","unstructured":"Abdallah, K.S., Jang, J.: An exact solution for vehicle routing problems with semi-hard resource constraints[J]. Comput. Ind. Eng. 76, 366\u2013377 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.ejor.2013.05.024","volume":"236","author":"D Ta\u015f","year":"2014","unstructured":"Ta\u015f, D., Gendreau, M., Dellaert, N., et al.: Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3), 789\u2013799 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zeng, Q., Li, X., et al.: A branch-and-price heuristic algorithm for the ART and external truck scheduling problem in an automated container terminal with a parallel layout. Trans. Res. Part E: Logist. Trans. Rev. 184, 103464 (2024)","DOI":"10.1016\/j.tre.2024.103464"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Cattaruzza, D., Ogier, M., et al.: A column generation based heuristic for the generalized vehicle routing problem with time windows. Trans. Res. Part E: Logist. Trans. Rev. 152, 102391 (2021)","DOI":"10.1016\/j.tre.2021.102391"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Hosoda, J., Maher, S.J., Shinano, Y., et al.: A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network. Comput. Operat. Res., 106570 (2024)","DOI":"10.1016\/j.cor.2024.106570"},{"issue":"2","key":"36_CR11","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":"10","key":"36_CR12","first-page":"2571","volume":"25","author":"YJ Han","year":"2019","unstructured":"Han, Y.J., Peng, Y.F., Wei, H., et al.: Hyper-heuristic genetic algorithm for vehicle routing problem with soft time windows. Comput. Integr. Manuf. Syst. 25(10), 2571\u20132579 (2019)","journal-title":"Comput. Integr. Manuf. Syst."},{"issue":"5","key":"36_CR13","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M Dror","year":"1994","unstructured":"Dror, M.: Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42(5), 977\u2013978 (1994)","journal-title":"Oper. Res."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Feillet, D., Dejax, P., Gendreau, M., et al.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Netw. Inter. J. 44(3), 216\u2013229","DOI":"10.1002\/net.20033"},{"key":"36_CR15","unstructured":"Desrochers, M.: An algorithm for the shortest path problem with resource constraints. \u00c9cole des hautes \u00e9tudes commerciales, Groupe d'\u00e9tudes et de recherche en analyse des d\u00e9cisions (1988)"},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res.. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res.. Res."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5578-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:09:09Z","timestamp":1724137749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5578-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755776","9789819755783"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5578-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","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":"Tianjin","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2024\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}