• 경영과학
• /
• 제25권3호
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2003년도 춘계학술대회 논문집
• /
• pp.504-509
• /
• 2003

In this paper, a multi-step optimization using a G.A.(Genetic Algorithm) with variable penalty function is introduced to the structural design optimization of a high speed machining center. The design problem, in this case, is to find out the best cross-section shapes and dimensions of structural members which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously. The first step is the cross-section shape optimization, in which only the section members are selected to survive whose cross-section area have above a critical value. The second step is a static design optimization, in which the static compliance and the weight of the machine structure are minimized under some dimensional constraints and deflection limits. The third step is a dynamic design optimization, where the dynamic compliance and the structure weight are minimized under the same constraints as those of the second step. The proposed design optimization method was successful applied to the machining center structural design optimization. As a result, static and dynamic compliances were reduced to 16% and 53% respectively from the initial design, while the weight of the structure are also reduced slightly.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.709-717
• /
• 1997

For an undirected graph G=(V, E), the Rural Postman Problem (RPP) is a problem that finds a minimum cost tour that must pass edges in E'($\subseteq$ E) at least once. RPP, such as Traveling Salesman Problem (TSP), is known as an NP. Complete problem. In the previous study of RPP, he structure of the chromosome is constructed by E' and the direction of the edge. Hence, the larger the size of IE' I is, the larger the size of the chromosome and the size of the solution space are. In this paper, we transform the RPP into a Hamiltonian graph and use a genetic algorithm to solve the transformed problem using restructured chromosomes. In the simulations, we analyze our method and the previous study. From the simulation results, it is found that the results of the proposed method is better than those of the previous method and the proposed method also obtains the near optimal solution in earlier generations than the previous study.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.902-907
• /
• 2004

In this paper, a multi-step optimization using a G.A. (Genetic Algorithm) with variable penalty function is introduced to the structural design optimization of a 5-head route machine. Our design procedure consist of two design optimization stage. The first stage of the design optimization is static design optimization. The following stage is dynamic design optimization stage. In the static optimization stage, the static compliance and weight of the structure are minimized simultaneously under some dimensional constraints and deflection limits. On the other hand, the dynamic compliance and the weight of the machine structure are minimized simultaneously in the dynamic design optimization stage. As the results, dynamic compliance of the 5-head router machine was decreased by about 37％ and the weight of the structure was decreased by 4.48％ respectively compared with the simplified structure model.

• Journal of information and communication convergence engineering
• /
• 제22권3호
• /
• pp.249-255
• /
• 2024

Advancements in deep learning have enhanced vision-based aggregate analysis. However, further development and studies have encountered challenges, particularly in acquiring large-scale datasets. Data collection is costly and time-consuming, posing a significant challenge in acquiring large datasets required for training neural networks. To address this issue, this study introduces a simulation that efficiently generates the necessary data and labels for training neural networks. We utilized a genetic algorithm (GA) to create optimized lists of aggregates based on the specified values of weight and particle size distribution for the aggregate sample. This enabled sample data collection without conducting sieving tests. Our evaluation of the proposed simulation and GA methodology revealed errors of 1.3% and 2.7 g for aggregate size distribution and weight, respectively. Furthermore, we assessed a segmentation model trained with data from the simulation, achieving a promising preliminary F1 score of 78.18 on the actual aggregate image.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.23-27
• /
• 1997

This paper introduces the structural design optimization of a high speed machining center using multi-step optimization combined with G.A.(Genetic Algorithm) and Weighted Method. In this case, the design problem is to find out the best design variables which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously. Dimensional thicknesses of the thirteen structural members of the machine structure are adopted as design variables. The first step is the cross-section configuration optimization, in which the area moment of inertia of the cross-section for each structural member is maximized while its area is kept constant The second step is a static design optimization, In which the static compliance and the weight of the machine structure are minimized under some dimensional and safety constraints. The third step IS a dynamic design optimization, where the dynamic compliance and the structure weight are minimized under the same constraints. After optunization, static and dynamic compliances were reduced to 62.3% and 95.7% Eorn the initial design, while the weight of the moving bodies are also in the feaslble range.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• 산업공학
• /
• 제23권2호
• /
• pp.118-125
• /
• 2010

The determination of a regression model is important in using statistical designs of experiments. Generally, the exact regression model is not known, and experimenters suppose that a certain model form will be fit. Then an experimental design suitable for that predetermined model form is selected and the experiment is conducted. However, the initially chosen regression model may not be correct, and this can result in undesirable statistical properties. We develop model-robust experimental designs that have stable prediction variance for a family of candidate regression models over a cuboidal region by using genetic algorithms and the desirability function method. We then compare the stability of prediction variance of model-robust experimental designs with those of the 3-level face centered cube. These model-robust experimental designs have moderately high G-efficiencies for all candidate models that the experimenter may potentially wish to fit, and outperform the cuboidal design for the second-order model. The G-efficiencies are provided for the model-robust experimental designs and the face centered cube.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2010년도 춘계학술대회 논문집
• /
• pp.1479-1480
• /
• 2010

• Journal of Multimedia Information System
• /
• 제3권4호
• /
• pp.155-160
• /
• 2016

The Pulse Coupled Neural Network (PCNN) is a kind of neural network models that consists of spiking neurons and local connections. The PCNN was originally proposed as a model that can reproduce the synchronous phenomena of the neurons in the cat visual cortex. Recently, the PCNN has been applied to the various image processing applications, e.g., image segmentation, edge detection, pattern recognition, and so on. The method for the image matching using the PCNN had been proposed as one of the valuable applications of the PCNN. In this method, the Genetic Algorithm is applied to the PCNN parameter learning for the image matching. In this study, we propose the method of the similar image rating using the PCNN. In our method, the Genetic Algorithm based method is applied to the parameter learning of the PCNN. We show the performance of our method by simulations. From the simulation results, we evaluate the efficiency and the general versatility of our parameter learning method.