• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2005.04a
• /
• pp.359-366
• /
• 2005

Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.147-176
• /
• 1996

The main objective of this study is to uncover the differences in the programming behavior between methodology creators and methodology users. We conducted an experiment with methodology creators who have invented one of the major object-oriented methodologies and with professional programmers who have used the same methodology for their software-development projects. In order to explain the difference between the two groups, we propose a theoretical framework that views programming as search in four problem spaces: representation, rule, instance and paradigm spaces. The main problem spaces in programming are the representation and rule spaces, while the paradigm and instance spaces are the supporting spaces. The results of the experiment showed that the methodology creators mostly adopted the paradigm space as their supporting space, while the methodology users chose the instance space as their supporting space. This difference in terms of the supporting space leads to different search behaviors in the main problem spaces, which in turn resulted in different final programs and performance.

• Publications of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.37-57
• /
• 2023

"Are we alone in the universe?" is the fundamental question of mankind. To search for the life signatures in the universe, there have been a lot of researches and space explorations, especially in our solar system. In this review paper, we introduce the definition and characteristics of the "biosignature". The current situations and future plans for searching for biosignatures in our solar system are reviewed, especially at Venus, Mars, and Ocean Worlds such as Europa and Enceladus where life signatures are more likely to exist than in other places in the solar system. Finally, we discuss the opportunities and strategies for the Korean scientific society to participate in searching for biosignatures in the solar system.

• The Journal of Society for e-Business Studies
• /
• v.4 no.3
• /
• pp.179-196
• /
• 1999

A cyber shopping mall is a place where consumers acquire the product information and make purchase decision in the cyber space. Even though there are many advantages over traditional malls, there are still several limitations to do shopping in an existing cyber mall. One of them is the absence of efficient search tool to handle various products specifications. Existing search systems usually support the "keyword search only" with limited product information. Consumers spend lots of their time and efforts in searching products and comparing them. Recently, some web sites provide the shopping mall comparison service that supports the additional search conditions such as price and maker. These services improve the situation but it is not still acceptable. In this paper, we propose an intelligent product search system based on a mediator which supports various conditional search for each product. Our system provides consumers with search results that satisfy purchase specifications. Our system is implemented in Visual basic and pert and experimental results show satisfactory performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• Korean Institute of Interior Design Journal
• /
• v.22 no.5
• /
• pp.152-161
• /
• 2013

This study is about the visual appreciation by sex with the analysis of time range of observing data which was got through observation experiment with the space of lobby in hospitals. The observation data of the subjects who observed the space include the frequency and time, through which the process of visual appreciation could be evaluated with the definition of the frequency and the time of observation. First, the fact that men had higher frequency of observation than women means the former had more movement than the latter, and another fact of their fewer times can be understood as the time of their staying was shorter. That is, even though the men had more movements of sight, they showed the feature of staying shorter. Second, the rate high and low of observation frequency and times made it possible for observation characteristics to be defined as 'intensive search' 'active search' 'fixed concentration' and 'search wandering.' The definition of understanding this process of visual appreciation can be available for a frame of effective analysis of observation characteristics according to the passage of time. Third, the intense search is the case of 'high frequency' having the feature of high visual appreciation owing to the active visual actions for acquiring information. Men were found to have more intense search which decreased gradually as time passed, while women showed the feature of many times of intense search. Fourth, it was found that with many observation data in a certain range of time the subjects had fixed concentration, where women were found to have repetitive fixed concentration along with the change of observation time while men were seen to have more observation tendency for fixed concentration. Fifth, at the cross tabulation of frequency and times, men had the feature of dispersed visual appreciation while women had more distinction between fixation and movement, which revealed that there is surely the difference between men and women in the process of visual appreciation.