• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.27-35
• /
• 2009

Integer programming is a very effective technique for searching optimal solution of combinatorial optimization problems. However, its applicability is limited to linear models. In this paper, I propose an effective method for solving a nonlinear optimization problem by integrating the powerful search performance of integer programming and the flexibility of neighborhood search algorithms. In the first phase, integer programming is executed with subproblem which can be represented as a linear form from the given problem. In the second phase, a neighborhood search algorithm is executed with the whole problem by taking the result of the first phase as the initial solution. Through the experimental results using a nonlinear maximal covering problem, I confirmed that such a simple integration method can produce far better solutions than a neighborhood search algorithm alone. It is estimated that the success is primarily due to the powerful performance of integer programming.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.9-15
• /
• 2009

Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

• Restorative Dentistry and Endodontics
• /
• v.46 no.3
• /
• pp.33.1-33.12
• /
• 2021

Objectives: This study aimed to investigate the efficacy of ionic and non-ionic-based contrast media (in vitro study) and the combinatorial effect of chitosan-based endo-radiopaque solution (CERS) (in vivo study) for visualization of the root canal anatomy. Materials and Methods: In vitro study (120 teeth): The root canal of maxillary premolars and molars (in vitro group 1 and 2 respectively, n = 60 each) were analyzed using 4 different contrast media (subgroups: Omnipaque 350, Iopamidol, Xenetix 350, and Urografin 76; n = 15 each) in combination with 5.25% sodium hypochlorite (NaOCl). Based on the results of the in vitro study, in vivo study (80 teeth) was done to compare Xenetix 350 + 5.25% NaOCl with CERS (in vivo group 1 and 2 respectively, n = 40 each) on maxillary and mandibular premolars and molars. Two endodontists used radiovisiography to assess the depth of ingress and identify the aberrant root anatomy after access cavity preparation, and after initial cleaning and shaping of canals. Kruskal-Wallis test was used for in vitro comparison (p < 0.05), and Wilcoxon signed-rank test and Mann-Whitney U test for in vivo analysis (p < 0.01). Results: In vitro study, Xenetix 350 + 5.25% NaOCl facilitated a significant higher visualization (p < 0.05). For in vivo study, CERS had a statistically significant depth of ingress (p < 0.01), and was efficient in identifying the aberrant root canal anatomy of premolars and molars. Conclusions: CERS facilitates better visualization of the root canal anatomy of human premolars and molars.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.6A
• /
• pp.1023-1032
• /
• 2006

In this paper, a new method for the bridge maintenance is proposed to overcome the limit of the existing methods and to implement the preventive bridge maintenance system. The proposed method can establish the lifetime optimum maintenance strategy of the deteriorating bridges considering the life-cycle performance as well as the life-cycle cost. The lifetime performance of the deteriorating bridges is evaluated by the safety index based on the structural reliability and the condition index detailing the condition state. The life-cycle cost is estimated by considering not only the direct maintenance cost but also the user and failure cost. The genetic algorithm is applied to generate a set of maintenance scenarios which is the multi-objective combinatorial optimization problem related to the life-cycle cost and performance. The study examined the proposed method by establishing a maintenance strategy for the existing bridge and its advantages. The result shows that the proposed method can be effectively applied to deciding the bridge maintenance strategy.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.5
• /
• pp.67-75
• /
• 2023

This paper deals with the operation of air taxis, which is one of the latest innovative technologies aimed at solving the issue of traffic congestion in cities. A key challenge for the successful introduction of the technology and efficient operation is a vertiport location problem. This paper employs a discrete choice model to calculate choice probabilities of transportation modes for each route, taking into account factors such as cost and travel time associated with different modes. Based on this probability, a mathematical formulation to maximize the utilization rate for air taxi is proposed. However, the proposed model is NP-hard, effective and efficient solution methodology is required. Compared to previous studies that simply proposed the optimization models, this study presents a solution methodology using the cross-entropy algorithm and confirms the effectiveness and efficiency of the algorith through numerical experiments. In addition to the academic excellence of the algorithm, it suggests that decision-making that considers actual data and air taxi utilization plans can increase the practial usability.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• 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 Korean Society for Geospatial Information Science
• /
• v.22 no.4
• /
• pp.175-181
• /
• 2014

Korean government proposed a new initiative 'government 3.0' with which the administration will open its dataset to the public before requests. City of Seoul is the front runner in disclosure of government data. If we know what kind of attributes are governing factors for any given segmentation, these outcomes can be applied to real world problems of marketing and business strategy, and administrative decision makings. However, with respect to city of Seoul, selection of optimal variables from the open dataset up to several thousands of attributes would require a humongous amount of computation time because it might require a combinatorial optimization while maximizing dissimilarity measures between clusters. In this study, we acquired 718 attribute dataset from Statistics Korea and conducted an analysis to select the most suitable variables, which differentiate Gangnam from other districts, using the Genetic algorithm and Dunn's index. Also, we utilized the Microsoft Azure cloud computing system to speed up the process time. As the result, the optimal 28 variables were finally selected, and the validation result showed that those 28 variables effectively group the Gangnam from other districts using the Ward's minimum variance and K-means algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.3
• /
• pp.44-53
• /
• 2010

The H.264/AVC has been designed to use 9 directional intra prediction modes for removing spatial redundancy. It also employs high correlation between neighbouring block modes in sending mode information. For indication of the mode, smaller bits are assigned for higher probable modes and are compressed by predicting the mode with minimum value between two prediction modes of neighboring two blocks. In this paper, we calculated the statistical probability of prediction modes of the current block to exploit the correlation among the modes of neighboring two blocks with several test video sequences. Then, we made the probable prediction table that lists 5 most probable candidate modes for all possible combinatorial modes of upper and left blocks. By using this probability table, one of 5 higher probable candidate modes is selected based on RD-optimization to reduce computational complexity and determines the most probable mode for each cases for improving compression performance. The compression performance of the proposed algorithm is around 1.1%~1.50%, compared with JM14.2 and we achieved 18.46%~36.03% improvement in decoding speed.

• Archives of design research
• /
• v.19 no.1 s.63
• /
• pp.225-234
• /
• 2006

Product designers sketch various ideas of foreground figures(detail design) onto background figures(basic form) and evaluate numerous combinations of them in the late stages of design process. Designers have to test their ideas elaborately with a high-fidelity physical model that looks like a real product. However, due to the requirements of time and expense in making high-fidelity design models, it is impossible to evaluate such a number of combinatorial solutions of background and foreground figures. Contrary to digital models, physical design models are not easily modifiable and so designers cannot easily develope ideas through iterative design-evaluation process. To address these problems, we proposed a new concept 'Augmented Plasticity' that gives morphological editability to a rigid physical object using Augmented Reality technology and implemented the idea as Digital Skin system. Digital Skin system figures out the position and orientation of object surface with ARToolKit visual marker and superimposes a deformed surface image seamlessly using differential rendering method. We tried to apply Digital Skin system to detail design, redesign of product, and material exploration task. In consequence, it was found that Digital Skin system has potential to allow designers to implement and test their ideas very efficiently in the late stages of design process.