• Journal of the Korea Society of Computer and Information
• /
• v.29 no.4
• /
• pp.1-8
• /
• 2024

The traveling salesman problem(TSP) is one of the well known combinatorial optimization problems. Local search has been used as a method to solve TSP. Greedy Random Insertion(GRI) is known as an effective neighbor generation method for local search. GRI selects some cities from the current solution randomly and inserts them one by one into the best position of the current partial solution considering only one city at a time. We first propose another greedy neighbor generation method which is named Full Greedy Insertion(FGI). FGI determines insertion location one by one like GRI, but considers all remaining cities at once. And then we propose a method to combine GRI with FGI, in which GRI or FGI is randomly selected and executed at each iteration in simulated annealing. According to the experimental results, FGI alone does not necessarily perform very well. However, we confirmed that the combined method outperforms the existing local search methods including GRI.

• Journal of Korea Game Society
• /
• v.18 no.2
• /
• pp.89-98
• /
• 2018

The recent Neural Network technique has shown good performance in content generation such as image generation in addition to the conventional classification problem and clustering problem solving. In this study, we propose an image generation method using artificial neural network as a next generation content creation technique. The proposed artificial neural network model receives two images and combines them into a new image by taking color from one image and shape from the other image. This model is made up of Convolutional Neural Network, which has two encoders for extracting color and shape from images, and a decoder for taking all the values of each encoder and generating a combination image. The result of this work can be applied to various 2D image generation and modification works in game development process at low cost.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.2
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1304-1319
• /
• 2004

We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.03a
• /
• pp.651-656
• /
• 2002

In general, the most important problem in slope stability analysis is that there is no definite way to describe the natural three-dimensional Joint network. Therefore, the many approaches were tried to anlayze the slope stability. Numerical modeling approach is one of the branch to resolve the complexity of natural system. UDEC, FLAC, and SWEDGE are widely used commercial code for the purpose on stability analysis. For the purpose on the more appropriate application of these kind of code, however, three-dimensional distribution of joint network must be identified in more explicit way. Remaining problem is to definitely describe the three dimensional network of joint and bedding, but it is almost impossible in practical sense. Three dimensional joint generation method with random number generation and the results of generation to UDEC have been applied to settle the refered problems in field site. However, this approach also has a important problem, and it is that joint network is generated only once. This problem lead to the limitation on the application to field case, in practical sense. To get rid of this limitation, Monte Carlo Simulation is proposed in this study 1) statistical analysis of input values and definition of the applied system with statistical parameter, 2) instead of the consideration of generated network as a real system, generated system is just taken as one reliable system, 3) present the design parameters, through the statistical analysis of ouput values Results of this study are not only the probability of failure, but also area of failure block, shear strength, normal strength and failure pattern, and all of these results are described in statistical parameters. The results of this study, shear strength, failure area, pattern etc, can provide the direct basement on the design, cutoff angle, support pattern, support strength and etc.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.1
• /
• pp.20-28
• /
• 2016

This paper presents a generation rescheduling method for the enhancement of transient stability in power systems. The priority and the candidate generators for rescheduling are calculated by using the energy margin sensitivity. The generation rescheduling formulates the Lagrangian function with the fuel cost and emission such as NO_x and SO_x from power plants. The generation rescheduling searches for the solution that minimizes the Lagrangian function by using the Newton’s approach. While the Pareto optimum in the fuel cost and emission minimization has a drawback of finding a number of non-dominated solutions, the proposed approach can explore the non-inferior solutions of the multiobjective optimization problem more efficiently. The method proposed is applied to a 4-machine 6-bus system to demonstrate its effectiveness.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.195-196
• /
• 2008

Output of wind generators are changed by windy level. The change of the output also affects the amplitude of fault current. And this fault current causes OCR's mal-operation. To solve the problem, this paper adopts that Over Current Relay adapted for Decentralized generator algorithm.

• Proceedings of the KIEE Conference
• /
• 2002.11b
• /
• pp.277-279
• /
• 2002

Recently, power requirement has been increasing. But the large generation unit is hardly installed because of economic and environment problem. Therefore, the concern for DG(distributed generation) is growing. Present, allowable interconnection capacity of DG for composite distributed generation is studied. In this paper, it is studied that the new interconnection capacity of DG for composite distribution system interconnected DG. We study new allowable interconnection capacity by power factor and placement. We study SERV(sending end reference voltage) variation and allowable interconnection capacity interconnected new DG.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.151-153
• /
• 2003

This paper was studied on using data of the protective relay by Power Quality Monitor. The protective relay will have problem to save data for PQM(Power Qualify Monitoring) analysis because the protective relay memory is limited. So this paper was proposed new data compression of the data was get from the protective relay. The scheme is compared each cycle after DFT(Discrete Fourier Transform). And scheme is verified through simulation of protective relay data was from real distribution system.