• Title/Summary/Keyword: optimization problem

Search Result 4,342, Processing Time 0.032 seconds

A Study of Ambulance Location Problem Applying the Iterative Procedure of Simulation and Optimization (시뮬레이션과 최적화 모형을 혼합 적용한 구급차 위치선정 모형의 해법연구)

  • Lim, Young Sun;Kim, Sun Hoon;Lee, Young Hoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.4
    • /
    • pp.197-209
    • /
    • 2012
  • This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

Comparative Study on Performance of Metaheuristics for Weapon-Target Assignment Problem (무기-표적 할당 문제에 대한 메타휴리스틱의 성능 비교)

  • Choi, Yong Ho;Lee, Young Hoon;Kim, Ji Eun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.3
    • /
    • pp.441-453
    • /
    • 2017
  • In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

A Study on the Minimum - Energy Trajectories Planning for Industrial Robot (로보트의 소비 에너지 최소화를 위한 궤도 계획에 관한 연구)

  • Choi, Doe-Yeong;Kwon, Syng-Hoe;Park, In-Kap;Kim, Hyung-Lae
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.937-940
    • /
    • 1988
  • The problem of minimization of energy, consumed by the robot manipulator, is important, notably for larger manipulators, higher working speeds, and loads. Obviously, the stated problem requires the application of optimal control theory, which is being successfully applied for linear system and certain classes of nonlinear systems. However, the application of optimal control theory(in energy or time optimization) leads to substantial practical difficulties, so that significant simplifications are usually performed, either in model complexity or by neglecting the existing constraints. In this paper the problem of obtaining such an optimization method. which would take into account the complete system dynamics and all the constraints is considered. The only method found to be suitable for such a complex optimization should be based on dynamic programming.

  • PDF

An Assignment-Balance-Optimization Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.97-103
    • /
    • 2016
  • This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.

Robust Adaptive Observer Design for a Class of Nonlinear Systems via an Optimization Method (최적화 기법에 의한 비선형 시스템에서의 강인한 적응 관측기 설계)

  • Jung Jong-Chul;Huh Kun-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.10 s.253
    • /
    • pp.1249-1254
    • /
    • 2006
  • Existing adaptive observers may cause the parameter drifts due to disturbances even if state estimation errors remain small. To avoid the drift phenomena in the presence of bounded disturbances, several robust adaptive observers have been introduced addressing bounds in state and parameter estimates. However, it is not easy for these observers to manipulate the size of the bounds with the selection of the observer gain. In order to reduce estimation errors, this paper introduces the (equation omitted) gain minimization problem in the adaptive observer structure, which minimizes the (equation omitted) gain between disturbances and estimation errors. The stability condition of the adaptive observer is reformulated as a linear matrix inequality, and the observer gain is optimally chosen by solving the convex optimization problem. The estimation performance is demonstrated through a numerical example.

$H_\infty$ Optimal tuning of Power System Stabilizer using Genetic Algorithm (유전알고리즘을 이용한 전력계통 안정화 장치의 강인한 $H_\infty$최적 튜닝)

  • Jeong, Hyeong-Hwan;Lee, Jun-Tak;Lee, Jeong-Pil;Han, Gil-Man
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.3
    • /
    • pp.85-94
    • /
    • 2000
  • In this paper, a robust H$\infty$ optimal tuning problem of a structure-specified PSS is investigated for power systems with parameter variation and disturbance uncertainties. Genetic algorithm is employed for optimization method of PSS parameters. The objective function of the optimization problem is the H$\infty$-norm of a closed loop system. The constraint of the optimization problem are based on the stability of the controller, limits on the values of the parameters and the desired damping of the dominant oscillation mode. It is shown that the proposed H$\infty$ PSS tuned using genetic algorithm is more robust than conventional PSS.

  • PDF

Optimization of BLDC Motor for Reduction of Cogging Torque Using Response Surface Methodology (반응표면방법론에 의한 BLDC 전동기의 코깅토크저감을 위한 최적화)

  • Kim, Young-Kyoun;Hong, Jung-Pyo
    • Proceedings of the KIEE Conference
    • /
    • 2000.07b
    • /
    • pp.647-649
    • /
    • 2000
  • This paper presents a optimization procedure by using Response Surface Methodology(RSM) to determine design Parameters for reducing cogging torque in BLDC motor of Electric Power Steering (EPS). RSM is achieved through using the experiment design method in combination with Finite Element Method and well adapted to make analytical model for a complex problem considering a lot of interaction of these parameters. Moreover, Sequential Quadratic Problem (SQP) method is used to solve the resulting of constrained nonlinear optimization problem.

  • PDF

A Study on distribution system reconfiguration using Genetic algorithms (유전 알고리즘을 이용한 배전계통 선로 재구성에 관한 연구)

  • Mun, K.J.;Kim, H.S.;Hwang, G.H.;Lee, H.S.;Park, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.488-490
    • /
    • 1995
  • This paper presents an optimization technique using genetic algorithms(GA) for loss minimization in the distribution network reconfiguration. Determining switch position to be opened for loss minimization in the radial distribution system is a discrete optimization problem. GA is appropriate to solve the multivariable optimization problem and it uses population, not a solution. For this reason, GA is attractive to solve this problem. In this paper, we aimed at finding appropriate open sectionalizing switch position using GA, which can lead to minimum transmission losses.

  • PDF

A Study on Earth-Moon Transfer Orbit Design

  • No, Tae-Soo;Lee, Ji-Marn;Jeon, Gyeong-Eon;Lee, Dae-Ro;Kim, Ghang-Ho
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.13 no.1
    • /
    • pp.106-116
    • /
    • 2012
  • Optimal transfer trajectories based on the planar circular restricted three body problem are designed by using mixed impulsive and continuous thrust. Continuous and dynamic trajectory optimization is reformulated in the form of discrete optimization problem. This is done by the method of direct transcription and collocation. It is then solved by using nonlinear programming software. Two very different transfer trajectories can be obtained by the different combinations of the design parameters. Furthermore, it was found out that all designed trajectories permit a ballistic capture by the Moon's gravity. Finally, the required thrust profiles are presented and they are analyzed in detail.

An Improved Particle Swarm Optimization for Economic Dispatch Problems with Prohibited Operating Zones (경제급전 문제에의 개선된 PSO 알고리즘 적용)

  • Jeong, Yun-Won;Lee, Woo-Nam;Kim, Hyun-Houng;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.850-851
    • /
    • 2007
  • This paper presents an efficient approach for solving the economic dispatch (ED) problems with prohibited operating zones using an improved particle swarm optimization (PSO). Although the PSO-based approaches have several advantages suitable to the heavily constrained nonconvex optimization problems, they still have the drawbacks such as local optimal trapping due to the premature convergence (i.e., exploration problem) and insufficient capability to find nearly-by extreme points (i.e., exploitation problem). This paper proposes an improved PSO framework adopting a crossover operation scheme to increase both exploration and exploitation capability of the PSO. The proposed method is applied to ED problem with prohibited operating zones. Also, the results are compared with those of the state-of-the-art methods.

  • PDF