• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.749-754
• /
• 2014

In this paper, we suggest tree-structure-aware GP (Genetic Programming) operators that heed tree distributions in structure space and their possible structural difficulties. The main idea of the proposed GP operators is to place the generated offspring of crossover and/or mutation in a specified region of tree structure space insofar as possible by biasing the tree structures of the altered subtrees, taking into account the observation that most solutions are found in that region. To demonstrate the effectiveness of the proposed approach, experiments on the binomial-3 regression, multiplexor and even parity problems are performed. The results show that the results using the proposed tree-structure-aware operators are superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.145-154
• /
• 2001

This paper deals with a network model for the efficient transportation of post and consists of the formulation based on the network model and the LINGO programming model including the operations of the post transportation. This network model is represented by using Time Space Network. The generalized formulation is built up with the input variables and the decision variables, which are defined on the basis of the network model. And LINGO programming model to be proposed with DB and LINGO is constructed in consideration of how to manage the post transportation and the intermodal transport. The results of the model implementation were represented on Time Space Network and they are analyzed and verified. The LINGO programming model is used as the module to be set in application software. Specifically with using GEOmania, GIS tool, the LINGO Model is applied to develop the application for Mail Transportation Decision Support System.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.205-205
• /
• 1988

This paper develops a simple interactive procedure which can be efficiently used to solve a bicriteria linear programming problem. The procedure exploits the relatively simple structure of the bicriterion linear programming problem. Its application to a transportation problem is also presented. The results demonstrate that the method developed in this paper could be easily applicable to any bicriteria linear program in general.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.81-94
• /
• 1986

A shortest path dynamic programming formulation is proposed and attemped to solve an uncapacitated expansion sequencing problem. It is also compared with the Extended Binary State Space approach with total capacity. Difficulties and merits associated with the formulation are discussed. The shortest path dynamic programming lacks the separability condition and an optimal solution is not guaranteed. However it has other merits and seems to be the practical solution procedure for the expansion sequencing problem in a sense that it finds near optimal solution with less state evaluations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• Communications of the Korean Mathematical Society
• /
• v.24 no.1
• /
• pp.67-83
• /
• 2009

Several common fixed point theorems for a few contractive type mappings in complete metric spaces are established. As applications, the existence and uniqueness of common solutions for certain systems of functional equations arising in dynamic programming are discussed.

• Korean Institute of Interior Design Journal
• /
• no.18
• /
• pp.103-109
• /
• 1999

The purpose of this research is to suggest the ultimate solution to the interior elements and ways to express specific function within interior design of the new high-speed train station in Korea through careful studies based on the characteristics of each areas in the stations. During the research, it became very clear that the most important points in designing of the high speed train station's interior space can be found from close examination on whether each space allocation was thoughtfully organized to provide enough space to accommodate various activities of the users. Another point is to realize, within the space program, that there should be a clear understanding of the future expansion plan and reserving sufficient areas for the future growth. Also the problem of requiring larger floor areas to accommodate various functions divided by separate units must be recognized simultaneously during the programming. The new high-sped train must be able to function as a multi service facility of the future. In summary this research is to present datas and suggestion to various areas in the station and redefine its new meaning of train station space program with much borader concept which can be adopted to the process of better space programing.

• The Bulletin of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.65.2-65.2
• /
• 2005

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.10
• /
• pp.832-835
• /
• 2003

The objective of this study is to investigate the possibility of chemical process synthesis purely based on mathematical programming when given an objective, feed conditions, product specifications, and model equations for available process units. A method based on a state space approach is proposed, and applied to an example problem with a reactor, a heat exchanger, and a separator. The results indicate that a computer can automatically synthesize an optimal process without any heuristics or expertise in process design provided that global optimization techniques are improved to be suitable for large problems.

• Industrial Engineering and Management Systems
• /
• v.11 no.1
• /
• pp.26-29
• /
• 2012

In order to deal with the classification problems of type-2 fuzzy training samples on generalized credibility space. Firstly the type-2 fuzzy training samples are reduced to ordinary fuzzy samples by the mean reduction method. Secondly the definition of strong fuzzy linear separable data for type-2 fuzzy samples on generalized credibility space is introduced. Further, by utilizing fuzzy chance-constrained programming and classic support vector machine, a support vector machine based on type-2 fuzzy training samples and established on generalized credibility space is given. An example shows the efficiency of the support vector machine.