• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.17-28
• /
• 2008

The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.'s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2897-2907
• /
• 1998

The production-rule generation from training examples is a hard problem that has large space and many local optimal solutions. Many learning methods are proposed for production-rule generation and genetic algorithms is an alternative learning method. However, traditional genetic algorithms has been known to have an obstacle in converging at the global solution area and show poor efficiency of production-rules generated. In this paper, we propose a production-rule generating method which uses genetic algorithm learning. By analyzing optimal sub-solutions captured by genetic algorithm learning, our method takes advantage of its schema structure and thus generates relatively small rule set.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.971-989
• /
• 2015

With the development of cloud computing, more and more Web services are deployed on geo-distributed datacenters and are offered to cloud users all over the world. Through service composition technologies, these independent fine-grain services can be integrated to value-added coarse-grain services. During the composition, a number of Web services may provide the same function but differ in performance. In addition, the distribution of cloud datacenters presents a geographically dispersive manner, which elevates the impact of the network on the QoS of composite services. So it is important to select an optimal composition path in terms of QoS when many functionally equivalent services are available. To achieve this objective, we first present a graph model that takes both QoS of Web services and QoS of network into consideration. Then, a novel approach aiming at selecting the optimal composition path that fulfills the user's end-to-end QoS requirements is provided. We evaluate our approach through simulation and compare our method with existing solutions. Results show that our approach significantly outperforms existing solutions in terms of optimality and scalability.

• IE interfaces
• /
• v.24 no.3
• /
• pp.220-230
• /
• 2011

The multi-reservoir operation problem for efficient utilization of water resources involves conflicting objectives, and the problem can be solved by varying weight coefficient on objective functions. Accordingly, decision makers need to choose appropriate weight coefficients balancing the trade-offs among multiple objectives. Although the appropriateness of the weight coefficients may depend on the total amount of water inflow, reservoir operating policy may not be changed to a certain degree for different hydrological conditions on inflow. Therefore, we propose to use fuzzy Data Envelopment Analysis (DEA) to rank the weight coefficients in consideration of the inflow variation. In this approach, we generate a set of Paretooptimal solutions by applying different weight coefficients on Coordinated Multi-reservoir Operating Model. Then, we rank the Pareto-optimal solutions or the corresponding weight coefficients by using Fuzzy DEA model. With the proposed approach, we can suggest the best weight coefficients that can produce the appropriate Pareto-optimal solution considering the uncertainty of inflow, whereas the general DEA model cannot pinpoint the best weight coefficients.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.388-393
• /
• 2005

Private peering, public peering and transit are three common types of interconnection agreements between providers in the Internet. An important decision that an Internet service provider (ISP) has to make is which private peering/transit ISPs and Internet exchanges (IXs) to connect with to transfer traffic at a minimal cost. In this paper, we deal with the problem to find the minimum cost set of private peering/transit ISPs and IXs for a single ISP. There are given a set of destinations with traffic demands, and a set of potential private peering/transit ISPs and IXs with routing information (routes per destination, the average AS-hop count to each destination, etc.), cost functions and capacities. Our study first considers all the three interconnection types commonly used in real world practices. We show that the problem is NP-hard, and propose a heuristic algorithm for it. We then evaluate the quality of the heuristic solutions for a set of test instances via comparison with the optimal ones obtained by solving a mixed integer programming formulation of the problem. Computational results show that the proposed algorithm provides near-optimal solutions in a fast time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.445-450
• /
• 2004

This paper describes an optimal design system for multi-disciplinary structural design. An automatic finite element (FE) mesh generation technique, which is based on the fuzzy knowledge processing and computational geometry technique, is incorporated into the system, together with a commercial FE analysis code and a commercial solid modelers. An optimum design solution or satisfactory solutions are then automatically searched using the genetic algorithms modified for real search space, together with the automated FE analysis system. With an aid of genetic algorithms, the present design system allows us to effectively obtain a multi-dimensional solutions. The developed system is successfully applied to the shape design of a micro accelerometer based on a tunnel current concept.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.2
• /
• pp.157-164
• /
• 2012

When designing a multifunctional system consisting of many components performing many functions or missions, it is important to determine the reliability, availability, and maintainability (RAM) of the system and components, and we consider system availability to be the optimization criterion. For given intervals of mean time between failure (MTBF) and mean time to repair (MTTR) of the components, we want to determine the values of MTBF and MTTR for all components that satisfy the target availability. A heuristic method is proposed for finding near-optimal solutions through simulation. We also study numerical examples to check effects of model parameters on the optimal solutions.

• Journal of Distribution Science
• /
• v.13 no.4
• /
• pp.9-19
• /
• 2015

Purpose - This study focuses on the use of evaluative criteria software for imprecise market information, and product mapping relationships between design parameters and customer requirements. Research design, data, and methodology - This study involved using the product predicted value method, synthesizing design alternatives through a morphological analysis and plan, realizing the synthesis in multi-criteria decision-making (MCDM), and using its searching software capacity to obtain optimal solutions. Results - The establishment of product designs conforms to the customer demand, and promotes the optimization of several designs. In this study, the construction level analytic method and the simple multi attribute comment, or the quantity analytic method are used. Conclusions - This study provides a solution for enterprise products' multi-goals decision-making, because the product design lacks determinism, complexity, risk, conflict, and so on. In addition, the changeable factor renders the entire decision-making process more difficult. It uses Fuzzy deduction and the correlation technology for appraising the feasible method and multi-goals decision-making, to solve situations of the products' multi-goals and limited resources, and assigns resources for the best product design.

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

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.