Abstract
In this paper, a two-agent heterogeneous fleet vehicle routing problem with time windows (TAHF_VRPTW) is considered. The objective of the first agent is to minimize the total tardiness and the objective of the second agent is to minimize the total transportation cost. A new mixed integer programming model (MILP) is built for this problem, and then a new branch and price algorithm (NBAPA) is proposed to address it. In the NBAPA, a genetic algorithm (GA) is developed to construct the initial columns, and a label algorithm is designed to exactly solve sub-problems. If the optimal solution obtained by column generation contains real elements, this solution should be used for branch operation. Extensive computational experiments are conducted on the Solomon benchmark instances. The results show that within the specified time, compared with the standard BAP algorithm (i.e., the BAP without using GA to generate initial columns), the NBAPA can reduce the computation time by an average of 28.32% and the average number of branches by 42.29%.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)
Hoff, A., Andersson, H., Christiansen, M., Hasle, G., Løkketangen, A.: A industrial aspects and literature survey: fleet composition and routing. Comput. Oper. Res. 37, 2041–2061 (2010)
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–1173 (1999)
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–158 (2004)
Máximo, 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)
Kwon, Y.J., Choi, Y.J., et al.: Heterogeneous fixed fleet vehicle routing considering carbon emission. Transp. Res. Part D Transp. Environ., 81–89 (2013)
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–2266 (2015)
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–166 (2016)
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)
Li, J., Wang, D., Zhang, J.: Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions. J. Cleaner Prod., 896–908 (2018)
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)
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–8676 (2023)
Koç, Ç., Bektaş, T., Jabali, O., et al.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res., 1–21(2016)
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–527 (2019)
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–740 (2011)
Pessoa, A., Poggi, D.E., Aragão, 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–160. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72845-0_12
Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34(7), 2080–2095 (2007)
Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO – Oper. Res., 1–14 (1999)
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–197 (2014)
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–543 (2018)
Liu, J., Smith, A.E., Qian, D.: The vehicle loading problem with a heterogeneous transport fleet. Comput. Ind. Eng. 97, 137–145 (2016)
Faganello, R., Amaral, V.: Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Comput. Ind. Eng. (2020)
Baker, K.R., Cole Smith, J.: A multiple-criterion model for machine scheduling. J. Sched., 7–16 (2003)
Agnetis, A., Mirchandani, P.B., et al.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229–242 (2004)
Gharaei, A., Jolai, F.: A branch and price approach to the two-agent integrated production and distribution scheduling. Comput. Ind. Eng. 136, 504–515 (2019)
Acknowledgement
This research was supported by the National Natural Science Foundation of China (62173169 and 72201115) and the Basic Research Key Project of Yunnan Province (202201AS070030).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Ethics declarations
We have no competing interests to declare that are relevant to the content of this paper.
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, J., Yu, NK., Hu, R., Zhang, ZQ. (2024). A Branch and Price Algorithm for the Two-Agent Heterogeneous Fleet Vehicle Routing Problem with Time Windows. In: Huang, DS., Zhang, X., Chen, W. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2024. Lecture Notes in Computer Science, vol 14862. Springer, Singapore. https://doi.org/10.1007/978-981-97-5578-3_35
Download citation
DOI: https://doi.org/10.1007/978-981-97-5578-3_35
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-5577-6
Online ISBN: 978-981-97-5578-3
eBook Packages: Computer ScienceComputer Science (R0)