6
How to cite this paper
APA: Bouyahyiouy, K & Bellabdaoui, A. (2021). A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows. Decision Science Letters, 10(4), 471-486.
Chicago/Turabian: Bouyahyiouy, K & Bellabdaoui, A. 2021. "A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows." Decision Science Letters 10, no. 4 (2021): 471-486.
AMA: Bouyahyiouy, K & Bellabdaoui, A. A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows. Decision Science Letters. 2021;10(4):471-486.
References
Aras, N., Aksen, D., & Tuǧrul Tekin, M. (2011). Selective multi-depot vehicle routing problem with pricing. Transportation Research Part C: Emerging Technologies, 19(5), 866-884.
Arunapuram, S., Mathur, K., & Solow, D. (2003). Vehicle Routing and Scheduling with Full Truckloads. Transportation Science, 37(2), 170-182.
Ávila, T., Corberán, Á., Plana, I., & Sanchis, J. M. (2017). Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization, 5(3), 339-365.
Ball, M. O., Golden, B. L., Assad, A. A., & Bodin, L. D. (1983). Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences, 14(1), 103-120.
Braekers, K., Caris, A., & Janssens, G. K. (2013). Integrated planning of loaded and empty container movements. OR Spectrum, 35(2), 457-478.
Braekers, K., Caris, A., & Janssens, G. K. (2014). Bi-objective optimization of drayage operations in the service area of intermodal terminals. Transportation Research Part E: Logistics and Transportation Review, 65(1), 50-69.
Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies,19(5), 723-740.
Bolaños, R. I., Escobar, J. W., & Echeverri, M. G. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461–478.
Caris, A., & Janssens, G. K. (2009). A local search heuristic for the pre-and end-haulage of intermodal container terminals. Computers and Operations Research, 36(10), 2763-2772.
Currie, R. H., & Salhi, S. (2003). Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of the Operational Research Society, 54(4), 390-400.
Currie, R. H., & Salhi, S. (2004). A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of Mathematical Modelling and Algorithms, 3(3), 225-243.
Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27-36.
Desrosiers, J., Laporte, G., Sauve, M., Soumis, F., & Taillefer, S. (1988). Vehicle routing with full loads. Computers and Operations Research, 15(3), 219-226.
Dimitriou, L. (2021). Optimal competitive pricing in European port container terminals: A game-theoretical framework. Transportation Research Interdisciplinary Perspectives, 9, 1–12.
EL Bouyahyiouy, K., & Bellabdaoui, A. (2016). A new crossover to solve the full truckload vehicle routing problem using genetic algorithm. 2016 3rd International Conference on Logistics Operations Management (GOL), 1–6.
EL Bouyahyiouy, K., & Bellabdaoui, A. (2017). An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profit. 2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017,7962888, 142-147.
Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11(3), 305-315.
Grimault, A., Bostel, N., & Lehuédé, F. (2017). An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Computers and Operations Research, 88, 1-14.
Gronalt, M., Hartl, R. F., & Reimann, M. (2003). New savings based algorithms for time constrained pickup and delivery of full truckloads. European Journal of Operational Research, 151(3), 520-535.
Gronalt, M., & Hirsch, P. (2007). Log-truck scheduling with a tabu search strategy.Operations Research/ Computer Science Interfaces Series,39, 65-88.
Imai, A., Nishimura, E., & Current, J. (2007). A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research, 176(1), 87-105.
Jula, H., Dessouky, M., Ioannou, P., & Chassiakos, A. (2005). Container movement by trucks in metropolitan networks: Modeling and optimization. Transportation Research Part E: Logistics and Transportation Review, 41(3), 235-259.
Lahyani, R., Gouguenheim, A. -L., & Coelho, L. C. (2019). A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. International Journal of Production Research, 57(22), 6963-6976.
Lahyani, R., Khemakhem, M., & Semet, F. (2017). A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO Journal on Computational Optimization, 5(3), 393-422.
Liu, R., Jiang, Z., Fung, R. Y. K., Chen, F., & Liu, X. (2010a). Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Computers and Operations Research, 37(5), 950-959.
Liu, R., Jiang, Z., Liu, X., & Chen, F. (2010b). Task selection and routing problems in collaborative truckload transportation. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1071-1085.
Lysgaard, J., Letchford, A. N., & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2), 423-445.
Marín Moreno, C. A, Escobar Falcón, L. M, Bolaños, R. I, Subramanian, A., Escobar Zuluaga, A. H, & Echeverri, M. G. (2019). A hybrid algorithm for the multi-depot vehicle scheduling problem arising in public transportation. International Journal of Industrial Engineering Computations, 10(3), 361–374.
Nossack, J., & Pesch, E. (2013). A truck scheduling problem arising in intermodal container transportation. European Journal of Operational Research, 230(3), 666-680.
Rincon-Garcia, N., Waterson, B. J, & Cherrett, T. J. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141–160.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254-265.
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., & Subramanian, A. (2017). New benchmark instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research, 257(3), 845-858.
Venkateshan, P., & Mathur, K. (2011). An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Computers and Operations Research, 38(12), 1647-1655.
Wang, X., & Regan, A. C. (2002). Local truckload pickup and delivery with hard time window constraints. Transportation Research Part B: Methodological, 36(2), 97-112.
Xue, N., Bai, R., Qu, R., & Aickelin, U. (2021). A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem. European Journal of Operational Research, 292(2), 500-514.
Yu, B., Yang, Z. Z., &Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications, 38(1), 435-441.
Zhang, R., Yun, W. Y., & Moon, I. (2009). A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transportation Research Part E: Logistics and Transportation Review, 45(6), 904-914.
Zhang, R., Yun, W. Y., & Kopfer, H. (2010). Heuristic-based truck scheduling for inland container transportation. OR Spectrum, 32(3), 787-808.
Arunapuram, S., Mathur, K., & Solow, D. (2003). Vehicle Routing and Scheduling with Full Truckloads. Transportation Science, 37(2), 170-182.
Ávila, T., Corberán, Á., Plana, I., & Sanchis, J. M. (2017). Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization, 5(3), 339-365.
Ball, M. O., Golden, B. L., Assad, A. A., & Bodin, L. D. (1983). Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences, 14(1), 103-120.
Braekers, K., Caris, A., & Janssens, G. K. (2013). Integrated planning of loaded and empty container movements. OR Spectrum, 35(2), 457-478.
Braekers, K., Caris, A., & Janssens, G. K. (2014). Bi-objective optimization of drayage operations in the service area of intermodal terminals. Transportation Research Part E: Logistics and Transportation Review, 65(1), 50-69.
Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies,19(5), 723-740.
Bolaños, R. I., Escobar, J. W., & Echeverri, M. G. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461–478.
Caris, A., & Janssens, G. K. (2009). A local search heuristic for the pre-and end-haulage of intermodal container terminals. Computers and Operations Research, 36(10), 2763-2772.
Currie, R. H., & Salhi, S. (2003). Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of the Operational Research Society, 54(4), 390-400.
Currie, R. H., & Salhi, S. (2004). A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of Mathematical Modelling and Algorithms, 3(3), 225-243.
Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27-36.
Desrosiers, J., Laporte, G., Sauve, M., Soumis, F., & Taillefer, S. (1988). Vehicle routing with full loads. Computers and Operations Research, 15(3), 219-226.
Dimitriou, L. (2021). Optimal competitive pricing in European port container terminals: A game-theoretical framework. Transportation Research Interdisciplinary Perspectives, 9, 1–12.
EL Bouyahyiouy, K., & Bellabdaoui, A. (2016). A new crossover to solve the full truckload vehicle routing problem using genetic algorithm. 2016 3rd International Conference on Logistics Operations Management (GOL), 1–6.
EL Bouyahyiouy, K., & Bellabdaoui, A. (2017). An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profit. 2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017,7962888, 142-147.
Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11(3), 305-315.
Grimault, A., Bostel, N., & Lehuédé, F. (2017). An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Computers and Operations Research, 88, 1-14.
Gronalt, M., Hartl, R. F., & Reimann, M. (2003). New savings based algorithms for time constrained pickup and delivery of full truckloads. European Journal of Operational Research, 151(3), 520-535.
Gronalt, M., & Hirsch, P. (2007). Log-truck scheduling with a tabu search strategy.Operations Research/ Computer Science Interfaces Series,39, 65-88.
Imai, A., Nishimura, E., & Current, J. (2007). A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research, 176(1), 87-105.
Jula, H., Dessouky, M., Ioannou, P., & Chassiakos, A. (2005). Container movement by trucks in metropolitan networks: Modeling and optimization. Transportation Research Part E: Logistics and Transportation Review, 41(3), 235-259.
Lahyani, R., Gouguenheim, A. -L., & Coelho, L. C. (2019). A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. International Journal of Production Research, 57(22), 6963-6976.
Lahyani, R., Khemakhem, M., & Semet, F. (2017). A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO Journal on Computational Optimization, 5(3), 393-422.
Liu, R., Jiang, Z., Fung, R. Y. K., Chen, F., & Liu, X. (2010a). Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Computers and Operations Research, 37(5), 950-959.
Liu, R., Jiang, Z., Liu, X., & Chen, F. (2010b). Task selection and routing problems in collaborative truckload transportation. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1071-1085.
Lysgaard, J., Letchford, A. N., & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2), 423-445.
Marín Moreno, C. A, Escobar Falcón, L. M, Bolaños, R. I, Subramanian, A., Escobar Zuluaga, A. H, & Echeverri, M. G. (2019). A hybrid algorithm for the multi-depot vehicle scheduling problem arising in public transportation. International Journal of Industrial Engineering Computations, 10(3), 361–374.
Nossack, J., & Pesch, E. (2013). A truck scheduling problem arising in intermodal container transportation. European Journal of Operational Research, 230(3), 666-680.
Rincon-Garcia, N., Waterson, B. J, & Cherrett, T. J. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141–160.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254-265.
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., & Subramanian, A. (2017). New benchmark instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research, 257(3), 845-858.
Venkateshan, P., & Mathur, K. (2011). An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Computers and Operations Research, 38(12), 1647-1655.
Wang, X., & Regan, A. C. (2002). Local truckload pickup and delivery with hard time window constraints. Transportation Research Part B: Methodological, 36(2), 97-112.
Xue, N., Bai, R., Qu, R., & Aickelin, U. (2021). A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem. European Journal of Operational Research, 292(2), 500-514.
Yu, B., Yang, Z. Z., &Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications, 38(1), 435-441.
Zhang, R., Yun, W. Y., & Moon, I. (2009). A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transportation Research Part E: Logistics and Transportation Review, 45(6), 904-914.
Zhang, R., Yun, W. Y., & Kopfer, H. (2010). Heuristic-based truck scheduling for inland container transportation. OR Spectrum, 32(3), 787-808.