• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.480-485
• /
• 1993

A method for obtaining optimal orbital maneuvers of a space vehicle has been developed by combining feedback linearization method with the elegance of the Lambert's theorem. To obtain solutions to nonlinear orbital maneuver problems. The full nonlinear equations of motion for space vehicle in polar coordinate system are transformed exactly into a controllable linear set in Brunovsky canonical form by using feedback linearization by choosing position vector as fully observable output vector. These equations are used to pose a linear optimal tracking problem with a solutions to Lambert's problem and a linear analytical solution of continuous low thrust problem as reference trajectories.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.303-312
• /
• 1994

The problem of optimally allocating available communication channels in a cellular mobile system with nonuniform traffic distribution is considered. This problem is to minimize the weighted average blocking probability subject to cochannel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangian relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.

• 전기의세계
• /
• v.21 no.3
• /
• pp.31-40
• /
• 1972

This study intends to investigate the optimal switching modes of a double-capacitive thermal system under different constraints on the state and the control variable, by the application of the Pontryagin's Minimum Principle. Throughout the development, the control effort is assumed to have two modes of state: M or zero and the terminal times being fixed. In the first part of this study, the Principle is discussed under various conditions for this particular problem, with different criterion functions and in the same time imposing a certain constraints; i) on the terminal states, ii) on functions of the terminal states. Depending upon the upper bound value of the control vector, possible driving modes of the states are studied from which particular optimal driving modes are extracted so as to meet the specified constraints and boundary conditions imposed in the problem. Numerical solutions are evaluated for an over0damped, double-capacitive thermal plant and the optimal solutions: the switching mode, the optimal switching time, and the control effort are compared with the analytical results, in the second part of this work, to confirm the development.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.869-874
• /
• 2007

In searching for solutions to multiobjective optimization problem, we find that there is no single optimal solution but rather a set of solutions known as 'Pareto optimal set'. To find approximation of ideal pareto optimal set, search capability of diverse individuals at population space can determine the performance of evolutionary algorithms. This paper propose the method to maintain population diversify and to find non-dominated alternatives in Game model based Co-Evolutionary Algorithm.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.3 no.2
• /
• pp.93-103
• /
• 1997

This paper develops a new heuristic, the Excursion Algorithm(EA), for constructing optimal designs for the experiments related with marine environment. The proposed EA consists of three parts: 1) construction of an initial feasible solution, 2) excursions over a bounded region, and 3) stopping rules. It is the second part that distinguishes the EA from the other existing heuristic methods. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviating the risks of being trapped at a local optimum. Since this problem is formulated for the first time thesis, other heuristic algorithms do not exist. Therefore, global optimal solutions are obtained by complete enumeration for some cases, and the performance of the EA is evaluated in terms of solution quality. Computational results show that the proposed EA is effective in finding good(or, in many cases, global) solutions to the constrained optimal experimental design problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4054-4071
• /
• 2015

Named-Data Networking (NDN) is one of the promising approaches for the Future Internet to cope with the explosion and current usage pattern of Internet traffic. Content provider mobility in the NDN allows users to receive real-time traffic when the content providers are on the move. However, the current solutions for managing these mobile content providers suffer several issues such as long handover latency, high cost, and non-optimal routing path. In this paper, we survey main approaches for provider mobility in NDN and propose an optimal scheme to support the mobile content providers in the large-scale NDN domain. Our scheme predicts the movement of the provider and uses state information in the NDN forwarding plane to set up an optimal new routing path for mobile providers. By numerical analysis, our approach provides NDN users with better service access delay and lower total handover cost compared with the current solutions.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.2
• /
• pp.219-225
• /
• 2014

I use the dynamic programming approach to study the optimal consumption and investment problem with regime-switching and constant labor income. I derive the optimal solutions in closed-form with constant absolute risk aversion (CARA) utility and constant disutility.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.1
• /
• pp.85-90
• /
• 2013

We use the dynamic programming method to investigate the optimal consumption and investment problem with regime-switching. We derive the optimal solutions in closed-form with constant absolute risk aversion (CARA) utility.