• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.15-27
• /
• 2008

We present and discuss an algorithm for the numerical solution of initial value problems of the form $D_*^\alpha$y(t) = f(t, y(t)), y(0) = y0, where $D_*^\alpha$y is the derivative of y of order $\alpha$ in the sense of Caputo and 0<${\alpha}{\leq}1$. The algorithm is based on the fractional Euler's method which can be seen as a generalization of the classical Euler's method. Numerical examples are given and the results show that the present algorithm is very effective and convenient.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.191-194
• /
• 2001

We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.

• Structural Engineering and Mechanics
• /
• v.1 no.1
• /
• pp.119-135
• /
• 1993

The paper presents a generalized optimal active control algorithm for earthquake-resistant structures. The study included the weighting matrix configuration, stability, and time-delays for achieving control effectiveness and optimum solution. The sensitivity of various time-delays in the optimal solution is investigated for which the stability regions are determined. A simplified method for reducing the influence of time-delay on dynamic response is proposed. Numerical examples illustrate that the proposed optimal control algorithm is advantageous over others currently in vogue. Its feedback control law is independent of the time increment, and its weighting matrix can be flexibly selected and adjusted at any time during the operation of the control system. The examples also show that the weighting matrix based on pole placement approach is superior to other weighting matrix configurations for its self-adjustable control effectiveness. Using the time-delay correction method can significantly reduce the influence of time-delays on both structural response and required control force.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.391-399
• /
• 2006

In order to solve the optimization problem of designing the trajectory of three-dimensional horizontal well, we establish a multi-phase, nonlinear, stochastic dynamic system of the trajectory of horizontal well. We take the precision of hitting target and the total length of the trajectory as the performance index. By the integration of the state equation, this model can be transformed into a nonlinear stochastic programming. We discuss here the necessary conditions under which a local solution exists and depends in a continuous way on the parameter (perturbation). According to the properties we propose a revised Hooke-Jeeves algorithm and work out corresponding software to calculate the local solution of the nonlinear stochastic programming and the expectancy of the performance index. The numerical results illustrate the validity of the proposed model and algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.173-176
• /
• 1999

This paper shows a self tuning fuzzy inference method by the genetic algorithm in the fuzzy-sliding mode control for a Polishing robot. Using this method, the number of inference rules and the shape of membership functions are determined by the genetic algorithm. The fuzzy outputs of the consequent part are derived by the gradient descent method. Also, it is guaranteed that .the selected solution become the global optimal solution by optimizing the Akaike's information criterion expressing the quality of the inference rules. It is shown by simulations that the method of fuzzy inference by the genetic algorithm provides better learning capability than the trial and error method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.31
• /
• pp.115-123
• /
• 1994

Group scheduling, which is a kind of operations scheduling based on the GT concept is analyzed in a multi-stage manufacturing system. The purpose of this research is to develop and evaluate a heuristic algorithm for determining gro up sequence and job sequence within each group to minimize a complex cost function, i.e. the sum of the total pe-nalty cost for tardiness and the total holding cost for flow time, in a multi-stage manufacturing system with group setup time dependent upon group sequence. A heuristic algorithm for group sc heduling is developed, and a numerical example is illustrated. For the evaluation of the pro-posed heuristic algorithm, the heuristic solution of each of 63 problems is compared with that of random scheduling. The result shows that the proposed heuristic algorithm provides better solution in light of the proposed cost function.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.137-146
• /
• 2000

One of the problems faced in implementing cellular manufacturing systems is machine-part group formation. This paper proposes machine-part grouping algorithms based on Self-Organizing Map(SOM) neural networks and K-Means algorithm in cellular manufacturing systems. Although the SOM spreads out input vectors to output vectors in the order of similarity, it does not always find the optimal solution. We rearrange the input vectors using SOM and determine the number of groups. In order to find the number of groups and grouping efficacy, we iterate K-Means algorithm changing k until we cannot obtain better solution. The results of using the proposed approach are compared to the best solutions reported in literature. The computational results show that the proposed approach provides a powerful means of solving the machine-part grouping problem. The proposed algorithm Is applied by simple calculation, so it can be for designer to change production constraints.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.6
• /
• pp.811-821
• /
• 1998

A new scheduling algorithm for large scale semiconductor processes is addressed. The difficulties of scheduling for semiconductor fabrication processes are mainly due from repeating production of wafers that experience reentrant flows. Sequence branch algorithm (SBA) is proposed for large real scheduling problems when all processing times are deterministic. The SBA is based on the reachability graph of Petri net of which the several defects such as memory consumption and system deadlock are complemented. Though the SBA shows the solution deviating a little from the optimal solution of mixed integer programming, it is adjustable for large size scheduling problems. Especially, it shows a potential that is capable of handling commercial size problems that are intractable with mathematical programming.