• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.1
• /
• pp.28-37
• /
• 2001

This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is applied to improve the computation time and convergence property Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.28 no.7
• /
• pp.48-54
• /
• 2014

This paper discusses study of torque ripple minimization employing an improved TDF(torque distribution function)-based instantaneous torque control to reduce acoustic noise and vibration problem of the SRM. As the flux linkage of the SRM is a nonlinear function of phase current and rotor position, design of optimal controller for the SRM is quite complicated. Hence, an accurate mathematical model considering the nonlinearity of the SRM is required. An improved TDF based torque control has been proposed in order to reduce the toque ripple at high speed operation. Dynamic simulation using Matlab/Simulink as well as Finite Element Analysis is presented. A prototype SRM for electric vehicle traction has been manufactured to validate the experimental results comparing the dynamic simulation results.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.45-49
• /
• 2008

The monorail system as new transportation system mostly has being constructed as an elevated construction. In particular, in case of construction to elevated structure in the center of a city, it is important to decision for a monorail station to be considered the minimization. We must purchase the required lands prior to design the monorail stations because of separation of a platform and a waiting room. So We can exclude the problem that it have too close between a monorail station and the other building. Therefore the standard width and elevation of the monorail station shall be considered the efficient execution, economic and transportation. We have many thing to resolve as the plan of minimization to the station of monorail. But we know the ultimate in environmentally friendly transportation, of course, is our monorail system and we are positive as to a popular transportation craze.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.3
• /
• pp.107-116
• /
• 2021

We introduce optimization algorithms using Bregman Divergence for solving non-negative matrix factorization (NMF) problems. Bregman divergence is known a generalization of some divergences such as Frobenius norm and KL divergence and etc. Some algorithms can be applicable to not only NMF with Frobenius norm but also NMF with more general Bregman divergence. Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. We develop the Bregman proximal gradient method applicable for all NMF formulated in any Bregman divergences. In the derivation of NMF algorithm for Bregman divergence, we need to use majorization/minimization(MM) for a proper auxiliary function. We present algorithmic aspects of NMF for Bregman divergence by using MM of auxiliary function.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.621-633
• /
• 1997

This paper is concerned with the multiobjective vehicle scheduling problem with time and area-dependent travel speeds(MVSPTD), in which two conflicting objectives are explicitly treated and the travel speed between two locations depends on the passing area and time of day. The two objectives are the minimization of total vehicle travel time and the minimization of total weighted tardiness. First, I construct a mixed integer linear programming formulation of the MVSPTD, and present o heuristic algorithm that builds the vehicle schedules based on the savings computed. The results of computational experiments showed that the heuristic performs very well. Finally, I propose an expert system for vehicle scheduling in the MVSPTD. Its whole process is executed under VP-Expert expert system environment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1740-1745
• /
• 2006

This paper is concerned with a novel heuristic algorithm for the multi-trip vehicle routing problem with time windows. The objective function is the minimization of total vehicle operating time, fixed cost of vehicle and the minimization of total lateness of customer. A mixed integer programming formulation and a heuristic algorithm for a practical use are suggested. A heuristic algorithm is constructed two phases such as clustering and routing. Clustering is progressed in order to assign appropriate vehicle to customer, and then vehicle trip and route are decided considering traveling distance and time window. It is shown that the suggested heuristic algorithm gives good solutions within a short computation time by experimental result.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.968-976
• /
• 2003

In this paper, we propose a novel method for lip recognition. Lip model is built based on the concatenated gray level distribution model, and the recognition problem is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with the proposed novel method for setting initial condition, which can refrain Iteration from converging to local minima. The proposed algorithm shows extracting lip shape from the test image where Active Shape Model fails.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.155-160
• /
• 2001

To achieve high precision cutting as well as production capability in the machine tool, it is needed to develop excellent rigidity statically, dynamically and thermally as well. In order to predict the qualitative behavior of a machine tool, simultaneous analysis of mechanics and heat transfer is required. Generally, machine tool designers have solved designing problems based on partial estimation of the specified rigidity. This study clears the inter-relationship between therm, and propose multi-phase optimization of machine tool structure using a genetic algorithm. The multi-phase solution method is consists of a series of mechanical design problem. At this first phase of static design problem, multi-objective optimization for the purpose of minimization of the total weight and static compliance minimization is solved using the Pareto Genetic Algorithm.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.718-723
• /
• 1998

The program which could determine cross-sectional dimension of the prestressed concrete box girder bridges at the stage of preliminary design was developed using the optimal technique in this study. It could minimize the cost required in the design of box girder bridges and the construction with the full staging method. Objective cost function consisted of six independent variables such as height of cross-section, jacking force and thickness of web and bottom flange. The SUMT(Sequntial Unconstrained minimization Technique) was used to solve the constrained nonlinear minimization optimal problem. Using the program developed in this study, optimum design was performed for existing bridges with one cell cross section of constant depth. The result verify the compatibility of the program.