Industrial Problem Solution
Minimizing the ment path of the fuel insert
2020-06-121. Company introduction
A state-run company set up independent of Korea Electric Power Corp., which produces 31.9 percent of the nation's electricity
Major projects include nuclear power generation, hydroelectric power generation, radioactive waste management, new and renewable energy development such as wind power, nuclear power plant construction, and other overseas nuclear power construction projects.
2. Problem Background and Summary
Minimize the change path when changing the position of the insert during planned preventive maintenance of the nuclear power plant.
3. Solving Process
Linear Programing(TSP) Application Using Linear Planning Method.
It is considered that 33 fuels currently mounted on the insert and 33 fuels mounted on the insert are present on a plane. In other words, use Linear Programming in a loop that passes through all 66 points once (group 1: 33 nuclear fuel currently installed in the insert, group 2: 33 fuel inserted in the insert).
- Path connecting points in group 1 should always be associated with points in group 2. Similarly, Path connecting points in Group 2 should always be associated with points in Group 1. (From the fuel on which the inserts are mounted, the inserts to the fuel on which the inserts are not mounted, install them, and then return to the fuel on which the inserts are mounted.)
- Find a loop that minimizes the sum of all pathways (this minimized loop minimizes the pathways of the fuel inserts). It provided the Korea Hydro & Nuclear Power Co. with a way to find a loop that meets the above conditions using a Solver from Linear Programming.
1. Company introduction
A state-run company set up independent of Korea Electric Power Corp., which produces 31.9 percent of the nation's electricity
Major projects include nuclear power generation, hydroelectric power generation, radioactive waste management, new and renewable energy development such as wind power, nuclear power plant construction, and other overseas nuclear power construction projects.
2. Problem Background and Summary
Minimize the change path when changing the position of the insert during planned preventive maintenance of the nuclear power plant.
3. Solving Process
Linear Programing(TSP) Application Using Linear Planning Method.
It is considered that 33 fuels currently mounted on the insert and 33 fuels mounted on the insert are present on a plane. In other words, use Linear Programming in a loop that passes through all 66 points once (group 1: 33 nuclear fuel currently installed in the insert, group 2: 33 fuel inserted in the insert).
- Path connecting points in group 1 should always be associated with points in group 2. Similarly, Path connecting points in Group 2 should always be associated with points in Group 1. (From the fuel on which the inserts are mounted, the inserts to the fuel on which the inserts are not mounted, install them, and then return to the fuel on which the inserts are mounted.)
- Find a loop that minimizes the sum of all pathways (this minimized loop minimizes the pathways of the fuel inserts). It provided the Korea Hydro & Nuclear Power Co. with a way to find a loop that meets the above conditions using a Solver from Linear Programming.