• Structural Engineering and Mechanics
• /
• v.71 no.2
• /
• pp.139-151
• /
• 2019

In a project schedule, it is possible to reduce the time required to complete a project by allocating extra resources for critical activities. However, accelerating a project causes additional expense. This issue is addressed by finding optimal set of time-cost alternatives and is known as the time-cost trade-off problem in the literature. The aim of this study is to identify the optimal set of time-cost alternatives using a multiobjective teaching-learning-based optimization (TLBO) algorithm integrated with the non-dominated sorting concept and is applied to successfully optimize the projects ranging from a small to medium large projects. Numerical simulations indicate that the utilized model searches and identifies optimal / near optimal trade-offs between project time and cost in construction engineering and management. Therefore, it is concluded that the developed TLBO-based multiobjective approach offers satisfactorily solutions for time-cost trade-off optimization problems.

• Restorative Dentistry and Endodontics
• /
• v.46 no.4
• /
• pp.50.1-50.8
• /
• 2021

Although several techniques have been proposed to remove fiber-reinforced composite (FRC) post, no safe and efficient technique has been established. Recently, a guided endodontics technique has been introduced in cases of pulp canal obliteration. This study describes 2 cases of FRC post removal from maxillary anterior teeth using this guided endodontics technique with a dental operating microscope. Optically scanned data set from plaster cast model was superimposed with the data set of cone-beam computed tomography. By implant planning software, the path of a guide drill was selected. Based on them, a customized stent was fabricated and utilized to remove the FRC post. Employing guided endodontics, the FRC post was removed quickly and safely with minimizing the loss of the remaining tooth structure. The guided endodontics was a useful option for FRC post removal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.478-493
• /
• 2024

In this paper, the Mixed Integer Linear Programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 2⁶³ and 2^103.83, respectively. To our best knowledge, these results are superior to current ones.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.1699-1706
• /
• 2015

The purpose of this study is to induce a indicator related to the response, handling and management which are appeared on each step of business enforcement in housing reconstruction projects. Then, it aims to appropriately and reasonably resolve the conflicts of reconstruction business with relevant subjects. These projects physician satisfaction and continual business was going to have the impact that any analysis of the structure in an evaluation. In addition, this study analyzes the impact structure on the business satisfaction and a intention for continuous business through this evaluation. This study sets a operational hypothesis in order to verify the relationship between the variables. then, it creates the structural model by using the Smart PLS 3.0. After analyzing the impact structure by using total 252 samples, this study adopts the final hypothesis which shows (+) path coefficient as set in the hypothesis and test statistic above 1.65. In result, six out of the nine hyphothesis are adopted. then, The 'Response to conflict' which affects the 'Management to conflict(H1)' has a path coefficient of 0.618. In addition, the 'Handling to conflict' which affects the 'Management to conflict(H2)' has a path coefficient of 0.150. The 'Handling to conflict' which affects the satisfaction of 'business' has a path coefficient of 0.101. and the 'management to conflict' which affects the satisfaction of 'business(H7)' has a path coefficient of 0.644. In addition, the 'Intention for continuous business(H8)' shows a path coefficient of 0.258. Finally, The satisfaction of 'business' which affects the 'intention for continuous business(H9)' has a path coefficient of 0.391.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.3
• /
• pp.543-555
• /
• 2013

This study is to analyze effectiveness of golf skills (driving distance, rating of fairway, green in regulation, sand save ratio, recovery ratio, putting average) to average score using records of PGA, LPGA, KPGA, KLPGA. Independent variables were driving distance, rating of fairway, green in regulation, sand save ratio or recovery ratio, putting average. Dependent variable was the scoring average in this study. To analyze these variables, multi-group (PGA vs LPGA, KPGA vs KLPGA, PGA vs KPGA, LPGA vs KLPGA) path analysis was used through AMOS 18.0 program and significance level was set at 0.05. As the result, the variables that show significant differences of path coefficient between PGA model and LPGA model were driving distance and green in regulation to average score. The variables that show significant differences of path coefficient between KPGA model and KLPGA model were driving distance, recovery ratio, and putting average to average score. The variables that show significant differences of path coefficient between PGA model and KPGA model were driving distance, recovery ratio, and putting average to average score. There was not significant difference of path coefficient between LPGA model and KLPGA model.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.1-20
• /
• 2022

The basic way to charge vehicles for using road and public transport networks is the entry-exit toll system. This system works by reading Hi-Pass and public transportation cards of the vehicles using card readers. However, the problems of navigating a route in consideration of entry-exit toll systems include the non-additive costs of enumerating routes. This problem is known as an NP-complete task that enumerates all paths and derives the optimal path. So far, the solution to the entry-exit toll system charging has been proposed in the form of transforming the road network. However, unlike in the public transport network where the cards are generalized, this solution has not been found in situations where network expansion is required with a transfer, multi-modes and multiple card readers. Hence, this study introduced the Link Label for a public transportation network composed of card readers in which network expansion is bypassed in selecting the optimal path by enumerating the paths through a one-to-one k-path search. Since the method proposed in this study constructs a relatively small set of paths, finding the optimal path is not burdensome in terms of computing power. In addition, the ease of comparison of sensitivity between paths indicates the possibility of using this method as a generalized means of deriving an optimal path.

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

We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.