• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.4D
• /
• pp.679-686
• /
• 2006

Recently, the city railway in the Seoul Metropolitan Area (SMA) has offered a low quality of service as a passage time, because it was operated slowly. So, the people who live in modern society are not satisfied about passage time, therefore, this study tried to make that the subway in the SMA becomes a more functional and effective wide-area-transportation-network through an express train introduction's method which examined cases from abroad and current system. and then presented how express train could be applied to current system. In a case study, We used the An-San Line and Su-In Line as a examples and developed a schedule which can minimize the delaying time of subway by using Branch & Bound Algorithm. The train operational plan was loaded to consider a railroad siding, Obtained site, and the dispatch interval(three to ten minutes) for the express and local lines and finally, We presented an alternative operational plan which made by those factors.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.455-461
• /
• 2017

The Lie algebra analogue of Schur's result which is proved by Moneyhun in 1994, states that if L is a Lie algebra such that dimL/Z(L) = n, then $dimL_{(2)}={\frac{1}{2}}n(n-1)-s$ for some non-negative integer s. In the present paper, we determine the structure of central factor (for s = 0) and the factor Lie algebra $L/Z_2(L)$ (for all $s{\geq}0$) of a finite dimensional nilpotent Lie algebra L, with n-dimensional central factor. Furthermore, by using the concept of n-isoclinism, we discuss an upper bound for the dimension of $L/Z_n(L)$ in terms of $dimL_{(n+1)}$, when the factor Lie algebra $L/Z_n(L)$ is finitely generated and $n{\geq}1$.

• Journal of Navigation and Port Research
• /
• v.30 no.7
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• Honam Mathematical Journal
• /
• v.45 no.1
• /
• pp.123-129
• /
• 2023

In this paper, we introduce the reverse of the operator Davis-Choi-Jensen's inequality. Our results are employed to establish a new bound for the Furuta inequality. More precisely, we prove that, if $A,\;B{\in}{\mathcal{B}}({\mathcal{H}})$ are self-adjoint operators with the spectra contained in the interval [m, M] with m < M and A ≤ B, then for any $r{\geq}{\frac{1}{t}}>1,\,t{\in}(0,\,1)$ $A^r{\leq}({\frac{M1_{\mathcal{H}}-A}{M-m}}m^{rt}+{\frac{A-m1_{\mathcal{H}}}{M-m}}M^{rt}){^{\frac{1}{t}}}{\leq}K(m,\;M,\;r)B^r,$ where K (m, M, r) is the generalized Kantorovich constant.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.7
• /
• pp.49-58
• /
• 1997

In process planning for pocket machining, the selection of tool size, tool path, overlap distance, and the calculation of machining time are very important factors to obtain the optimal process planning result. Among those factors, the tool size is the most important one because the others depend on tool size. And also, it is not easy to determine the optimal tool size even though the shape of pocket is simple. Therefore, the optimal selection of tool size is the most essential task in process planning for machining a pocket. This paper presents a method for selecting optimal toos in pocket machining. The branch and bound method is applied to select the optimal tools which minimize the machining time by using the range of feasible tools and the breadth-first search.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.343-351
• /
• 2001

World practice is evidence of that computer systems of an intellectual support of medical activities bound up with examination of patients, their diagnosis, therapy and so on are the most effective means for attainment of a high level of physician\`s qualification. Such systems must contain large knowledge bases consistent with the modern level of science and practice. To from large knowledge bases for such systems it is necessary to have a medical ontology model reflecting contemporary notions of medicine. This paper presents a description of an observation ontology, knowledge base for the physician of general tipe, architecture, functions and implementation of problem independent shell of the system for intellectual supporting patient examination and mathematical model of the dialog. The system can be used by the following specialist: therapeutist, surgeon, gynecologist, urologist, otolaryngologist, ophthalmologist, endocrinologist, neuropathologist and immunologist. The system supports a high level of examination of patients, delivers doctors from routine work upon filling in case records and also automatically forms a computer archives of case records. The archives can be used for any statistical data processing, for producing accounts and also for debugging of knowledge bases of expert systems. Besides that, the system can be used for rise of medical education level of students, doctors in internship, staff physicians and postgraduate students.

• Journal of Korean Port Research
• /
• v.13 no.1
• /
• pp.27-40
• /
• 1999

This study aims to apply and examine the stochastic approach for empty container repositioning and leasing problem. For this a case study has been carried out on actual data such as various cost components and traffic flow. The results reveal that the proposed methodology produces more realistic results than the conventional deterministic approaches. It is also found that the results are significantly affected by the accuracy of demand and supply forecast.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.99-104
• /
• 2002

This paper addresses a problem of machining route selection and determination of input quantity with yield in multi-stage flexible flow system. The problem is formulated as nonlinear programing and the proposed model is solved by genetic algorithm(GA) approach. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound for the same problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.45-50
• /
• 1984

This paper is concerned with the facility location-allocation problem (FLAP) with multiple objectives. A branch-and-bound procedure is presented to solve the mixed zero-one integer goal programming problem which is to determine facility locations from given candidate locations and to allocate facility capacity to given customer markets simultaneously. A numercial example is given to illustrate this procedure.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1553-1556
• /
• 1991

This paper deals with a problem on the selection of alternative tools in a flexible manufacturing system (FMS) where a lot of tools are required to produce a large variety of product items. An approach using branch and bound method is proposed to minimize a total number of tools required through the optimal use of the alternative tools. In this approach, tools are initially divided into tool subgroups based on graph theory for the purpose of the effective search of the optimal solution. A small example is also presented to highlight the effectiveness of the proposed approach.