• Journal of the Korea Convergence Society
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2020

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2477-2484
• /
• 1997

Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.963-968
• /
• 2006

The main purpose of this paper is to investigate the stability of water tower with a relatively small footing. The water tower is modeled that the column carrying a container is supported by a rotational spring at the base and is of constant cross-section, with a weight per unit length of column axis. The column model is based on the Bernoulli-Euler beam theory. The Runge-Kutta method and Determinant Search method are used to perform the integration of the governing differential equation and to determine the critical values(critical own weight. and critical buckling load), respectively. The critical buckling loads are calculated over a range of system parameters: the rotational stiffness parameter, the dimensionless radius of container and the own weight parameter of the column. The relation between the rotational stiffness parameter and the critical own weight parameter of the column is analyzed.

• Structural Engineering and Mechanics
• /
• v.58 no.3
• /
• pp.597-612
• /
• 2016

This paper presents an optimization process using Harmony Search Algorithm for minimum weight of steel space frames under earthquake effects according to Turkish Earthquake Code (2007) specifications. The optimum designs are carried out by selecting suitable sections from a specified list including W profiles taken from American Institute of Steel Construction (AISC). The stress constraints obeying AISC-Load and Resistance Factor Design (LRFD) specifications, lateral displacement constraints and geometric constraints are considered in the optimum designs. A computer program is coded in MATLAB for the purpose to incorporate with SAP2000 OAPI (Open Application Programming Interface) to perform structural analysis of the frames under earthquake loads. Three different steel space frames are carried out for four different seismic earthquake zones defined in Turkish Earthquake Code (2007). Results obtained from the examples show the applicability and robustness of the method.

• Structural Engineering and Mechanics
• /
• v.27 no.5
• /
• pp.575-588
• /
• 2007

In this paper, two algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search. The first algorithm utilizes the features of short-term memory (tabu list) facility and aspiration criteria and the other has long-term memory (back-tracking) facility in addition to the aforementioned features. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Allowable stress design (ASD) specification, maximum drift (lateral displacement) and interstorey drift constraints were imposed on the frames. The algorithms were applied to the optimum design of three space frame structures. The designs obtained using the two algorithms were compared to each other. The comparisons showed that the second algorithm resulted in lighter frames.

• Structural Engineering and Mechanics
• /
• v.37 no.5
• /
• pp.543-560
• /
• 2011

In structural engineering there are randomness inherently exist on determination of the loads, strength, geometry, and so on, and the manufacturing of the structural members, workmanship etc. Thus, objective and constraint functions of the optimization problem are functions that depend on those randomly natured components. The constraints being the function of the random variables are evaluated by using reliability index or performance measure approaches in the optimization process. In this study, the minimum weight of a space truss is obtained under the uncertainties on the load, material and cross-section areas with harmony search using reliability index and performance measure approaches. Consequently, optimization algorithm produces the same result when both the approaches converge. Performance measure approach, however, is more efficient compare to reliability index approach in terms of the convergence rate and iterations needed.

• Steel and Composite Structures
• /
• v.8 no.6
• /
• pp.475-490
• /
• 2008

A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.416-420
• /
• 2004

Recently, the importance of vibration reduction at the local structure such as tank, deck which attached machinery and compass deck, has continuously increased by owner and shipbuilder. Because crews are afflicted with them and severe vibration problems affect on the crack of structure. This study conducted optimum design to get a stiffener size of local structure to reducing the vibration level and dec leasing the weight of structure in ship. Random tabu search method (R-Tabu) has fast converging time and can search variables size domains for nonlinear problems. This paper used Nastran external call type independence optimization method which makes using a solver module from Nastran.

• Journal of the military operations research society of Korea
• /
• v.10 no.1
• /
• pp.57-63
• /
• 1984

The 0-1 multi-period Knapsack problem (MPKP) has a horizon of m periods, each having a number of types of projects with values and weights. Subject to the requirement, the cummulative capacity of the problem in each period i cannot be exceeded by the total weight of the projects selected in period 1, 2, ..., i. It is a problem of selecting the projects in such a way that the total value in the knapsack through the horizon of m periods is maximized. A search algorithm is developed and tested in this paper. Search rules that avoid the search of redundant partial solutions are used in the algorithm. Using the property of MPKP, a surrogate constraint concerned with the most available requirement is used in the bounding technique.

• Steel and Composite Structures
• /
• v.22 no.3
• /
• pp.521-535
• /
• 2016

A Harmony Search (HS) and Genetic Algorithms (GA), two powerful metaheuristic search techniques, are used for minimum weight designs of different truss structures by selecting suitable profile sections from a specified list taken from American Institute of Steel Construction (AISC). A computer program is coded in MATLAB interacting with SAP2000-OAPI to obtain solution of design problems. The stress constraints according to AISC-ASD (Allowable Stress Design) and displacement constraints are considered for optimum designs. Three different truss structures such as bridge, dome and tower structures taken from literature are designed and the results are compared with the ones available in literature. The results obtained from the solutions for truss structures show that optimum designs by these techniques are very similar to the literature results and HS method usually provides more economical solutions in multi-element truss problems.