Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 29 (2019) no. 4, pp. 599-611

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

The paper is devoted to the problem of optimization of accompanying manufacturing in flexible or reconfigurable manufacturing systems. Using a set of obligatory products as an input, the initial problem is reduced to two interrelated subproblems: 1) for each product from the set of obligatory products, form a group of additional (accompanying) products that can be manufactured without changing the state of production, and 2) determine the order of manufacturing changeovers between the groups of additional products, as well as the “points of entry and exit” for each group. The subproblems are considered sequentially: the first subproblem is reduced to the maximum weight clique problem, the second — to the cluster traveling salesman problem. Large-scale computational experiments were conducted to reveal the benefits of applying effective modern methods for solving both subproblems in comparison with the greedy solution (which models the rational actions of a human operator solving large accompanying manufacturing problems in short time).
Keywords: optimization of accompanying manufacturing, flexible and reconfigurable manufacturing, maximum weight clique, cluster travelling salesman problem.
@article{VUU_2019_29_4_a9,
     author = {A. N. Belousov and E. E. Ivanko},
     title = {Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {599--611},
     publisher = {mathdoc},
     volume = {29},
     number = {4},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2019_29_4_a9/}
}
TY  - JOUR
AU  - A. N. Belousov
AU  - E. E. Ivanko
TI  - Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2019
SP  - 599
EP  - 611
VL  - 29
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VUU_2019_29_4_a9/
LA  - ru
ID  - VUU_2019_29_4_a9
ER  - 
%0 Journal Article
%A A. N. Belousov
%A E. E. Ivanko
%T Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2019
%P 599-611
%V 29
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VUU_2019_29_4_a9/
%G ru
%F VUU_2019_29_4_a9
A. N. Belousov; E. E. Ivanko. Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 29 (2019) no. 4, pp. 599-611. http://geodesic.mathdoc.fr/item/VUU_2019_29_4_a9/