• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.147-152
• /
• 2008

Ant System(AS) is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, AS is applied to the Multicast Routing Problem. Multicast Routing is modeled as the NP-complete Steiner tree problem. This is the shortest path from source node to all destination nodes. We proposed new AS to resolve this problem. The proposed method selects the neighborhood node to consider all costs of the edge and the next node in state transition rule. Also, The edges which are selected elite agents are updated to additional pheromone. Simulation results of our proposed method show fast convergence and give lower total cost than original AS and $AS_{elite}$.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1911-1918
• /
• 2014

The increase of input resources, such as labor and equipment, in a construction project causes workspace interference between activities and it influences on the productivity and quality of construction activities. To solve this problem, many studies related to the workspace interference have been performed, however they verified the workspace concerning with only the geometric location of activities or generated the shape of workspace by a whole object concept not separated units of detailed operations. It is difficult for project manager to reasonably analyze the workspace conflict, because the size of workspace cannot reflect the characteristics of an activity and input time of a resource. This paper presents a methodology that can generate three-dimensional models in order to optimize the workspace shape and size by considering with the characteristics of each activity and input time of each resource. The suggested method can be used for the active BIM system that optimizes the workspace conflict without additional construction duration and for the searching algorithm of optimized moving path for construction equipment.

• Journal of Korean Association for Spatial Structures
• /
• v.12 no.2
• /
• pp.89-98
• /
• 2012

This study investigates the optimum structural design of space truss considering global buckling, and is to obtain the minimal weight of the structure. The mathematical programming method is used for optimization of each member by member force. Besides, dynamic programming method is adapted for consideration in snap-through buckling. The mathematical modeling for optimum design of truss members consists of objective function of total weight and constrain equations of allowable tensile (or compressive) stress and slenderness. The tangential stiffness matrix is examined to find the critical point on equilibrium path, and a ratio of the buckling load to design load is reflected in iteration procedures of dynamic programming method to adjust the stiffness of space truss. The star dome is examined to verify the proposed optimum design processor. The numerical results of the model are conversed well and satisfied all constrains. This processor is a relatively simple method to carry out optimum design with consideration in global buckling, and is viable in practice with respect to structural design.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.43-52
• /
• 2007

As the number of public Web Services increases, there will be many services with the same functionality. These services. however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a best service while satisfying given QoS constraints. This paper brings parallel branching and response time constraint of business processes into focus and investigates several service selection plans based on multidimensional multiple choice Knapsack model. Specifically. proposed in the paper are a plan with response time constraints for each execution flow, a plan with a single constraint over the whole service types and a plan with a constraint on a particular execution path of a composite Web Services. Experiments are conducted to observe the performance of each plan with varying the number of services, the number of branches and the values of response time constraint. Experimental results show that reducing the number of candidate services using Pareto Dominance is very effective and the plan with a constraint over the whole service types is efficient in time and solution quality for small to medium size problems.

• Convergence Security Journal
• /
• v.11 no.1
• /
• pp.11-18
• /
• 2011

Wireless mesh network technology with transmission speeds similar to wired and wireless technology means to build, compared with wired networks, building a more efficient network to provide convenience and flexibility. The wireless mesh network router nodes in the energy impact of the mobility is less constrained and has fewer features entail. However, the characteristics of various kinds due to network configuration settings and the choice of multiple paths that can occur when the system overhead and there are many details that must be considered. Therefore, according to the characteristics of these network routing technology that is reflected in the design and optimization of the network is worth noting. In this paper, a multi-path setting can be raised in order to respond effectively to the problem of the router node data loss and bandwidth according to traffic conditions and links to elements of the hop count evaluation by using a genetic algorithm as a workaround for dynamic routing the routing metric for wireless mesh network scheme is proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Journal of Ocean Engineering and Technology
• /
• v.31 no.4
• /
• pp.288-298
• /
• 2017

A study of the damage evolution laws for ductile materials was carried out to predict the ductile fracture behavior of a marine structural steel (EH36). We conducted proportional and non-proportional stress tests in the experiments. The existing 3-D fracture strain surface was newly calibrated using two fracture parameters: the average stress triaxiality and average normalized load angle taken from the proportional tests. Linear and non-linear damage evolution models were taken into account in this study. A damage exponent of 3.0 for the non-linear damage model was determined based on a simple optimization technique, for which proportional and non-proportional stress tests were simultaneously used. We verified the validity of the three fracture models: the newly calibrated fracture strain model, linear damage evolution model, and non-linear damage evolution model for the tensile tests of the asymmetric notch specimens. Because the stress evolution pattern for the verification tests remained at mode I in terms of the linear elastic fracture mechanics, the three models did not show significant differences in their fracture initiation predictions.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.9
• /
• pp.82-87
• /
• 2008

Faster, safer and cheaper mailing of the postal matter is essential for surviving in the competitive market of home-delivery service. In the past, the domestic delivery business has been nu by only a few number of companies. But more and more number of companies including medium size ones are participating in the business, and the competition is getting severe. This paper proposes a method to select the optimal location of mail distribution centers that minimally connect the local mail centers of some major cities in Korea using the Steiner Tree theory, which is about connecting a finite number of points with a minimal length of paths and has been used in the distribution system optimization and optimal routing of the transmission lines of the electric power system. By using Steiner Tree theory in finding the best location of the postal delivery hub, we may expect the reduction of transportation cost and the increase of profit, resulting in acquiring the superior position in the competitive delivery business. It is expected that we may use the Steiner Tree theory in finding the best location of the electric power substation for the nott higher EHV(extreme high voltage) transmission network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.510-513
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing we consider, in this paper, how to efficiently support applications such as variable Geocasting basd on Ad-hoc networks. The goal of a geocasting protocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance than previous research.