Improving the efficiency of transporting lightweight bulky cargo by motor transport

• Autorzy: Gogiashvili Phridon , Kirtadze Shalva , Lekveishvili Gocha , Kbilashvili David , Chogovadze Jumber , Sirbiladze Besik

Identyfikatory

DOI

10.20858/tp.2023.18.4.12

• Języki publikacji: EN

Abstrakty

EN

The shipping process should be carried out to minimize standing time, as it affects the total vehicle mileage. The efficiency of distributing cargo on routes in modern conditions could be achieved by transporting cargo taken from several manufacturers that have mutually comparable mileages. This paper analyzes common methods of cargo distribution by routes. It was established that the approximate methods that provide near- optimal solutions to problems have become widespread. Therefore, there is no alternative to using accurate methods in the process of studying the routing problem. One such method is the branch-and-bond method. It should also be noted that it does not involve going to the same place multiple times, which takes place in a real transport scheme. Thus, the modification of accurate methods is a promising direction in solving the routing problem in the process of transporting the goods in small consignments. Consequently, this provides an opportunity to effectively use motor transport in the logistic system.

Słowa kluczowe

EN

lightweight cargo; shipment; body; route; costs

PL

lekki ładunek; wysyłka; ciało; trasa; koszty

• Wydawca: Wydawnictwo Politechniki Śląskiej
• Czasopismo: Transport Problems
• Rocznik: 2023
• Tom: T. 18, z. 4
• Strony: 147--159
• Opis fizyczny: Bibliogr. 19 poz.

Twórcy

autor

Gogiashvili Phridon

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0000-0002-1905-3618

autor

Kirtadze Shalva

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0009-0004-1340-9427

autor

Lekveishvili Gocha

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0000-0002-7801-4547

autor

Kbilashvili David

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0000-0002-0516-8510

autor

Chogovadze Jumber

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0000-0001-8460-0481

autor

Sirbiladze Besik

• Akaki Tsereteli State University; 59 Tamar Mepe, Kutaisi, 4600, Georgia

• https://orcid.org/0000-0002-3521-1540

Bibliografia

• 1. Baldacci, R. & Bartolini, E. & Mingozzi, A. An exact algorithm for the pickup and delivery problem with time windows. Operations Research. 2011. Vol. 59. No. 2. P. 414-426.
• 2. Bell, E. & Bryman, A. & Harley, B. Business Research Methods. Oxford University Press. 2018. 394 p.
• 3. Cattaruzza, D. & Absi, N. & Feillet, D. & Guyon, O. & Libeaut, X. The multi trip vehicle routing problem with time windows and release dates. In: Proceedings of the 10th Metaheuristics International Conference. 2013. P. 1-10.
• 4. Cordeau, J.-F. & Desaulniers, G. & Desrosiers, J. & Solomon, M. & Soumis, F. VRP with time windows. In: Toth P. & Vigo D. (Eds.) Discrete Mathematics and Applications. The Vehicle Routing Problem. 2002. P. 157-193.
• 5. Cortés, C.E. & Jayakrishnan, R. Design and operational concepts of high-coverage point-to-point transit system. Transportation Research Record. 2002. Vol. 1783. P. 178-187.
• 6. Cortés, C.E. & Matamala, M. & Contardo, C. The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research. 2010. 200. Vol. 3. P. 711-724.
• 7. Gonzalez-Calderon, C. & Holguín-Veras, J. & Amaya-Leal, J. & Sánchez-Díaz, I. & Sarmiento- Ordosgoitia, I. Generalized norman and van es‘ empty trips model. Transportation Research Part A: Policy and Practice. 2019. Vol. 145. P. 260-268.
• 8. Crainic, T.G. Service network design in freight transportation. European Journal of Operational Research. 2000. Vol. 122. No. 2. P. 272-288.
• 9. 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. Les cahiers du CIRRELT. 2014.
• 10. Hemmelmayr, V.C. & Cordeau, J-F. & Crainic, T.G. An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research. 2012. Vol. 39(12). P. 3215-3228.
• 11. Moen, O. The five-step model - procurement to increase transport efficiency for an urban distribution of goods. Transp. Res. Procedia. 2016. Vol. 12. P. 861-873.
• 12. Jepsen, M. & Spoorendonk, S. & Ropke, S. A Branch-and-Cut Algorithm for the Symmetric Two- Echelon Capacitated Vehicle Routing. Problem Transportation Science. 2012. Vol. 47. No. 1. P. 23-37.
• 13. Kot, S. Cost structure in relation to the size of road transport enterprises. Promet traffic transp. 2015. Vol. 27(5). P. 27-38.
• 14. Kerivin, H. & Lacroix, M. & Mahjoub, A.R. & Quilliot, A. The splittable pickup and delivery problem with reloads. European Journal of Industrial Engineering. 2008. Vol. 2. No. 2. P. 112-133.
• 15. Masson, R. & Lehuédé, F. & Péton, O. Simple temporal problems in route scheduling for the dial- a-ride problem with transfers. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 2012. Vol. 7298 of LNCS. Springer. P. 275-291.
• 16. Pisinger, D. & Ropke, S. A general heuristic for vehicle routing problems. Computers & Operations Research. 2007. Vol. 34. No. 8. P. 2403-2435.
• 17. Qu, Y. & Bard, J.F. A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Computers & Operations Research. 2012. Vol. No. 39. P. 2439-2456.
• 18. Ropke, S. & Cordeau, J-F. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transportation Science. 2009. Vol. 43. No. 3. P. 267-286.
• 19. Savelsbergh, M. The vehicle routing problem with time windows. Minimizing route duration. ORSA Journal on Computing. 1992. Vol. 4. No. 2. P. 146-154.

Uwagi

PL

Opracowanie rekordu ze środków MNiSW, umowa nr SONP/SP/546092/2022 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2024).