Effective Solutions to the Transport Distribution of Material by the Mayer Method

Čejka, Jiří; Stopka, Ondrej

doi:10.12913/22998624/100364

Artykuł - szczegóły

Tytuł artykułu

Effective Solutions to the Transport Distribution of Material by the Mayer Method

Autorzy

Čejka Jiří , Stopka Ondrej

Treść / Zawartość

Pełne teksty:

Pobierz

Identyfikatory

DOI

10.12913/22998624/100364

Warianty tytułu

Języki publikacji

Abstrakty

This paper deals with streamlining the collection (pick-up) and distribution (delivery) activities within the technology of wood industry. Through the optimization process implemented using the issue of the distribution task of linear programming, specifically the Mayer method, the particular solution in order to minimize the total costs in practice of utilized distribution routes is proposed. The first part of the paper presents the characteristics of the vehicle routing problem and describes methods of solving this issue. Subsequently, the main part of the paper outlines a particular case study in the context of the Mayer method application within the field of transport-technology solution of the material distribution.

Słowa kluczowe

transport operational research linear programming vehicle routing problem Mayer method

transport badania operacyjne programowanie liniowe problem z routingiem pojazdu metoda Mayera

Wydawca

Lublin University of Technology
Polish Society of Ecological Engineering (PTIE), Branch of PTIE in Lublin

Czasopismo

Advances in Science and Technology. Research Journal

Rocznik

2018

Tom

Vol. 12, no 4

Strony

177--183

Opis fizyczny

Bibliogr. 31 poz., fig., tab.

Twórcy

autor

Čejka Jiří

Institute of Technology and Business in České Budějovice, Faculty of Technology, Department of Informatics and Natural Sciences, Okružní 517/10, 370 01, České Budějovice, Czech Republic

autor

Stopka Ondrej

stopka@mail.vstecb.cz

Institute of Technology and Business in České Budějovice, Faculty of Technology, Department of Transport and Logistics, Okružní 517/10, 370 01, České Budějovice, Czech Republic

Bibliografia

1. Balcik B., Iravani S. and Smilowitz K. Multi-vehicle sequential resource allocation for a nonprofit distribution system. IIE Transactions (Institute of Industrial Engineers), 46(12), 2014, 1279–1297. DOI:10.1080/0740817X.2013.876240.
2. Caceres-Cruz J., Arias P., Guimarans D., Riera D. and Juan A.A. Rich vehicle routing problem: Survey. ACM Computing Surveys, 47(2), 2014, Article number 32. DOI:10.1145/2666003.
3. Cempírek V., Pivoňka K. and Široký J. Základy technologie a řízení dopravy. Ed. 3, Pardubice: University of Pardubice, Czech Republic, 2002, 120 p. ISBN 80–7194–471–8.
4. Černá A. and Černý J. Teorie řízení a rozhodování v dopravních systémech. Ed. 1. Pardubice: Jan Perner Transport Institute, Czech Republic, 2004. ISBN 80–86530–15–9.
5. Chocholáč J., Boháčová L., Kučera T. and Sommerauerová D. Innovation of the Process of Inventorying of the Selected Transport Units: Case Study in the Automotive Industry. LOGI – Scientific Journal on Transport and Logistics, 8(1), 2017, 48–55. DOI:10.1515/logi-2017–0006.
6. Chovancová M. and Klapita V. Draft Model for Optimization of the Intermodal Transport Chains by Applying the Network Analysis. Proc. of 20th International Scientific Conference on Transport Means, Kaunas University of Technology, Lithuania 2016, 112–116. ISSN 1822–296X.
7. Chovancová M. and Klapita V. Modeling the Supply Process Using the Application of Selected Methods of Operational Analysis. Open Engineering, 7(1), 2017, 50–54. DOI: 10.1515/eng-2017–0009.
8. Drdla P. Osobní doprava regionálního a nadregionálního významu. Pardubice: University of Pardubice, Czech Republic, 2014, 412 p. ISBN 978–80–7395–787–2.
9. Feldman E., Lehrer F.A. and Ray T.L. Warehouse Location under Continuous Economies of Scale. Management Science, 12(9), 1966, 670–684. DOI:10.1287/mnsc.12.9.670.
10. Hampl M. Geografická organizace společnosti v České republice: transformační procesy a jejich obecný context. Prague: DemoArt, Czech Republic, 2005, 138 p. ISBN 80–86746–02-X.
11. Hu W., Wang H., Qiu Z., Yan L., Nie C. and Du B. An urban traffic simulation model for traffic congestion predicting and avoiding. Neural Computing and Applications, 2016, 1–13. DOI:10.1007/ s00521–016–2785–7.
12. Jablonský J., Maňas M. and Fiala P. Vícekriteriální rozhodování. Ed. 1, Prague: University of Economics in Prague, Czech Republic, 1994, 316 p. ISBN 80–7079–748–7.
13. Jablonský J. Operační výzkum: kvantitativní modely pro ekonomické rozhodování. Ed. 3, Prague: Professional Publishing, Czech Republic, 2007, 323 p. ISBN 978–80–86946–44–3.
14. Janáček J. Metody snižování nákladů při distribuci zboží. Doprava 35(4), 1993, 172–175.
15. Khouahjia M.R., Jourdan L. and Talbi E.G. Solving the Problem of Dynamic Routes by Particle Swarm. Multimodal Transport Systems, 2013, 173–198. DOI:10.1002/9781118577202.ch4.
16. Kubát J. Lagerstandortoptimierung mit Hilfe des Verfahrens Branch und Bound. Ekonomicko matematický obzor, 11, 1975, 65–83.
17. Martinec I. Stochastický algoritmus pro okružní dopravní úlohy s více stanovišti. Ekonomicko matematický obzor, 26(2), 1990, 176–190.
18. Lim S.F.W.T., Zhang A.N., Goh M., Ong Y.S. and Tan P.S. Three-dimensional vehicle routing problem for urban last mile logistics: Problem formulation and computational analysis. Proc. of the UKSim-AMSS 18th International Conference on Computer Modelling and Simulation, Cambridge, UK 2016, 252–257. DOI:10.1109/UKSim.2016.27.
19. Liu C.Y. and Yu J. Multiple depots vehicle routing based on the ant colony with the genetic algorithm. Journal of Industrial Engineering and Management, 6(4), 2013, 1013–1026. DOI: 10.3926/jiem.747.
20. Pang K.W. and Liu J. An integrated model for ship routing with transshipment and berth allocation. IIE Transactions (Institute of Industrial Engineers), 46(12), 2014, 1357–1370. DOI:10.1080/0740817X.2014.889334.
21. Rahimi M., Baboli A. and Rekik Y. Inventory routing problem for perishable products by considering social issue. Proc. of the 10th IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2015 – In conjunction with ICT4ALL, Hammamet, Tunisia 2015, 116–121. DOI:10.1109/SOLI.2015.7367604.
22. Široký J. and Slivoně M. The optimization of pick-up and delivery of small consignments. Perner’s Contacts, 5(1), 2010, 255–269. ISSN 1801–674X.
23. Song Q., Gao X. and Santos E.T. A food chain algorithm for capacitated vehicle routing problem with recycling in reverse logistics. International Journal of Bifurcation and Chaos, 25(14), 2015, Article number 1540031. DOI:10.1142/ S0218127415400313.
24. Sopha B.M., Siagian A. and Asih A.M.S. Simulating Dynamic Vehicle Routing Problem using Agent-Based Modeling and Simulation. Proc. of the IEEE International Conference on Industrial Engineering and Engineering Management, Bali, Indonesia 2016, 1335–1339. DOI:10.1109/IEEM.2016.7798095.
25. Sundar K. and Rathinam S. Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems. Journal of Intelligent and Robotic Systems: Theory and Applications, 2016, 1–14. DOI:10.1007/s10846–016–0458–5.
26. Tokgöz E., Alwazzi S. and Trafalis T.B. A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces. Computational Management Science, 2014, 19 p. DOI:10.1007/s10287–014–0226–6.
27. Unčovský L., et al. Operačná analýza v riadení podnikov. Alfa, Bratislava, Slovak Republic, 1985.
28. 28. Vidal T., Crainic T.G., Gendreau M. and Prins C. Time-window relaxations in vehicle routing heuristics. Journal of Heuristics, 21(3), 2015, 329– 358. DOI:10.1007/s10732–014–9273-y.
29. 29. Wisniewski M. Kvantitativní metody v rozhodování. Prague: Viktoria Publishing, Czech Republic, 1996. ISBN 8071690899.
30. 30. Xia C., Sheng Y., Jiang Z.Z., Tan C., Huang M. and He Y. A novel discrete differential evolution algorithm for the vehicle routing problem in B2C e-commerce. International Journal of Bifurcation and Chaos, 25(14), 2015, Article number 1540033. DOI:10.1142/S0218127415400337.
31. 31. Yang H. Study on application of improved chaos ant colony algorithm in vehicle routing problem with time windows. Proc. of the 3rd International Conference on Innovative Computing Technology, London, UK 2013, 379–382. DOI:10.1109/ INTECH.2013.6653645.

Typ dokumentu

Bibliografia

Identyfikator YADDA

bwmeta1.element.baztech-3733103a-53a6-4202-82f0-7092418912e5