• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.195-205
• /
• 2004

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.261-264
• /
• 2001

This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.366-369
• /
• 1991

Load shedding algorithm has been developed using heuristic search and D.C flow method. The line flow error with a D.C method was improved in this paper. Minimization of load shedding was obtained with heuristic search method. Although analytical method have been mixed with expert algorithm the C language fitted well for this purpose.

• East Asian mathematical journal
• /
• v.2
• /
• pp.69-74
• /
• 1986

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.622-625
• /
• 2001

Photovoltaic generation systems need MPPT (Maximum Power Point Tracking) control because the output power depends on the operating voltage and current. Therefore, many researchers propose various types of MPPT control methods. A new MPPT control scheme is proposed in this paper in order to realize higher efficiency with simple calculation. The line search algorithm with fibonacci sequence which is one of the optimizing method is employed for the MPPT. The line search method is modified for real-time operation. The method is verified by simulations and experiments. It is concluded that the scheme can respond fast variation of irradiance.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.555-561
• /
• 2009

In lieu of section profile data, a fitting of the bored tunnel shape is more significant confirmation for maintenance of a tunnel. Before the permit on the completion of a tunnel, deformation of the completed tunnel with respect to the design model are considered. And deformation can be produced at continuously along the entire of the tunnel section. This study firstly includes an analysis of algebraic approach and test it with an observed field data. And then a number of methods, line search method, genetic algorithm, and pattern search methods, are compared with the 3D tunnel shape fitting. Algebraic methods can solve a simple circular cylinder type as like a railway tunnel. However, a more complex model (compound circular curve and non circular) as like a highway tunnel has to be solved with soft computing tools in the cause of conditional constraints. The genetic algorithm and pattern search methods are computationally more intensive, but they are more flexible at a complex condition. The line search method is fastest, but it needs a narrow bounds of the initial values.

• Journal of Drive and Control
• /
• v.11 no.4
• /
• pp.32-38
• /
• 2014

The hydraulic fuse, which responds to the suddenly increased flow on rupture of a line and shuts off the fluid flow, would prevent large spillage of liquid. The quick-acting hydraulic fuse, which is mainly composed of a poppet, a seat, and a spring, must be designed to minimize the leaked flow and to prevent high collision speed between the poppet and seat during fuse operation on a line rupture. The optimal design parameters of a quick-acting hydraulic fuse were searched using the genetic algorithm and the complex method that are kinds of constrained direct search methods. The dynamic behavior of a quick-acting hydraulic fuse was researched using computer simulations that applied the obtained optimal design parameters.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.