PRACA ORYGINALNA
Draft model of delivery routes at a city logistics scale when applying the Clarke-Wright method
| 1 | Department of Transport and Logistics, Institute of Technology and Business in České Budějovice, Faculty of Technology, Okružní 517/10, 370 01, České Budějovice, Czech Republic, Czech Republic |
AUTOR DO KORESPONDENCJI
Ondrej Stopka
Department of Transport and Logistics, Institute of Technology and Business in České Budějovice, Faculty of Technology, Okružní 517/10, 370 01, České Budějovice, Czech Republic, Okružní 10, 37001, České Budějovice, Czech Republic
Department of Transport and Logistics, Institute of Technology and Business in České Budějovice, Faculty of Technology, Okružní 517/10, 370 01, České Budějovice, Czech Republic, Okružní 10, 37001, České Budějovice, Czech Republic
Data nadesłania: 19-02-2020
Data ostatniej rewizji: 10-03-2020
Data akceptacji: 15-03-2020
Data publikacji: 30-03-2020
The Archives of Automotive Engineering – Archiwum Motoryzacji 2020;87(1):67–80
SŁOWA KLUCZOWE
city logisticsVehicle Routing ProblemOperations Researchurban distribution centerClarke-Wright method
DZIEDZINY
STRESZCZENIE
The manuscript deals with the subject of determining the optimal delivery routes in terms of supplying urban distribution centers when minimizing the distance traveled in a particular region for the purpose of addressing city logistics issues using the specific Operations Research method, namely the Clarke-Wright method. Thus, the main paper objective is to examine the issue: what are the optimal transport journeys from the specific object among individual customers in a certain region in order to execute minimum transport performance? First two sections of the manuscript specify the relevant concepts regarding the issue of distribution tasks and vehicle routing problem, and presents data and methods in relation to this research study. The most significant part of the article models the individual routes to determine the optimal interconnections of urban distribution center and their supply from one logistics service center in a regional logistics network at a city logistics scale when applying the Clarke-Wright method. The last sections of the elaborated research study evaluate the major findings and discuss the possible future initiatives in the topic addressed.
REFERENCJE (26)
1.
Al-Dulaymi S.M.S.: Determine the optimal solution using Vogel's approximation method. ARPN Journal of Engineering and Applied Sciences. 2018, 13(12), 3973–3982.
2.
Anbuudayasankar S.P., Ganesh K., Mohapatra S.: Models for practical routing problems in logistics: design and practices, 2014, Cham: Springer, ISBN 978-3-319-05034-8.
3.
Bin Othman M.S., Shurbevski A., Karuno Y., Nagamochi H.: Routing of carrier-vehicle systems with dedicated last-stretch delivery vehicle and fixed carrier route. Journal of Information Processing. 2017, 25, 655–666, DOI: 10.2197/ipsjjip.25.655.
4.
Binova H., Jurkovic, M.: Methodology of inland ports design as intermodal terminals in the Czech Republic. In Carpathian Logistics Congress (CLC 2015) – Conference proceedings. November 04-06, 2015, 126–131, Jesenik, Czech Republic, ISBN 978-80-87294-64-2.
5.
Caban J., Kravchenko, K.: Chosen Aspects of Packages in the Distribution of Selected Dairy Products. LOGI – Scientific Journal on Transport and Logistics. 2018, 9(2), 1–9, DOI: 10.2478/logi-2018-0013.
6.
Chovancová M., Klapita V.: Modeling the Supply Process Using the Application of Selected Methods of Operational Analysis. Open Engineering. 2017, 7(1), 50–54, DOI: 10.1515/eng-2017-0009.
7.
Clarke G., Wright J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations research. 1964, 12(4), 568–581, DOI: 10.1287/opre.12.4.568.
8.
Dablanc L.: City distribution, a key element of the urban economy: guidelines for practitioners (Book Chapter), City distribution and urban freight transport: multiple perspectives. Northampton: Edward Elgar Publishing, UK, 2011, 13–36, DOI: 10.4337/9780857932754.00007.
9.
Deineko V.G., Hoffmann M., Okamoto Y., Woeginger G.J.: The Traveling Salesman Problem with Few Inner Points. Operations Research Letters. 2006, 34(1), 106–110, DOI: 10.1016/j.orl.2005.01.002.
10.
Deschrochers M., Desrosiers J., Solomon M.: A new optimization algorithm for the vehicle routing problem with time windows. Operations research. 1992, 40(2), 342–354, DOI: 10.1287/opre.40.2.342.
11.
EUR-Lex. Regulation (EC) No 561/2006 of the European Parliament and of the Council of 15 March 2006 on the harmonisation of certain social legislation relating to road transport. 2006. Available at: https://eur-lex.europa.eu/lega.... (Accessed 19th January 2020).
12.
Gamboa D., Rego C., Glover F.: Implementation Analysis of Efficient Heuristic Algorithms for the Traveling Salesman Problem. Computers and Operations Research. 2006, 33(4), 1154–1172, DOI: 10.1016/j.cor.2005.06.014.
13.
Gottschlich C., Schuhmacher D.: The Shortlist method for fast computation of the earth mover's distance and finding optimal solutions to transportation problems. PLoS ONE. 2014, 9(10), e110214, DOI: 10.1371/journal.pone.0110214.
14.
Hlatká M., Bartuška L., Ližbetin J.: Application of the Vogel approximation method to reduce transport-logistics processes. 18th International Scientific Conference, LOGI 2017, MATEC Web of Conferences. 2017, 134, 00019, DOI: 10.1051/matecconf/201713400019.
15.
Jozefowiez N., Semet F., Talbi E.G.: Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem. Lecture Notes in Computer Science. 2002, 2439, 271–280, DOI: 10.1007/3-540-45712-7_26.
16.
Kampf R.: Optimization of delivery routes using the Little´s algorithm. Nase More. 2018, 65(4), 237–239, DOI: 10.17818/NM/2018/4SI.13.
17.
Kampf R., Hlatka M., Savin G.: Proposal for optimizing specific distribution routes by means of the specific method of operational analysis. Communications - Scientific Letters of the University of Zilina. 2017, 19(2), 133-138.
18.
Karoonsoontawong A., Kobkiattawin O., Xie C.: Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time. Networks and Spatial Economics. 2017, 19(2), 331–379, DOI: 10.1007/s11067-017-9369-7.
19.
Lin S.: Computer Solutions of the Traveling Salesman Problem. The Bell System Technical Journal. 1965, 44(10), 2245–2269, DOI: 10.1002/j.1538-7305.1965.tb04146.x.
20.
Šarkan B., Kuranc A., Kučera, Ľ.: Calculations of exhaust emissions produced by vehicle with petrol engine in urban area. In 4th International Conference of Computational Methods in Engineering Science, IOP Conference Series: Materials Science and Engineering. 2019, 710(1), 012023, DOI: 10.1088/1757-899X/710/1/012023.
21.
Sarker D., Khan A., Islam M.: Exploring the Connections between Land Use and Transportation: A Case Study of Shaheb Bazar to Rail Gate Road, Rajshahi City. LOGI – Scientific Journal on Transport and Logistics. 2019, 10(1), 30–40, DOI: 10.2478/logi-2019-0004.
22.
Vojtek M., Skrucany T., Kendra M., Ponicky J.: Methodology for calculation of minimum transfer time in the transport hub., In 10th International Scientific Conference Horizons of Railway Transport, HORT 2018, MATEC Web of Conferences. 2018, 235, 00015, DOI: 10.1051/matecconf/201823500015.
23.
Verbas Ö., Mahmassani S.H., Hyland F.M.: Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale application. Transportation Research Part B: Methodological. 2016, 93(Part A), 1–16, DOI: 10.1016/j.trb.2016.07.002.
24.
Vidal T., Crainic T.G., Gendreau M., Prins C.: Time-window relaxations in vehicle routing heuristics. Journal of Heuristics. 2015, 21(3), 329–358, DOI: 10.1007/s10732-014-9273-y.
25.
Volek J., Linda B.: Teorie grafů: aplikace v dopravě a veřejné správě. 1st ed., 2012, Pardubice: University of Pardubice, Czech Republic, ISBN 978-80-7395-225-9 (in Czech).
26.
Yang J., Shi X., Marchese M., Liang Y.: An ant colony optimization method for generalized TSP problem. Progress in Natural Science. 2008, 18(11), 1417–1422, DOI: 10.1016/j.pnsc.2008.03.028.
ARTYKUŁ POWIĄZANY
Korzystamy z plików cookie (oraz innych podobnych technologii) i przetwarzamy unikalne identyfikatory oraz dane przeglądarki – w celu umożliwienia funkcjonowania naszej strony internetowej. Więcej informacji o tym jak przetwarzamy Twoje dane osobowe znajdziesz w