• Journal of Korean Society of Steel Construction
• /
• v.13 no.5
• /
• pp.577-586
• /
• 2001

The objective of this study is the development of sizing and system shape discrete optime design algorithm which is based on the genetic algorithms (GAs). The algorithm can perform both size and shape optimum designs of space trusses. The developed algorithm was implemented in a computer program. The algorithm is known to be very efficient for the discrete optimization The genetic process selects the next design points based on the survivability of the current design points The evolutionary process evaluates the survivability of the design points selected from the genetic process in the genetic process of the simple genetic algorithms there are three basic operators : reproduction cross-over and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.23-30
• /
• 2003

This study develops an efficient heuristic which is based on genetic approach for AGVs flow path layout problem. The suggested solution approach uses a algorithm to replace two 0-1 integer programming models and a branch-and-bound search algorithm. Genetic algorithms are a class of heuristic and optimization techniques that imitate the natural selection and evolutionary process. The solution is to determine the flow direction of line in network AGVs. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. Genetic algorithm procedure is suggested, and a simple illustrative example is shown to explain the procedure.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.45-48
• /
• 1996

The most research on facility layout problems ignored the actual shape of building where the activities(departments) are to be arranged. They also ignored the aisles between departments inside the building. In this paper, we present a genetic algorithm that searches a very good facility layout with horizontal aisles for two different cases with respect to the department shape. From the extensive experiments, the proposed genetic algorithm generated better layouts than the ones obtained by applying Tam's algorithm. It showed about 10% improvement of performance. We found out the best combination of genetic operators through the experiments.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.2
• /
• pp.23-28
• /
• 2014

For the reconstruction of three-dimensional (3D) shape of microscopic objects through shape from focus (SFF) methods, usually a single focus measure operator is employed. However, it is difficult to compute accurate depth map using a single focus measure due to different textures, light conditions and arbitrary object surfaces. Moreover, real images with diverse types of illuminations and contrasts lead to the erroneous depth map estimation through a single focus measure. In order to get better focus measurements and depth map, we have combined focus measure operators by using genetic algorithm. The resultant focus measure is obtained by weighted sum of the output of various focus measure operators. Optimal weights are obtained using genetic algorithm. Finally, depth map is obtained from the refined focus volume. The performance of the developed method is then evaluated by using both the synthetic and real world image sequences. The experimental results show that the proposed method is more effective in computing accurate depth maps as compared to the existing SFF methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.157-164
• /
• 2011

This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.101-114
• /
• 2000

Multicasting is the simultaneous transmission of data to multiple destinations. In multicast ATM networks the effect of failures on transmission links or nodes can be catastrophic so that the issue of survivability is of great importance. However little attention has been paid to the problem of multicast restoration. This paper presents an efficient heuristic technique for routing backup virtual paths in ulticast networks with link failure. Genetic algorithm is employed here as a heuristic. In the application of genetic algorithm to the problem, a new genetic encoding and decoding method and genetic operators are proposed in this paper. The other several heuristics are also presented in order to assess the performance of the proposed algorithm. Experimental results demonstrate that our algorithm is a promising approach to solving the problem.

• Steel and Composite Structures
• /
• v.4 no.6
• /
• pp.453-469
• /
• 2004

In this article, a genetic algorithm based optimum design method is presented for non-linear steel frames with semi-rigid connections. The design algorithm obtains the minimum weight frame by selecting suitable sections from a standard set of steel sections such as European wide flange beams (i.e., HE sections). A genetic algorithm is employed as optimization method which utilizes reproduction, crossover and mutation operators. Displacement and stress constraints of Turkish Building Code for Steel Structures (TS 648, 1980) are imposed on the frame. The algorithm requires a large number of non-linear analyses of frames. The analyses cover both the non-linear behaviour of beam-to-column connection and $P-{\Delta}$ effects of beam-column members. The Frye and Morris polynomial model is used for modelling of semi-rigid connections. Two design examples with various type of connections are presented to demonstrate the application of the algorithm. The semi-rigid connection modelling results in more economical solutions than rigid connection modelling, but it increases frame drift.