Geodesic
Solving the problem of order fulfillment management of an industrial enterprise
Problemy fiziki, matematiki i tehniki, no. 1 (2024), pp. 86-92.

Voir la notice de l'article provenant de la source Math-Net.Ru

The production process of fulfilling orders with parameters that require readjustment of equipment has been studied. The problem of determining the optimal strategy for readjustment of production equipment is an optimization problem, which is formulated as a traveling salesman problem. When solving this problem, the nodes of the graph are orders, the arcs are change-overs with known cost when moving from one order to another. The optimization criterion is the minimum total cost of equipment changeovers. Based on the matrix of the cost of equipment changeovers during the execution of orders with known parameters, the research of the problem solution with the help of a genetic algorithm was carried out. The examples are given for estimating the total cost of changeovers for orders with several parameters with different levels. The implementation steps of the genetic algorithm for solving the problem are presented, and the results of the experiments are shown.
Keywords: industrial enterprise, orders with parameters, equipment changeover, optimization, traveling salesman problem, fully connected graph, genetic algorithm 
@article{PFMT_2024_1_a12,
     author = {O. M. Demidenko and A. I. Yakimov and E. M. Borchyk and E. A. Yakimau and D. A. Denisevich},
     title = {Solving the problem of order fulfillment management of an industrial enterprise},
     journal = {Problemy fiziki, matematiki i tehniki},
     pages = {86--92},
     publisher = {mathdoc},
     number = {1},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PFMT_2024_1_a12/}
}
TY  - JOUR
AU  - O. M. Demidenko
AU  - A. I. Yakimov
AU  - E. M. Borchyk
AU  - E. A. Yakimau
AU  - D. A. Denisevich
TI  - Solving the problem of order fulfillment management of an industrial enterprise
JO  - Problemy fiziki, matematiki i tehniki
PY  - 2024
SP  - 86
EP  - 92
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PFMT_2024_1_a12/
LA  - ru
ID  - PFMT_2024_1_a12
ER  - 
%0 Journal Article
%A O. M. Demidenko
%A A. I. Yakimov
%A E. M. Borchyk
%A E. A. Yakimau
%A D. A. Denisevich
%T Solving the problem of order fulfillment management of an industrial enterprise
%J Problemy fiziki, matematiki i tehniki
%D 2024
%P 86-92
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PFMT_2024_1_a12/
%G ru
%F PFMT_2024_1_a12
O. M. Demidenko; A. I. Yakimov; E. M. Borchyk; E. A. Yakimau; D. A. Denisevich. Solving the problem of order fulfillment management of an industrial enterprise. Problemy fiziki, matematiki i tehniki, no. 1 (2024), pp. 86-92. http://geodesic.mathdoc.fr/item/PFMT_2024_1_a12/

[1] M.V. Terekhov, V.C. Zaikin, A.V. Averchenkov, “Povyshenie effektivnosti proizvodstva na osnove razrabotki avtomatizirovannoi sistemy planirovaniya proizvodstva”, Avtomatizatsiya i modelirovanie v proektirovanii i upravlenii, 2021, no. 2 (12), 49–57 | DOI

[2] A.V. Soshnikov, “Ekspress-metod sokrascheniya poter vremeni na perenaladki oborudovaniya pri smene assortimenta produktsii”, Natsionalnaya assotsiatsiya uchenykh, 2020, no. 1 (57), 43–48 | DOI

[3] V. Saravanana, S. Nallusamyb, K. Balajic, “Lead Time Reduction through Execution of Lean Tool for Productivity Enhancement in Small Scale Industries”, International Journal of Engineering Research in Africa, 29 (2017), 165–174 | DOI

[4] É.D. Taillard, K. Helsgaun, “POPMUSIC for the Travelling Salesman Problem”, European Journal of Operational Research, 272:2 (2019), 420–429 | DOI | MR | Zbl

[5] U.J. Mele, L.M. Gambardella, R. Montemanni, New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem, A Preprint, 2021, 12 pp. https://www.researchgate.net/publication/354088626

[6] M.A. Alhanjouri, “Proposed Algorithms to solve Big Data traveling salesman problem”, International Journal of Innovative Science, Engineering Technology, 5:6 (2018), 14–20 https://www.researchgate.net/publication/326325068

[7] R. Mariescu-Istodor, P. Fränti, “Solving the LargeScale TSP Problem in 1 h: Santa Claus Challenge 2020”, Frontiers in Robotics and AI, 2021, no. 8, 1–20 | DOI

[8] M.B. Gawali, S.K. Shinde, “Task scheduling and resource allocation in cloud computing using a heuristic approach”, Journal of Cloud Computing: Advances, Systems and Applications, 2018, no. 4, 16 pp. | DOI