Heuristic algorithms applied to the problems of servicing actors in supply chains

• Autorzy: Izdebski M. , Jacyna-Gołda I. , Markowska K. , Murawski J.

Identyfikatory

DOI

10.5604/01.3001.0010.6159

• Języki publikacji: EN

Abstrakty

EN

The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.

Słowa kluczowe

EN

supply chain; genetic algorithm; ant algorithm

PL

łańcuchy dostaw; algorytm genetyczny; algorytm mrówkowy

• Wydawca: Warsaw University of Technology, Faculty of Transport
• Czasopismo: Archives of Transport
• Rocznik: 2017
• Tom: Vol. 44, iss. 4
• Strony: 25--34
• Opis fizyczny: Bibliogr. 30 poz., rys., tab., wykr.

Twórcy

autor

Izdebski M.

• Warsaw University of Technology, Faculty of Transport, Warsaw, Poland

autor

Jacyna-Gołda I.

• Warsaw University of Technology, Faculty of Production Engineering, Warsaw Poland

autor

Markowska K.

• Silesian University of Technology, Faculty of Organization and Management, Zabrze, Poland

autor

Murawski J.

• Warsaw University of Technology, Faculty of Transport, Warsaw, Poland

Bibliografia

• [1] ABDOUN, O., ABOUCHABAKA, J., 2011. A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem. International Journal of Computer Applications, Foundation of Computer Science, 31 (11), pp. 49-57,
• [2] AKINC, U., KHUMAWALA, B.M., 1977. An efficient branch and bound algorithm for the capacitaded warehouse location problem. Management Science, 23 (6), pp. 585–594.
• [3] AMBROZIAK, T., JACYNA, M., WASIAK, M., 2006. The Logistic Services in a Hierarchical Distribution System, in: Goulias, K.: Transport Science and Technology, ELSEVIER, pp. 383-393.
• [4] BRANDEAU, M. L, CHIU, S.S., 1989. An Overview of Representative Problems in Location Research. Management Science, 35 (6), pp. 645–674.
• [5] BRÄYSY, O., GENDREAU, M., 2005. Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. Transportation Science, 39 (1), pp. 119-139.
• [6] BURKARD, R., DELL’AMICO, M., MARTTELO, S., 2009. Assignment problems. Philadelphia: Society for Industrial and Applied Mathematics..
• [7] DORIGO, M., STUTZLE, T., 2004. Ant Colony Optimization. USA: Bradford Books.
• [8] FECHNER, I., (ed.), 2007. Zarządzanie łańcuchem dostaw. Poznań: Wyższa Szkoła Logistyki.
• [9] IZDEBSKI, M., 2014. The use of heuristic algorithms to optimize the transport issues on the example of municipal services companies. Archives of Transport, 29 (1), pp. 27-36.
• [10] IZDEBSKI, M., JACYNA, M., 2012. Model przydziału zasobów do zadań w przedsiębiorstwie transportowym. Logistyka 4/2012, pp. 247-254.
• [11] IZDEBSKI, M., JACYNA, M., 2013. Wybrane aspekty zastosowania algorytmu genetycznego do rozwiązywania problemu przydziały zasobów do zadań w przedsiębiorstwie transportowy. Prace Naukowe Politechniki Warszawskiej. Transport, 97, pp. 183-194.
• [12] JACYNA, M., IZDEBSKI, M., 2014. The ant algorithm for solving the assignment of vehicles to tasks in the municipal services companies. Journal of Kones, 21 (2), pp.113-119.
• [13] JACYNA-GOŁDA, I., 2015a. Evaluation of operational reliability of the supply chain in terms of the control and management of logistics processes, in NOWAKOWSKI, T. (ed.) Safety and Reliability: Methodology and Applications, CRC Press Taylor & Francis Group, pp. 549-558.
• [14] JACYNA-GOŁDA, I., 2015b. Chosen problems of effective supply chain management of companies. Journal of KONES, 22 (2), pp. 89-96.
• [15] JACYNA-GOŁDA, I., GOŁĘBIOWSKI, P., IZDEBSKI, M., KŁODAWSKI, M., JACHIMOWSKI, R., SZCZEPAŃSKI, E., 2017. The evaluation of the sustainable transport system development with the scenario analyses procedure. Journal of Vibroengineering, 19 (7), pp. 5627-5638.
• [16] JACYNA-GOŁDA, I., IZDEBSKI M., PODVIEZKO A., 2016. Assessment of the efficiency of assignment of vehicles to tasks in supply chains: A case-study of a municipul company. Transport, 31 (4), pp. 1-9.
• [17] JACYNA-GOŁDA, I., IZDEBSKI, M., 2017. The Warehouse Location Problem in the Context of Vehicle Routing Problem in the Production Companies, in Macioszek, E., Sierpiński, G. (ed.), Recent Advances in Traffic Engineering for Transport Networks and Systems, Springer, pp 50-62.
• [18] JACYNA-GOŁDA, I., IZDEBSKI, M., SZCZEPAŃSKI, E., 2016. Assessment of the Method Effectiveness for Choosing the Location of Warehouses in the Supply Network, Challenge of Transport Telematics, Springer Vol. 640, pp. 84-97.
• [19] JACYNA-GOŁDA, I., LEWCZUK, K., 2017. The method of estimating dependability of supply chain elements on the base of technical and organizational redundancy of process. Eksploatacja i Niezawodnosc – Maintenance and Reliability, 19 (3), pp. 382–392.
• [20] JACYNA-GOŁDA, I., SANTAREK, K., WASIAK, M., 2013. Location of warehouse facilities in the logistics network, in: FELIKS, J. (ed.) CLC 2013: Carpathian Logistics Congress ‐ Congress Proceedings.
• [21] KHUMAWALA, B. M., 1973. An efficient heuristic procedure for the uncapacitated warehouse location problem, Naval Research Logistics Quarterly, 20 (1), p. 109–121.
• [22] MICHALEWICZ, Z., 1996. Algorytmy genetyczne + struktury danych = programy ewolucyjne, Warsaw: Wydawnictwo Naukowo – Techniczne.
• [23] NOWAKOWSKI, T., 2004. Reliability model of combined transportation system, in SPITZER, C. et al. Probabilistic Safety Assessment and Management. London: Springer.
• [24] SHARMA, R. R. K., BERRY, V., 2007. Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort. European Journal of Operational Research, 177 (2), pp. 803–812.
• [25] SZCZEPAŃSKI, E., JACYNA-GOŁDA, I., MURAWSKI, J., 2014. Genetic algorithms based approach for transhipment HUB location in urban areas. Archives of Transport, 31 (3), pp. 73-78.
• [26] SZCZEPAŃSKI, E., JACHIMOWSKI, R., 2014. Simulation analysis of vehicle routing problem solution, in: FELIKS, J. (ed.) CLC 2013: Carpathian Logistics Congress ‐ Congress Proceedings, Ostrava: TANGER Ltd., pp. 446-452
• [27] TWARÓG, J., 2005. Mierniki i wskaźniki logistyczne. Poznan: Biblioteka Logistyka.
• [28] WASIAK, M., JACYNA, M., LEWCZUK, K., SZCZEPAŃSKI, E., 2017. The method for evaluation of efficiency of the concpept of centrally managed distribution in cities. Transport, 32 (4).
• [29] WASIAK, M., JACYNA-GOŁDA, I., IZDEBSKI, M., 2016. Multi-criteria warehouses location problem in the logistics network. ICIL 2016 Conference Proceedings, pp. 352-364.
• [30] ZIEJA, M, SMOLOŃSKI, H., GOŁDA, P., 2015. Information systems as a tool for supporting the management of aircraft flight safety. Archives of Transport, 36 (4), pp. 67-76.

Uwagi

PL

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).