Cross-docking cargo delivery routing for guaranteed minimum period

TT.
2022;
: 38-54
https://doi.org/10.23939/tt2022.01.038
Received: February 15, 2022
Accepted: April 05, 2022
1
Lviv National University of Nature Management
2
National Transport University
3
Lviv Polytechnic National University

The article is devoted to the problem of effective use of cross-docking as a technology of cargo delivery with increased time requirements, which allows to resolve the contradictions of guaranteed delivery time ensuring and the efficiency of the existing fleet of trucks. The process of delivery organization is considered as the ordering on the transport network of many discrete freight flows in the form of their phases. If qualitative and / or quantitative changes do not occur from phase to phase with the flow, then the tact of such flow is constant. However, cross-docking flows change the size of the band of moving goods. Cargo can be moved as intended by any group size, which, however, is limited by the maximum and minimum values. A two-stage algorithm for solving the problem has been developed. The transport network is represented as a graph. The content of the route search problem is optimization, as it consists of multiple selections from the initial graph of arcs in the presence of restrictions on input and output flows. One needs to replace every each edge of the graph with an arc of the forward or reverse direction, or remove this edge. The criterion for the optimal solution of the problem, which is applied, is the minimum guaranteed duration of delivery of goods throughout the set of specified freight flows. At the first stage of the algorithm, the search for the shortest paths in the graph is performed, along which every given cargo flow can pass. The first stage of optimization is a linear problem of integer programming, the dimension of which is not too large. The initial data of the second stage is freight flows matrix, which is obtained as a result of optimization in the first stage. The content of the second stage of the algorithm is the solution of the equation of the balance of discrete goods flows. The balance equation means that all flows entering each peak including the sources of cargo flows of this peak have an average intensity equal to the intensity of the outgoing cargo flows from each source peak, including runoff. Due to the studied dependencies between the individual phases of the delivery process on the example of a cargo carrier on the transport network of Ukraine, the formulated restrictions and boundary conditions, the possibility of guaranteed accurate solution of a complex problem is obtained. At the same time, the shortest routes were found, reloading points were identified as well as time parameters of operation and the degree of loading of cars. According to the results of the research, a threefold increase in the productivity of the fleet of road trains with a reduction in the guaranteed delivery time by 30%.

1. Kiani Mavi, R., Goh, M., Kiani Mavi, N., Jie, F., Brown, K., Biermann, S., & A Khanfar, A. (2020). Cross-docking: a systematic literature review. Sustainability, 12(11), 4789 (1-19). doi: 10.3390/su12114789 (in English)
https://doi.org/10.3390/su12114789
2. Santos, F. A., Mateus, G. R., & Da Cunha, A. S. (2013). The pickup and delivery problem with cross-docking. Computers & Operations Research, 40(4), 1085-1093. doi: 10.1016/j.cor.2012.11.021 (in English)
https://doi.org/10.1016/j.cor.2012.11.021
3. Theophilus, O., Dulebenets, M. A., Pasha, J., Lau, Y. Y., Fathollahi-Fard, A. M., & Mazaheri, A. (2021). Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations. Computers & Industrial Engineering, 156, 107240. doi: 10.1016/j.cie.2021.107240 (in English)
https://doi.org/10.1016/j.cie.2021.107240
4. Buijs, P., Vis, I. F., & Carlo, H. J. (2014). Synchronization in cross-docking networks: A research classification and framework. European Journal of Operational Research, 239(3), 593-608. doi: 10.1016/j.ejor.2014. 03.012 (in English)
https://doi.org/10.1016/j.ejor.2014.03.012
5. Contardo, C., Hemmelmayr, V., & Crainic, T. G. (2012). Lower and upper bounds for the two-echelon capacitated location-routing problem. Computers & operations research, 39(12), 3185-3199. doi: 10.1016/j.cor.2012. 04.003 (in English)
https://doi.org/10.1016/j.cor.2012.04.003
6. Wen, M., Larsen, J., Clausen, J., Cordeau, J. F., & Laporte, G. (2009). Vehicle routing with cross-docking. Journal of the Operational Research Society, 60(12), 1708-1718. doi: 10.1057/jors.2008.108 (in English)
https://doi.org/10.1057/jors.2008.108
7. Nurprihatin, F., Rembulan, G. D., Christianto, K., & Hartono, H. (2021, March). Decision support system for truck scheduling in logistic network through cross-docking strategy. Journal of Physics: Conference Series. 1811(1), 012009. doi: 10.1088/1742-6596/1811/1/012009 (in English)
https://doi.org/10.1088/1742-6596/1811/1/012009
8. Huang, H., Savkin, A. V., & Huang, C. (2020). Scheduling of a parcel delivery system consisting of an aerial drone interacting with public transportation vehicles. Sensors, 20(7), 2045. doi: 10.3390/s20072045 (in English)
https://doi.org/10.3390/s20072045
9. Han, Y. Q., Li, J. Q., Liu, Z., Liu, C., & Tian, J. (2020). Metaheuristic algorithm for solving the multi-objective vehicle routing problem with time window and drones. International Journal of Advanced Robotic Systems, 17(2), 1729881420920031. doi: 10.1177%2F1729881420920031 (in English)
https://doi.org/10.1177/1729881420920031
10. Buakum, D., & Wisittipanich, W. (2020). Stochastic internal task scheduling in cross docking using chance-constrained programming. International Journal of Management Science and Engineering Management, 15(4), 258-264. doi: 10.1080/17509653.2020.1764404 (in English)
https://doi.org/10.1080/17509653.2020.1764404
11. An Integrated Routing-scheduling Model for a Hybrid UAV-based Delivery System. Retrieved from: https://www.cirrelt.ca/documentstravail/cirrelt-2020-17.pdf (in English)
12. Calabrò, G., Torrisi, V., Inturri, G., & Ignaccolo, M. (2020). Improving inbound logistic planning for large-scale real-world routing problems: a novel ant-colony simulation-based optimization. European Transport Research Review, 12(1), 1-11. doi: 10.1186/s12544-020-00409-7 (in English)
https://doi.org/10.1186/s12544-020-00409-7
13. Oliskevych, M., Kovalyshyn, S., Magats, M., Shevchuk, V., & Sukach, O. (2020). The optimization of trucks fleet schedule in view of their interaction and restrictions of the European agreement of work of crews. Transport Problems, 15(2). 157-170. doi: 10.21307/tp-2020-028 (in English)
https://doi.org/10.21307/tp-2020-028
14. Küçükoğlu, İ., & Öztürk, N. (2017). Two-stage optimisation method for material flow and allocation management in cross-docking networks. International Journal of Production Research, 55(2), 410-429. doi: 10.1080/00207543.2016.1184346 (in English)
https://doi.org/10.1080/00207543.2016.1184346
15. Chargui, T., Bekrar, A., Reghioui, M., & Trentesaux, D. (2019). Multi-objective sustainable truck scheduling in a rail-road physical internet cross-docking hub considering energy consumption. Sustainability, 11(11), 3127 (1-23). doi: 10.3390/su11113127 (in English)
https://doi.org/10.3390/su11113127
16. Gunawan, A., Widjaja, A. T., Gan, B., Yu, V. F., & Jodiawan, P. (2020). Vehicle routing problem for multi-product cross-docking. Proceedings of the International Conference on Industrial Engineering and Operations Management (pp. 66-77). Dubai, UAE (in English)
17. Hochbaum, D. S., & Levin, A. (2006). Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optimization, 3(4), 327-340. doi: 10.1016/j.disopt.2006.02.002 (in English)
https://doi.org/10.1016/j.disopt.2006.02.002
18. Song, X., Jones, D., Asgari, N., & Pigden, T. (2020). Multi-objective vehicle routing and loading with time window constraints: a real-life application. Annals of Operations Research, 291(1), 799-825. doi: 10.1007/s10479-019-03205-2 (in English)
https://doi.org/10.1007/s10479-019-03205-2
19. Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P. S., & Chi, X. (2020). Learning to dispatch for job shop scheduling via deep reinforcement learning. Advances in Neural Information Processing Systems, 33, 1621-1632. doi: 10.48550/arXiv.2010.12367 (in English)