• IE interfaces
• /
• v.14 no.4
• /
• pp.374-384
• /
• 2001

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop a genetic algorithm(GA) for finding the multiple shortest paths in real traffic network. The proposed GA finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn that are genetically evolved until an acceptable solution is reached. This paper also shows the procedure to find the multiple shortest paths in traffic network of Seoul.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.373-378
• /
• 1998

A method to construct a memoryless feedback law for systems with multiple time-delays in the states is proposed. As a plant model, a differential-difference equation with multiple delayed terms is introduced, A stabilizability condition by memoryless feedback is presented. A feedback gain is calculated with a solution of a finite dimensional Riccati equation. It is shown that the resulting closed loop system is asymptotically stable, and moreover, it is a linear quadratic regulator for some cost functional. An alternative stabilizability condition which is easier to check is given.

• The Pure and Applied Mathematics
• /
• v.12 no.3 s.29
• /
• pp.179-191
• /
• 2005

In this paper we consider a Dirichlet problem in the unit disk. We show that the equation has a unique or multiple solutions according to the range of the parameter. Moreover, we prove that the equation admits a nonradial bifurcation at each branch of radial solutions.

• Journal of the military operations research society of Korea
• /
• v.7 no.2
• /
• pp.63-99
• /
• 1981

The generalized goal decomposition model proposed by Ruefli as a single period decision model is presented for the purpose of a review and extended to make a multiple period planning model. The multiple period planning model in the three level organization is formulated with, linear goal deviations by introducing the goal programming method. Dynamic formulation using the generalized goal decomposition model for each single period problem is also presented. An iterative search algorithm is presented as an appropriate solution method of the dynamic formulation of the multiple period planning model.

• School Mathematics
• /
• v.15 no.4
• /
• pp.847-866
• /
• 2013

The purpose of this study was to analyze students' various solution methods revealed in the lessons of finding out the area of plane figures, and to explore instructional implications on how to draw meaningful formalization out of such multiple methods. The teacher in this study tended to select a few solution methods that were easy for students to understand and to induce formalization. An analysis of students' solution methods and the process of formalization showed that students need to understand what parts of the length of the given plane figure they should know, and to identify the base, height, and diagonal line of the figure. The analysis also showed that it was effective to choose the solution methods that were used by many students and that could be easily transformed into a concise formula. Based on these results, this paper provides instructional suggestions for a teacher to orchestrate classroom discussion toward formalization based on students' multiple solution methods.

• Management & Information Systems Review
• /
• v.5
• /
• pp.287-300
• /
• 2000

Project Managers want to reduce the cost and the completion time of the project simultaneously. But the project completion time tends to increase as the project cost is reduced, and the project cost has a tendency to increase as the project completion time is reduced. In this paper, the resource constrained project scheduling problem with multiple crashable modes is considered. An exact solution method for finding the efficient solution set and the computational results are introduced.

• Proceedings of the Korean Magnetic Resonance Society Conference
• /
• 2000.01a
• /
• pp.3-4
• /
• 2000

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.27-30
• /
• 1991

Recently, the phenomena of voltage instability have become major concern in power system, these phenomena are closely related to what are called multiple load flow solutions and calculation methods on these solutions have developed. The multiple solutions concerned with phenomena are pair solutions in heavy loaded contion. But conventional methods require much run time to find this pair solutions and unusual generation patten in the condition of multiple solutions. In this paper, by using concept of existence condition of multiple solutions, calculation method on the multiple load flow solutions is presented which find the pair solutions in light loaded condintion.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.4
• /
• pp.116-125
• /
• 2014

In this paper, we investigate an inventory and production system in a three-layer supply chain system involving a single supplier, single manufacturer and multiple retailers. Earlier study in this type of supply chain only consider a single raw material in order to produce single item, but we consider raw materials in order to produce multiple items. It is assumed that the cycle time at each stage is an integer multiple of the adjacent downstream stage. We develop an iterative solution procedure to find the order quantity for the multiple items and raw materials that minimizes the supply chain-wide total cost per unit time of the supplier and manufacturer's raw materials ordering and holding, setup and finished items holding, the retailer's ordering and inventory holding. Numerical examples are presented to show that the proposed heuristic gives good performance.