{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:20:36Z","timestamp":1743070836803,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"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_35","type":"book-chapter","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:04:14Z","timestamp":1724137454000},"page":"431-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Branch and Price Algorithm for the Two-Agent Heterogeneous Fleet Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Jie","family":"Li","sequence":"first","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":"Zi-Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Hoff, A., Andersson, H., Christiansen, M., Hasle, G., L\u00f8kketangen, A.: A industrial aspects and literature survey: fleet composition and routing. Comput. Oper. Res. 37, 2041\u20132061 (2010)","DOI":"10.1016\/j.cor.2010.03.015"},{"issue":"12","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., et al.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12), 1153\u20131173 (1999)","journal-title":"Comput. Oper. Res."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 152(1), 148\u2013158 (2004)","DOI":"10.1016\/S0377-2217(02)00669-0"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"M\u00e1ximo, V.R., Cordeau, J.F., Nascimento, M.C.V.: An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res., 105954 (2022)","DOI":"10.1016\/j.cor.2022.105954"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Kwon, Y.J., Choi, Y.J., et al.: Heterogeneous fixed fleet vehicle routing considering carbon emission. Transp. Res. Part D Transp. Environ., 81\u201389 (2013)","DOI":"10.1016\/j.trd.2013.04.001"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Pace, S., Turky, A., Moser, I., et al.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Comput. Sci. 51, 2257\u20132266 (2015)","DOI":"10.1016\/j.procs.2015.05.382"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Konak, A.: The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion. Transp. Res. Part E Logistics Transp. Rev., 146\u2013166 (2016)","DOI":"10.1016\/j.tre.2016.01.011"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Penna, P., Subramanian, A., Ochi, L., et al.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. (2018)","DOI":"10.1007\/s10479-017-2642-9"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, D., Zhang, J.: Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions. J. Cleaner Prod., 896\u2013908 (2018)","DOI":"10.1016\/j.jclepro.2018.08.075"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Yu, V.F., Jewpanya, P., Redi, A., An, P., et al.: Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks. Comput. Oper. Res., 105205 (2021)","DOI":"10.1016\/j.cor.2020.105205"},{"issue":"8","key":"35_CR12","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/TITS.2022.3197424","volume":"24","author":"H Wang","year":"2023","unstructured":"Wang, H., Li, M., Wang, Z., et al.: Heterogeneous fleets for green vehicle routing problem with traffic restrictions. IEEE Trans. Intell. Transp. Syst. 24(8), 667\u20138676 (2023)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., et al.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res., 1\u201321(2016)","DOI":"10.1016\/j.ejor.2015.07.020"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.trb.2019.03.009","volume":"122","author":"Y Yu","year":"2019","unstructured":"Yu, Y., Wang, S., Wang, J., et al.: A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows. Transp. Res. Part B Methodol. 122, 511\u2013527 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp. Res. Part C Emerging Technol. 19(5), 723\u2013740 (2011)","DOI":"10.1016\/j.trc.2010.07.008"},{"key":"35_CR16","doi-asserted-by":"publisher","unstructured":"Pessoa, A., Poggi, D.E., Arag\u00e3o, M., Uchoa, E.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 150\u2013160. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72845-0_12","DOI":"10.1007\/978-3-540-72845-0_12"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34(7), 2080\u20132095 (2007)","DOI":"10.1016\/j.cor.2005.08.002"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO \u2013 Oper. Res., 1\u201314 (1999)","DOI":"10.1051\/ro:1999101"},{"key":"35_CR19","doi-asserted-by":"crossref","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. Programm. Comput. 6(2), 171\u2013197 (2014)","DOI":"10.1007\/s12532-014-0064-0"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E.: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2), 530\u2013543 (2018)","DOI":"10.1016\/j.ejor.2018.04.009"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Liu, J., Smith, A.E., Qian, D.: The vehicle loading problem with a heterogeneous transport fleet. Comput. Ind. Eng. 97, 137\u2013145 (2016)","DOI":"10.1016\/j.cie.2016.04.021"},{"key":"35_CR22","unstructured":"Faganello, R., Amaral, V.: Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Comput. Ind. Eng. (2020)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Baker, K.R., Cole Smith, J.: A multiple-criterion model for machine scheduling. J. Sched., 7\u201316 (2003)","DOI":"10.1023\/A:1022231419049"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Mirchandani, P.B., et al.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","DOI":"10.1287\/opre.1030.0092"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Gharaei, A., Jolai, F.: A branch and price approach to the two-agent integrated production and distribution scheduling. Comput. Ind. Eng. 136, 504\u2013515 (2019)","DOI":"10.1016\/j.cie.2019.07.050"}],"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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:09:03Z","timestamp":1724137743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5578-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755776","9789819755783"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5578-3_35","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":"We have no competing interests to declare that are relevant to the content of this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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"}}]}}