• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1296-1299
• /
• 1996

This paper proposes a design automation method for the flight control system of an aircraft based on optimization. The control system design problem which has many specifications is formulated as multi-objective optimization problem. The solution of this optimization problem should be considered in terms of Pareto-optimality. In this paper, we use an evolutionary algorithm providing numerous Pareto-optimal solutions. These solutions are given to a control system designer and the most suitable solution is selected. This method decreases tasks required to determine the control parameters satisfying all specifications. The design automation of a flight control system is illustrated through an example.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.768-776
• /
• 2011

This paper considers a data fitting problem for rational function models using the LM (Levenberg-Marquardt) optimization method. Rational function models have various merits on representing a wide range of shapes and modeling complicated structures by polynomials of low degrees in both the numerator and denominator. However, rational functions are nonlinear in the parameter vector, thereby requiring nonlinear optimization methods to solve the fitting problem. In this paper, we propose a data fitting method for rational function models based on the LM algorithm which is renowned as an effective nonlinear optimization technique. Simulations show that the fitting results are robust against the measurement noises and uncertainties. The effectiveness of the proposed method is further demonstrated by the real application to a 3D depth camera calibration problem.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-28
• /
• 2010

In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem to it. Then we provide for this primal-dual pair weak sufficient conditions which ensure strong duality. In this way we generalize some results recently given in the literature. We also apply the general duality scheme to a portfolio optimization problem, a fact that allows us to derive necessary and sufficient optimality conditions for it.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2800-2814
• /
• 2020

5G network optimization problem is a challenging optimization problem in the practical engineering applications. In this paper, to tackle this issue, Pareto fronts-driven Multi-Objective Cuckoo Search (PMOCS) is proposed based on Cuckoo Search. Firstly, the original global search manner is upgraded to a new form, which is aimed to strengthening the convergence. Then, the original local search manner is modified to highlight the diversity. To test the overall performance of PMOCS, PMOCS is test on three test suits against several classical comparison methods. Experimental results demonstrate that PMOCS exhibits outstanding performance. Further experiments on the 5G network optimization problem indicates that PMOCS is promising compared with other methods.

• IE interfaces
• /
• v.25 no.2
• /
• pp.153-162
• /
• 2012

The reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure and it has been considered as one of the major design parameters in the field of industries. Reliability-Redundancy Optimization Problem(RROP) involves selec tion of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. However, in practice both active and cold standby redundancies may be used within a particular system design. Therefore, a redundancy strategy(active, cold standby) for each subsystem in order to maximize system reliability is considered in this study. Due to the nature of RROP, i.e. NP-hard problem, A Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve the mathematical programming model and it gives consistently better quality solutions than existing studies for benchmark problems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.7
• /
• pp.1404-1409
• /
• 2011

The fundamental research for the mobile robot navigation using the numerical optimization method is presented. We define the mobile robot navigation problem as an unconstrained optimization problem to minimize the cost function with the pose error between the goal position and the position of a mobile robot. Using the nonlinear least squares optimization method, the optimal speeds of the left and right wheels can be found as the solution of the optimization problem. Especially, the rotational speed of wheels of a mobile robot can be directly related to the overall speed of a mobile robot using the Jacobian derived from the kinematic model. It will be very useful for applying to the mobile robot navigation. The performance was evaluated using the simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• Industrial Engineering and Management Systems
• /
• v.13 no.1
• /
• pp.43-51
• /
• 2014

This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is $10{\times}10$ JSP (ten jobs and ten machines) with tribottleneck machines formulated as a bi-level formulation. APSO is used to solve the test problem and the result is compared with the result solved by basic PSO. The results of the test problem show that the results from APSO are significantly different when compared with the result from basic PSO in terms of the upper level objective value and the iteration number in which the best solution is first identified, but there is no significant difference in the lower objective value. These results confirmed that the quality of solutions from APSO is better than the basic PSO. Moreover, APSO can be used directly on a new problem instance without the exercise to select parameters.

• IE interfaces
• /
• v.23 no.2
• /
• pp.139-146
• /
• 2010

In this paper, we present the study of a real passenger transportation system. Passenger transportation problem aims to transport passengers from bus stops to their destinations by a fleet of vehicles while satisfying various constraints such as vehicle capacity, maximum allowable riding time in a bus, and time windows at destinations. Our problem also has special issues such as mixed loading, consideration of afternoon problem together with morning problem, and transferring passengers between vehicles. Our solution approach consists of three serial procedures: bus route generation, bus scheduling, and post optimization. Efficient heuristic algorithms were developed and implemented for the procedures. The proposed solution approach has been successfully applied to several real world problem instances and could reduce about 10% to 15% of buses.

• Structural Engineering and Mechanics
• /
• v.32 no.1
• /
• pp.127-145
• /
• 2009

A novel approach is proposed to effectively estimate the quantile functions of normalized performance indices of reliability constraints in a reliability-based optimization (RBO) problem. These quantile functions are not only estimated as functions of exceedance probabilities but also as functions of the design variables of the target RBO problem. Once these quantile functions are obtained, all reliability constraints in the target RBO problem can be transformed into non-probabilistic ordinary ones, and the RBO problem can be solved as if it is an ordinary optimization problem. Two numerical examples are investigated to verify the proposed novel approach. The results show that the approach may be capable of finding approximate solutions that are close to the actual solution of the target RBO problem.