• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.31-41
• /
• 2003

This paper deals with a cell formation problem for a set of m-machines and n-processing parts. Generally, a cell formation problem is known as NP-completeness. Hence the cell formation problem with multiple objectives is more difficult than single objective problem. The paper considers multiple objectives; minimize number of intercell movements, minimize intracell workload variation and minimize intercell workload variation. We propose a multiple objective genetic algorithms(MOGA) resolving the mentioned three objectives. The MOGA procedure adopted Pareto optimal solution for selection method for next generation and the concept of Euclidean distance from the ideal and negative ideal solution for fitness test of a individual. As we consider several weights, decision maker will be reflected his consideration by adjusting high weights for important objective. A numerical example is given for a comparative analysis with the results of other research.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.116-122
• /
• 2004

This paper presents a process plan selection model with multiple objectives. The process plans for all parts should be selected under multiple objective environment as follows: (1) minimizing the sum of machine processing and material handling time of all the parts considering realistic shop factors such as production volume, processing time, machine capacity, and capacity of transfer device. (2) balancing the load between machines. A multiple objective mathematical model is proposed and an evolutionary algorithm with the adaptive recombination strategy is developed to solve the model. To illustrate the efficiency of proposed approach, numerical examples are presented. The proposed approach is found to be effective in offering a set of satisfactory Pareto solutions within a satisfactory CPU time in a multiple objective environment.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.31-39
• /
• 1982

This paper presents an efficient algorithm both in computation speed and storage requirement by exploring the special structure of problems involving multiple objective goals. The algorithm developed here is limited to the problems with multiple, compensatory objectives, however it can be extended to‘traditional’preemptive priority goat programming problems. Computational results are included.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.1-9
• /
• 2014

In multi-objective scheduling problems, the objectives are usually in conflict. To obtain a satisfactory compromise and resolve the issue of NP-hardness, most existing works have suggested employing meta-heuristic methods, such as genetic algorithms. In this research, we propose a novel data-driven approach for generating a single solution that compromises multiple rules pursuing different objectives. The proposed method uses a data mining technique, namely, random forests, in order to extract the logics of several historic schedules and aggregate those. Since it involves learning predictive models, future schedules with the same previous objectives can be easily and quickly obtained by applying new production data into the models. The proposed approach is illustrated with a simulation study, where it appears to successfully produce a new solution showing balanced scheduling performances.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.531-540
• /
• 2007

When multiple objectives exist, there are three approaches exist. These are maximin design, compound design, and constrained design. Still, each of three design criteria has its own strength and weakness. In this paper Hybrid approach is suggested when multiple design objectives exist, which is a combination of maximin and constrained design. Sometimes experimenter has several objectives, but he/she has only one or two primary objectives, others less important. A new approach should be useful under this condition. The genetic algorithm is used for few examples. It has been proven to be a very useful technique for this complex situation. Conclusion follows.

• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.157-175
• /
• 1998

This paper develops multiple objective manpower planning model in order to design and adjust manpower structure and flow when advance rate for officer's native is considered. The state transition in manpower structure is analyzed using Markov chains. Multiple objectives in the model are security of advance rate, satisfaction of rank's number of personnel, and stability of the number of recruit personnel for officer's native. Trade - off of these objectives is made to evaluate manpower structure and flow. Solutions of this model are obtained by LINGO package.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.43-54
• /
• 2005

For the effective design of automated distribution center composed of Automated Storage/Retrieval System, Automated Guided Vehicle System, and Conveyor System, we proposed an analysis method to determining. design and control parameters with multiple performance objectives using Compromise Programming, which can resolve the dilemma of conflicting objectives. The Evolution Strategy generates the optimal solutions for each objectives. The Analytic Hierarchy Process selects the best solution among the alternatives generated from Evolution Strategy. The Regression Analysis formulates the objective functions for each objectives. By reducing deviations between goal values and target values generated from Analytic Hierarchy Process, Compromise Programming determines design and control parameters by compromising the multiple objectives formulated using Regression Analysis. When the parameters of system are changed, this proposed analysis method has a benefit of reducing costs and time without repeating whole simulation run.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.3-7
• /
• 1997

Simulation is commonly used to find the best values of decision variables for problems which defy analytical solutions. "Simulation Optimization" technique is used to optimize the expressed in analytical of mathematical models. In this research, we will study Reverse-Simulation optimization method which is quite different from current simulation optimization methods in literature. We will focus on the on-line determination of steady-state method which is very important issue in Reverse-Simulation optimization, and the construction of Reverse-Simulation algorithm with expert systems. Especially, in the case of multiple objectives because of the dependency of simulation model, all objectives do not satisfied simulataneously. In this paper, therefore, we process simulation optimization using objectives with priority to optimize multiple objectives under single run.ingle run.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3277-3290
• /
• 2023

Nuclear power plant (NPP) operations with multiple objectives and devices are still performed manually by operators despite the potential for human error. These operations could be automated to reduce the burden on operators; however, classical approaches may not be suitable for these multi-objective tasks. An alternative approach is deep reinforcement learning (DRL), which has been successful in automating various complex tasks and has been applied in automation of certain operations in NPPs. But despite the recent progress, previous studies using DRL for NPP operations have limitations to handle complex multi-objective operations with multiple devices efficiently. This study proposes a novel DRL-based approach that addresses these limitations by employing a continuous action space and straightforward binary rewards supported by the adoption of a soft actor-critic and hindsight experience replay. The feasibility of the proposed approach was evaluated for controlling the pressure and volume of the reactor coolant while heating the coolant during NPP startup. The results show that the proposed approach can train the agent with a proper strategy for effectively achieving multiple objectives through the control of multiple devices. Moreover, hands-on testing results demonstrate that the trained agent is capable of handling untrained objectives, such as cooldown, with substantial success.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.45-50
• /
• 1984

This paper is concerned with the facility location-allocation problem (FLAP) with multiple objectives. A branch-and-bound procedure is presented to solve the mixed zero-one integer goal programming problem which is to determine facility locations from given candidate locations and to allocate facility capacity to given customer markets simultaneously. A numercial example is given to illustrate this procedure.