Abstract
In this paper, we propose an extension of the vehicle routing problem with cross-docking that takes into account resource constraints at the cross-dock. These constraints limit the number of docks that can be used simultaneously. To solve this new problem, we adapt a recently proposed matheuristic based on large neighborhood search. In particular, we focus on the feasibility tests for insertions and compare heuristics and constraint programming strategies. Finally, computational experiments on instances adapted from the vehicle routing problem with cross-docking are reported. They give insights on the impact of a limited cross-dock capacity on the routing cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agustina, D., Lee, C.K.M., Piplani, R.: A review: mathematical models for cross docking planning. Int. J. Eng. Bus. Manag. 2(2), 47–54 (2010)
Ahmadizar, F., Zeynivand, M., Arkat, J.: Two-level vehicle routing with cross-docking in a three-echelon supply chain: A genetic algorithm approach. Appl. Math. Model. 39(22), 7065–7081 (2015). https://doi.org/10.1016/j.apm.2015.03.005
Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problem. EURO J. Comput. Optim. 2, 223–246 (2014). https://doi.org/10.1016/j.cor.2014.06.008
Archetti, C., Speranza, M.G., Savelsbergh, M.W.P.: An optimization-based heuristic for the split delivery vehicle routing problem. Transp. Sci. 42(1), 22–31 (2008). https://doi.org/10.1287/trsc.1070.0204
Asbach, L., Dorndorf, U., Pesch, E.: Analysis, modeling and solution of the concrete delivery problem. Eur. J. Oper. Res. 193(3), 820–835 (2009). https://doi.org/10.1016/j.ejor.2007.11.011
Beck, J.C., Fox, M.S.: Scheduling alternative activities. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, pp. 680–687 (1999)
Boysen, N., Fliedner, M.: Cross dock scheduling: classification, literature review and research agenda. Omega 38(6), 413–422 (2010). https://doi.org/10.1016/j.omega.2009.10.008
Buijs, P., Vis, I.F., Carlo, H.J.: Synchronization in cross-docking networks: a research classification and framework. Eur. J. Oper. Res. 239(3), 593–608 (2014). https://doi.org/10.1016/j.ejor.2014.03.012
Cortés, C.E., Matamala, M., Contardo, C.: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200(3), 711–724 (2010). https://doi.org/10.1016/j.ejor.2009.01.022
Dondo, R., Cerdá, J.: A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors. Comput. Chem. Eng. 63, 184–205 (2014). https://doi.org/10.1016/j.compchemeng.2013.12.012
Drexl, M.: Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints. Transp. Sci. 46(3), 297–316 (2012). https://doi.org/10.1287/trsc.1110.0400
Ebben, M., van der Heijden, M., van Harten, A.: Dynamic transport scheduling under multiple resource constraints. Eur. J. Oper. Res. 167(2), 320–335 (2005). https://doi.org/10.1016/j.ejor.2004.03.020
El Hachemi, N., Gendreau, M., Rousseau, L.M.: A hybrid constraint programming approach to the log-truck scheduling problem. Ann. Oper. Res. 184(1), 163–178 (2010). https://doi.org/10.1007/s10479-010-0698-x
El Hachemi, N., Gendreau, M., Rousseau, L.M.: A heuristic to solve the synchronized log-truck scheduling problem. Comput. Oper. Res. 40(3), 666–673 (2013). https://doi.org/10.1016/j.cor.2011.02.002
Enderer, F., Contardo, C., Contreras, I.: Integrating dock-door assignment and vehicle routing with cross-docking. Comput. Oper. Res. 88, 30–43 (2017)
Froger, A., Mendoza, J.E., Jabali, O., Laporte, G.: A Matheuristic for the electric vehicle routing problem with capacitated charging stations. Research report, Centre interuniversitaire de recherche sur les reseaux d’entreprise, la logistique et le transport (CIRRELT) (2017)
Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.M.: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res. 254(1), 80–91 (2016)
Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116–126 (2017)
Grimault, A., Lehuédé, F., Bostel, N.: A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works. In: 2014 International Conference on Logistics Operations Management, pp. 57–61 (2014). https://doi.org/10.1109/GOL.2014.6887418, http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6887418
Grimault, A., Bostel, N., Lehuédé, F.: An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Comput. Oper. Res. 88, 1–14 (2017)
Gronhaug, R., Christiansen, M., Desaulniers, G., Desrosiers, J.: A branch-and-price method for a liquefied natural gas inventory routing problem. Transp. Sci. 44(3), 400–415 (2010). https://doi.org/10.1287/trsc.1100.0317
Guastaroba, G., Speranza, M.G., Vigo, D.: Intermediate facilities in freight transportation planning: a survey. Transp. Sci. 50(3), 763–789 (2016)
Hempsch, C., Irnich, S.: Vehicle routing problems with inter-tour resource constraints. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces, vol. 43, pp. 421–444. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-77778-8
IBM Corporation: IBM ILOG CPLEX Optimization Studio V12.6.1 documentation (2014)
Kroep, F., Buijs, P., Coelho, L.C., Roodbergen, K.J.: The two-period vehicle routing problem with crossdocking and transfers. Technical Report CIRRELT-2017-53 (2017). https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2017-53.pdf
Ladier, A.L., Alpan, G.: Cross-docking operations: current research versus industry practice. Omega 62, 145–162 (2016). https://doi.org/10.1016/j.omega.2015.09.006
Lee, Y.H., Jung, J.W., Lee, K.M.: Vehicle routing scheduling for cross-docking in the supply chain. Comput. Ind. Eng. 51(2), 247–256 (2006). https://doi.org/10.1016/j.cie.2006.02.006
Li, Y., Lim, A., Rodrigues, B.: Crossdocking—JIT scheduling with time windows. J. Oper. Res. Soc. 55, 1342–1351 (2004)
Maknoon, Y., Laporte, G.: Vehicle routing with cross-dock selection. Comput. Oper. Res. 77, 254–266 (2017). https://doi.org/10.1016/j.cor.2016.08.007
Masson, R., Lehuédé, F., Péton, O.: Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper. Res. Lett. 41(3), 211–215 (2013)
Mendoza, J., Rousseau, L.M., Villegas, J.G.: A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraint. J. Heuristics 22, 539–566 (2015)
Morais, V.W., Mateus, G.R., Noronha, T.F.: Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst. Appl. 41(16), 7495–7506 (2014). https://doi.org/10.1016/j.eswa.2014.06.010
Nassief, W., Contreras, I., Jaumard, B.: A comparison of formulations and relaxations for cross-dock door assignment problems. Comput. Oper. Res. 94, 76–88 (2018). https://doi.org/10.1016/j.cor.2018.01.022
Nikolopoulou, A.I., Repoussis, P.P., Tarantilis, C.D., Zachariadis, E.E.: Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking. Oper. Res. (2016). https://doi.org/10.1007/s12351-016-0278-1
Nikolopoulou, A.I., Repoussis, P.P., Tarantilis, C.D., Zachariadis, E.E.: Moving products between location pairs: cross-docking versus direct-shipping. Eur. J. Oper. Res. 256, 803–819 (2017). https://doi.org/10.1016/j.ejor.2016.06.053
Paraskevopoulos, D.C., Laporte, G., Repoussis, P.P., Tarantilis, C.D.: Resource constrained routing and scheduling: review and research prospects. Eur. J. Oper. Res. 263(3), 737–754 (2017)
Petersen, H.L., Ropke, S.: The pickup and delivery problem with cross-docking opportunity. In: Computational Logistics, pp. 101–113. Springer (2011)
Pillac, V., Guéret, C., Medaglia, A.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. 7(7), 1525–1535 (2013). https://doi.org/10.1007/s11590-012-0567-4
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007). https://doi.org/10.1016/j.cor.2005.09.012
Rochat, Y., Taillard, É.D.: Probability diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)
Santos, F.A., Mateus, G.R., da Cunha, A.S.: A novel column generation algorithm for the vehicle routing problem with cross-docking. In: Network Optimization—INOC 2011, LNCS, vol. 6701, pp. 412–425 (2011a). https://doi.org/10.1007/978-3-642-21527-8_47
Santos, F.A., Mateus, G.R., da Cunha, A.S.: A branch-and-price algorithm for a vehicle routing problem with cross-docking. Electron. Notes Discrete Math. 37, 249–254 (2011b). https://doi.org/10.1016/j.endm.2011.05.043
Santos, F.A., Mateus, G.R., da Cunha, A.S.: The pickup and delivery problem with cross-docking. Comput. Oper. Res. 40(4), 1085–1093 (2013). https://doi.org/10.1016/j.cor.2012.11.021
Schmid, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Stoecher, W.: A hybrid solution approach for ready-mixed concrete delivery. Transp. Sci. 43(1), 70–85 (2009). https://doi.org/10.1287/trsc.1080.0249
Schmid, V., Doerner, K.F., Hartl, R.F., Salazar-González, J.J.: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput. Oper. Res. 37(3), 559–574 (2010). https://doi.org/10.1016/j.cor.2008.07.010
Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Science 48(4), 500–520 (2014)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming—CP98, LNCS, vol. 1520, pp. 417–431 (1998). https://doi.org/10.1007/3-540-49481-2_30
Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013). https://doi.org/10.1016/j.cor.2013.01.013
Tarantilis, C.D.: Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim. Lett. 7(7), 1583–1596 (2012). https://doi.org/10.1007/s11590-012-0558-5
Tellez, O., Vercraene, S., Lehuédé, F., Péton, O., Monteiro, T.: The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity. Transp. Res. Part C Emerg. Technol. 91, 99–123 (2018)
Thorsteinsson, E.S.: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed) Principles and Practice of Constraint Programming—CP 2001, LNCS, vol. 2239, pp. 16–30 (2001). http://www.springerlink.com/index/10RCW2QGYECV41KD.pdf
Van Belle, J., Valckenaers, P., Cattrysse, D.: Cross-docking: state of the art. Omega 40(6), 827–846 (2012). https://doi.org/10.1016/j.omega.2012.01.005
Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)
Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A., Velasco, N.: A matheuristic for the truck and trailer routing problem. Eur. J. Oper. Res. 230(2), 231–244 (2013). https://doi.org/10.1016/j.ejor.2013.04.026
Wen, M., Larsen, J., Clausen, J., Cordeau, J.F., Laporte, G.: Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12), 1708–1718 (2008). https://doi.org/10.1057/jors.2008.108
Yu, V.F., Jewpanya, P., Redi, A.A.N.P.: Open vehicle routing problem with cross-docking. Comput. Ind. Eng. 94, 6–17 (2016). https://doi.org/10.1016/j.cie.2016.01.018
Acknowledgements
This work was partially supported by the Canadian Natural Science and Engineering Research Council (RGPIN-2015-04696) and by the Fonds de recherche du Québec - Nature et technologies through its Team research Program.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: Detailed results
Appendix: Detailed results
Tables 6 and 7 present the detailed results obtained for each instance. These results highlight the increased complexity induced by integrating dock resource constraints, as there exists for each instance, at maximum dock value, a solution with 0% gap (see Sect. 5.1). Nevertheless LNS+SPS finds solutions that are 1.6% more expensive in the shared case and 1.5% more expensive in the separated case, which remains satisfactory.
Rights and permissions
About this article
Cite this article
Grangier, P., Gendreau, M., Lehuédé, F. et al. The vehicle routing problem with cross-docking and resource constraints. J Heuristics 27, 31–61 (2021). https://doi.org/10.1007/s10732-019-09423-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-019-09423-y