3 research outputs found
Improvement of constructive heuristics for combinatorial optimisation problems in operations management.
ΠΠΏΠ΅ΡΠ°ΡΠΈΠΎΠ½ΠΈ ΠΌΠ΅Π½Π°ΡΠ΅Ρ ΠΊΠΎΡΠΈΡΡΠΈ ΡΠΊΡΠΏ ΠΏΠΎΡΡΡΠΏΠ°ΠΊΠ° ΡΠΈΡΠΈ ΡΠ΅ ΡΠΈΡ Π΄Π° ΡΠ΅ ΠΏΠΎΡΠ»ΠΎΠ²ΠΈ ΡΡΠ°Π΄Π΅ Π±ΡΠΆΠ΅, ΡΠ΅ΡΡΠΈΠ½ΠΈΡΠ΅ ΠΈ ΠΊΠ²Π°Π»ΠΈΡΠ΅ΡΠ½ΠΈΡΠ΅. ΠΠ°ΡΡΠ½ΠΈΡΠΈ ΠΈΠ· ΠΎΠ±Π»Π°ΡΡΠΈ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΎΠ½ΠΎΠ³ ΠΌΠ΅Π½Π°ΡΠΌΠ΅Π½ΡΠ° ΠΈΠΌΠ°ΡΡ Π·Π°Π΄Π°ΡΠ°ΠΊ Π΄Π° ΠΎΠ²ΠΈ ΠΏΠΎΡΡΡΠΏΡΠΈ Π±ΡΠ΄Ρ ΠΈΠ·Π²ΠΎΠ΄ΡΠΈΠ²ΠΈ ΠΈ ΠΏΡΠ°ΠΊΡΠΈΡΠ½ΠΈ. Π‘ΠΊΠΎΡΠΎ ΡΠ²Π΅ΠΊ, ΠΌΠ΅Π½Π°ΡΠ΅ΡΠΈ ΠΏΠΎΠΊΡΡΠ°Π²Π°ΡΡ Π΄Π° Π½Π΅ΡΡΠΎ ΠΎΠΏΡΠΈΠΌΠΈΠ·ΡΡΡ β ΠΈΠ»ΠΈ ΡΠ΅ ΡΠΎ ΠΌΠΈΠ½ΠΈΠΌΠΈΠ·Π°ΡΠΈΡΠ° ΡΡΠΎΡΠΊΠΎΠ²Π° ΠΈ ΠΏΠΎΡΡΠΎΡΡΠ΅ Π΅Π½Π΅ΡΠ³ΠΈΡΠ΅, ΠΈΠ»ΠΈ ΠΏΠ°ΠΊ, ΠΌΠ°ΠΊΡΠΈΠΌΠΈΠ·Π°ΡΠΈΡΠ° ΠΏΡΠΎΡΠΈΡΠ°, ΡΠ΅Π·ΡΠ»ΡΠ°ΡΠ°, ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈ ΠΈ Π΅ΡΠΈΠΊΠ°ΡΠ½ΠΎΡΡΠΈ. ΠΠ΅ΡΡΡΠΈΠΌ, Π½ΠΈΡΠ΅ ΡΠ²Π΅ΠΊ ΠΌΠΎΠ³ΡΡΠ΅ ΠΏΡΠΎΠ½Π°ΡΠΈ ΠΎΠΏΡΠΈΠΌΠ°Π»Π½Π° ΡΠ΅ΡΠ΅ΡΠ°. Π£ ΠΏΡΠ°ΠΊΡΠΈ, ΠΌΠ΅Π½Π°ΡΠ΅Ρ ΠΌΠΎΡΠ° Π΄Π° ΡΠ΅ Π·Π°Π΄ΠΎΠ²ΠΎΡΠΈ ΡΠ΅ΡΠ΅ΡΠΈΠΌΠ° ΠΊΠΎΡΠ° ΠΌΠΎΠΆΠ΄Π° Π½ΠΈΡΡ ΠΎΠΏΡΠΈΠΌΠ°Π»Π½Π°, Π°Π»ΠΈ ΡΡ Π΄ΠΎΠΏΡΡΡΠΈΠ²Π°, Π·Π°Π΄ΠΎΠ²ΠΎΡΠ°Π²Π°ΡΡΡΠ°, ΡΠΎΠ±ΡΡΡΠ½Π°, ΠΈ Π΄ΠΎΡΡΠΈΠΆΠ½Π° Ρ ΡΠ°Π·ΡΠΌΠ½ΠΎΠΌ Π²ΡΠ΅ΠΌΠ΅Π½Ρ. ΠΠ²Π°ΠΊΠ²Π° ΡΠ΅ΡΠ΅ΡΠ° ΡΠ΅ Π΄ΠΎΠ±ΠΈΡΠ°ΡΡ ΠΏΡΠΈΠΌΠ΅Π½Π°ΠΌΠ° Ρ
Π΅ΡΡΠΈΡΡΠΈΠΊΠ°, ΠΊΠΎΡΠ΅ ΠΌΠΎΠ³Ρ Π±ΠΈΡΠΈ ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠ²Π½Π΅, ΠΏΠΎΠ±ΠΎΡΡΠ°Π²Π°ΡΡΡΠ΅ ΠΈΠ»ΠΈ Ρ
ΠΈΠ±ΡΠΈΠ΄Π½Π΅. ΠΠ±Π»Π°ΡΡ ΠΈΡΡΡΠ°ΠΆΠΈΠ²Π°ΡΠ° Ρ Π΄ΠΎΠΊΡΠΎΡΡΠΊΠΎΡ Π΄ΠΈΡΠ΅ΡΡΠ°ΡΠΈΡΠΈ ΡΡ ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠ²Π½Π΅ Ρ
Π΅ΡΡΠΈΡΡΠΈΠΊΠ΅ Π·Π° ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ΅ ΠΊΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΎΡΠ½Π΅ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΡΠ΅ Ρ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΎΠ½ΠΎΠΌ ΠΌΠ΅Π½Π°ΡΠΌΠ΅Π½ΡΡ ΠΊΠΎΡΠΈ ΠΏΡΠΈΠΏΠ°Π΄Π°ΡΡ ΠΊΠ»Π°ΡΠΈ ΡΠ»ΠΎΠΆΠ΅Π½ΠΎΡΡΠΈ ΠΠ. ΠΡΠ΅Π΄ΡΡΠ°Π²ΡΠ΅Π½ ΡΠ΅ Π½ΠΎΠ²ΠΈ Π³Π΅Π½Π΅ΡΠ°Π»ΠΈΠ·ΠΎΠ²Π°Π½ΠΈ ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠ²Π½ΠΈ Π°Π»Π³ΠΎΡΠΈΡΠ°ΠΌ ΠΊΠΎΡΠΈ ΠΎΠΌΠΎΠ³ΡΡΠ°Π²Π° Π΄Π° ΡΠ΅ ΡΠ°Π·Π½ΠΎΠ²ΡΡΠ½Π΅ Ρ
Π΅ΡΡΠΈΡΡΠΈΠΊΠ΅ ΡΠΎΡΠΌΠΈΡΠ°ΡΡ ΠΈΠ·Π±ΠΎΡΠΎΠΌ ΡΠ΅Π³ΠΎΠ²ΠΈΡ
Π°ΡΠ³ΡΠΌΠ΅Π½Π°ΡΠ°. Π’Π°ΠΊΠΎΡΠ΅ ΡΠ΅ ΡΠ²Π΅Π΄Π΅Π½ΠΎ ΠΎΠΏΡΡΠ΅ ΠΎΠΊΡΡΠΆΠ΅ΡΠ΅ Π·Π° Π³Π΅Π½Π΅ΡΠΈΡΠ°ΡΠ΅ ΠΏΠ΅ΡΠΌΡΡΠ°ΡΠΈΡΠ°, ΠΊΠΎΡΠ΅ ΡΠΎΡΠΌΠΈΡΠ° Π²Π΅Π·Ρ ΠΈΠ·ΠΌΠ΅ΡΡ Π΅Π½ΡΠΌΠ΅ΡΠ°ΡΠΈΡΠ΅ ΠΏΠ΅ΡΠΌΡΡΠ°ΡΠΈΡΠ° ΠΈ ΠΊΠΎΡΠ°ΠΊΠ° Ρ ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠ²Π½ΠΈΠΌ Ρ
Π΅ΡΡΠΈΡΡΠΈΠΊΠ°ΠΌΠ° ΡΠΌΠ΅ΡΠ°ΡΠ°. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠ΅ ΡΠΊΡΠΏ Π°ΡΠ³ΡΠΌΠ΅Π½Π°ΡΠ° Π³Π΅Π½Π΅ΡΠ°Π»ΠΈΠ·ΠΎΠ²Π°Π½ΠΎΠ³ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΊΠΎΡΠΈ ΠΎΠΌΠΎΠ³ΡΡΡΡΠ΅ ΠΏΠ°ΡΠ°Π»Π΅Π»Π½ΠΎ ΠΏΡΠ°ΡΠ΅ΡΠ΅ Π²ΠΈΡΠ΅ ΠΏΠ°ΡΡΠΈΡΠ°Π»Π½ΠΈΡ
ΡΠ΅ΡΠ΅ΡΠ° Π·Π° Π²ΡΠ΅ΠΌΠ΅ ΠΈΠ·Π²ΡΡΠ°Π²Π°ΡΠ° Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°. ΠΠΎΠ³ΡΡΠ½ΠΎΡΡΠΈ ΠΈ ΠΏΡΠ΅Π΄Π½ΠΎΡΡΠΈ Π³Π΅Π½Π΅ΡΠ°Π»ΠΈΠ·ΠΎΠ²Π°Π½ΠΎΠ³ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΡΡ ΠΏΡΠ΅Π΄ΡΡΠ°Π²ΡΠ΅Π½Π΅ ΠΊΡΠΎΠ· ΡΠ΅Π³ΠΎΠ²Ρ ΠΏΡΠΈΠΌΠ΅Π½Ρ Π½Π° ΠΏΡΠΎΠ±Π»Π΅ΠΌ ΡΠΎΡΠΌΠΈΡΠ°ΡΠ° ΡΠ΅Π»ΠΈΡΠ° Ρ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄Π½ΠΈΠΌ ΡΠΈΡΡΠ΅ΠΌΠΈΠΌΠ°, ΠΏΡΠΎΠ±Π»Π΅ΠΌ ΡΠ°ΡΠΏΠΎΡΠ΅Π΄Π° ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄Π½ΠΈΡ
ΡΠ΅Π»ΠΈΡΠ° ΠΈ ΠΏΡΠΎΠ±Π»Π΅ΠΌ ΡΠ΅Π΄ΠΎΡΠ»Π΅Π΄Π° ΠΏΠΎΡΠ»ΠΎΠ²Π° Ρ Π»ΠΈΠ½ΠΈΡΠΈ. ΠΠΎΠ²ΠΈ ΠΏΡΠΈΡΡΡΠΏ Π΄Π°ΡΠ΅ ΡΠ΅ΡΠ΅ΡΠ° ΠΊΠΎΡΠ° Π½Π° ΠΈΡΠΏΠΈΡΠΈΠ²Π°Π½ΠΈΠΌ ΠΏΡΠΈΠΌΠ΅ΡΠΈΠΌΠ° Π½Π°Π΄ΠΌΠ°ΡΡΡΡ Π½Π°ΡΠ±ΠΎΡΠ΅ ΠΏΠΎΠ·Π½Π°ΡΠ΅ ΡΠ΅Π·ΡΠ»ΡΠ°ΡΠ΅ ΠΈΠ· Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΠ΅.Operations manager deals with a collection of methods for getting things done more quickly, more cheaply or to a higher standard of quality. It is the job of the management scientist to make sure that these methods are practical and relevant. Almost always managers try to optimize something - whether to minimize the cost and energy consumption, or to maximize the profit, output, performance and efficiency. Subsequently, it is not always possible to find the optimal solutions. In practice, managers have to settle for suboptimal solutions or even feasible ones that are satisfactory, robust, and practically achievable in a reasonable time scale. These kind of solutions are obtained with heuristics, which can be constructive, improvement heuristics or hybrid. The field of research in the doctoral thesis are constructive heuristics for NP-hard combinatorial optimization problems in operations management. A new generalized constructive algorithm is presented which makes it possible to select a wide variety of heuristics just by the selection of its arguments values. A general framework for generating permutations of integers is presented. This framework forms a link between the numbering of permutations and steps in the insertion-based heuristics. A number of arguments controlling the operation of the generalized algorithm tracking multiple partial solutions, are identified. Features and benefits of the generalized algorithm are presented through the implemetations to the Cell Formation Problem, the Quadratic Assignment Problem and the Permutation Flowshop Problem. The new approach produces solutions that outperform, on the tested instances, the best known results from literature