Assessing the impact of parameters for the last mile logistics system on creation of the added value of goods
DOI:
https://doi.org/10.15587/1729-4061.2018.142523Keywords:
last mile logistics, transportation route, transportation cost, added value, variabilityAbstract
stock load along the same transportation system. The criterion evaluates the level of gain in the added value of goods as a result of the delivery of goods within a retail network under condition of minimizing the cost of transporting one ton. We have designed an extreme plan for the fullfactor experiment with three levels of parameter variation. It was determined that demand for transportation within a retail chain in a big city is discrete in character. A statistical analysis of the volumes of a transportation order has allowed us to draw a conclusion on the possibility to describe a given magnitude using a binomial distribution law. An experiment was conducted using a service polygon of the retail chain’s customers in a large city. Based on 9 constructed alternative last mile logistics systems, we investigated the influence of transportation demand variability on forming the levels of vehicles’ load along routes. The statistical data received provided the basis for calculating the cost of transporting one ton of cargo and estimating the size of the excessive added value to goods. We have assessed the level of variability in the size of the total and the mean added value of goods. It was determined that the transportation process within a retail chain can generate a gain in the total added value across the entire chain amounting to 444.5 percent (12 routes within a transportation system) with the mean value for one multistop route of 37.03 percent. We present assessment of the effective area of the last mile logistics, which is guaranteed under condition for a slight fluctuation in the level of vehicles’ load. This corresponds to the value for a variation coefficient of the rolling stock load in the range from 0 to 10 percent. Along with this, it has been established that the most sensitive to fluctuations in the volume of order is the rolling stock of small and medium cargo capacity.
References
- Oliveira, F. L., Oliveira Junior, A. da R., Bessa Rebelo, L. M. (2017). Adapting transport modes to supply chains classified by the uncertainty supply chain model: A case study at Manaus Industrial Pole. International Journal of Production Management and Engineering, 5 (1), 39–43. doi: https://doi.org/10.4995/ijpme.2017.5775
- Rossolov, A., Kopytkov, D., Kush, Y., Zadorozhna, V. (2017). Research of effectiveness of unimodal and multimodal transportation involving land kinds of transport. Eastern-European Journal of Enterprise Technologies, 5 (3 (89)), 60–69. doi: https://doi.org/10.15587/1729-4061.2017.112356
- Jourquin, B., Limbourg, S. (2007). Une procédure d'affectation multi-flux et multimodale appliquée aux réseaux transeuropéens de fret. les Cahiers Scientifiques du Transport, 52, 9–25.
- Limbourg, S., Jourquin, B. (2009). Optimal rail-road container terminal locations on the European network. Transportation Research Part E: Logistics and Transportation Review, 45 (4), 551–563. doi: https://doi.org/10.1016/j.tre.2008.12.003
- Naumov, V. (2015). Development of a model for international cargo delivery process. Technology Audit and Production Reserves, 4 (3 (24)), 33–36. doi: https://doi.org/10.15587/2312-8372.2015.47954
- Nuzzolo, A., Coppola, P., Comi, A. (2013). Freight transport modeling: Review and future challenges. International Journal of Transport Economics, XL (2), 151–181.
- Nuzzolo, A., Crisalli, U., Comi, A. (2008). A demand model for international freight transport by road. European Transport Research Review, 1 (1), 23–33. doi: https://doi.org/10.1007/s12544-008-0003-0
- Oliveira, F. L. (2014). Uncertainty supply chain model and transport in its deployments. Independent Journal of Management & Production, 5 (2), 480–492. doi: https://doi.org/10.14807/ijmp.v5i2.167
- Crainic, T. G., Montreuil, B. (2016). Physical Internet Enabled Hyperconnected City Logistics. Transportation Research Procedia, 12, 383–398. doi: https://doi.org/10.1016/j.trpro.2016.02.074
- United Nations Report. World Urbanization Prospects: The 2014 Revision. Available at: https://esa.un.org/unpd/wup/publications/files/wup2014-highlights.pdf
- Kin, B., Ambra, T., Verlinde, S., Macharis, C. (2018). Tackling Fragmented Last Mile Deliveries to Nanostores by Utilizing Spare Transportation Capacity – A Simulation Study. Sustainability, 10 (3), 653. doi: https://doi.org/10.3390/su10030653
- Gevaers, R. (2013). Evaluation of innovations in B2C last mile. B2C Reverse & Waste Logistics; University of Antwerp: Antwerp, Belgium, 280.
- Arvidsson, N. (2013). The milk run revisited: A load factor paradox with economic and environmental implications for urban freight transport. Transportation Research Part A: Policy and Practice, 51, 56–62. doi: https://doi.org/10.1016/j.tra.2013.04.001
- Gonzalez-Feliu, J. (2008). Models and methods for the City Logistics: The Two-Echelon Capacitated Vehicle Routing Problem. Politecnico di Torino, 148.
- Ranieri, L., Digiesi, S., Silvestri, B., Roccotelli, M. (2018). A Review of Last Mile Logistics Innovations in an Externalities Cost Reduction Vision. Sustainability, 10 (3), 782. doi: https://doi.org/10.3390/su10030782
- Aized, T., Srai, J. S. (2013). Hierarchical modelling of Last Mile logistic distribution system. The International Journal of Advanced Manufacturing Technology, 70 (5-8), 1053–1061. doi: https://doi.org/10.1007/s00170-013-5349-3
- Bates, O., Wise, S., Davies, N., Friday, A., Allen, J., Cherrett, T. et. al. (2018). Transforming Last-mile Logistics. Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems – CHI ’18. doi: https://doi.org/10.1145/3173574.3174100
- Lim, S. F. W. T., Rabinovich, E., Rogers, D. S., Lasester, T. M. (2016). Last-mile Supply Network Distribution in Omnichannel Retailing: A Configuration-Based Typology. Foundations and Trends® in Technology, Information and Operations Management, 10 (1), 1–87. doi: https://doi.org/10.1561/0200000045
- Nefiodov, N. (2017). Modification of Сlark and Wright vehicle routing problem algorithm. Automobile transport, 40, 7–11.
- Cao, B. (2012). Solving Vehicle Routing Problems Using an Enhanced Clarke-Wright Algorithm: A Case Study. Computational Logistics, 190–205. doi: https://doi.org/10.1007/978-3-642-33587-7_14
- Srivastava, S. K., Jain, D. (2010). An Industrial application of modified Clarke & Wright algorithm. Udyog Pragati, 34 (1), 8–15.
- Doyuran, T., Çatay, B. (2008). Two enhanced savings functions for the Clark-Wright algorithm. Management in Logistics Networks and Nodes: Concepts, Technology and Applications, Series on Operations and Technology Management (8). Erich Schmidt Verlag, Berlin, 245–258.
- Cheikh, M., Ratli, M., Mkaouar, O., Jarboui, B. (2015). A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electronic Notes in Discrete Mathematics, 47, 277–284. doi: https://doi.org/10.1016/j.endm.2014.11.036
- Battarra, M., Golden, B., Vigo, D. (2008). Tuning a parametric Clarke–Wright heuristic via a genetic algorithm. Journal of the Operational Research Society, 59 (11), 1568–1572. doi: https://doi.org/10.1057/palgrave.jors.2602488
- Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34 (3), 336–344. doi: https://doi.org/10.1016/0377-2217(88)90154-3
- Dhake, R. J., Rajhans, N. R., Bhole, N. P. (2017). K-Means + Clarke & Wright algorithm for optimization of vehicle mounted drinking water purification units – A Case Study. Industrial Engineering Journal, 10 (1), 42–46.
- Comi, A., Rosati, L. (2013). CLASS: A City Logistics Analysis and Simulation Support System. Procedia – Social and Behavioral Sciences, 87, 321–337. doi: https://doi.org/10.1016/j.sbspro.2013.10.613
- Palacios-Argüello, L., Gonzalez-Feliu, J., Gondran, N., Badeig, F. (2018). Assessing the economic and environmental impacts of urban food systems for public school canteens: case study of Great Lyon region. European Transport Research Review, 10 (2). doi: https://doi.org/10.1186/s12544-018-0306-8
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 Alexander Rossolov, Nadezhda Popova, Denis Kopytkov, Halyna Rossolova, Helen Zaporozhtseva
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.