• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.59-62
• /
• 2001

This paper discusses a data mining technique for time series analysis of traffic data, which provides useful knowledge for network configuration management. Commonly, a network designer must employ a combination of heuristic algorithms and analysis in an interactive manner until satisfactory solutions are obtained. The problem of heuristic algorithms is that it is difficult to deal with large networks and simplification or assumptions have to be made to make them solvable. Various data mining techniques are studied to gain valuable knowledge in large and complex telecommunication networks. In this paper, we propose a traffic pattern association technique among network nodes, which produces association rules of traffic fluctuation patterns among network nodes. Discovered rules can be utilized for improving network topologies and dynamic routing performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.31-38
• /
• 1994

We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.328-338
• /
• 1994

TSP(Traveling Salesman Problem) is a famous problem in Operations Research fields due to its applicability to various problems. It is also well-known that the problem is hard to solve in reasonable time, since it is in the NP-Complete class. Hence it is desired to develop heuristics which have polynominal complexity and also solve the problem to near-optimality. This paper presents a heuristic algorithm for TSP using the concept of dynamic programming. The proposed method has the complexity of O(N$\^$3/), and gives improved solutions than other well-known algorithms in our extensive computational experiments.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.21 no.6
• /
• pp.209-217
• /
• 2013

This paper presents a control strategy of 4 wheel drive (4WD) vehicles. Proposed control strategy has simple structure and can easily apply to various vehicles with low cost and time. It is consist of feedforward control for traction ability, fedback control for minimizing the wheel speed difference and yaw control for lateral stability. In addition, to integrate the traction and stability control, a blending function is applied. To evaluate the feasibility of the proposed control strategy, actual vehicle experiment is conducted after deciding the tuning parameter through the simulation. The simulation is accomplished by CarSim and Matlab/Simulink and the actual vehicle test is conducted using full size Sports Utility Vehicle (SUV) equipped rear wheel based solenoid type 4WD device.

• Structural Engineering and Mechanics
• /
• v.53 no.5
• /
• pp.847-865
• /
• 2015

This paper presents the application of a recently developed meta-heuristic algorithm, called Colliding Bodies Optimization (CBO), for size and topology optimization of steel trusses. This method is based on the one-dimensional collisions between two bodies, where each agent solution is considered as a body. The performance of the proposed algorithm is investigated through four benchmark trusses for minimum weight with static and dynamic constraints. A comparison of the numerical results of the CBO with those of other available algorithms indicates that the proposed technique is capable of locating promising solutions using lesser or identical computational effort, with no need for internal parameter tuning.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.3
• /
• pp.113-121
• /
• 2014

This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.870-876
• /
• 1993

This paper presents a binary clustering network (BCN) and a heuristic algorithm to detect pitch for recognition of keywords in continuous speech. In order to classify nonlinear patterns, BCN separates patterns into binary clusters hierarchically and links same patterns at root level by using the supervised learning and the unsupervised learning. BCN has many desirable properties such as flexibility of dynamic structure, high classification accuracy, short learning time, and short recall time. Pitch Detection algorithm is a heuristic model that can solve the difficulties such as scaling invariance, time warping, time-shift invariance, and redundance. This recognition algorithm has shown recognition rates as high as 95% for speaker-dependent as well as multispeaker-dependent tests.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.155-164
• /
• 1996

Biomass to methane via anaerobic digestion conversion is a good supply method of substitutable energy resources. The economic viability of this technology is contingent upon managing the production facilities in a cost effective manner. The problem is to determine the batch production sequence as well as the batch residence times in the digester so as to maximize total gas production over a given planning horizon. The problem is difficult to solve since the batch sequencing decisions and the batch residence time decisions cannot be isolated. This paper developes a heuristic algorithm which is based on a dynamic programming procedure for the multiple feedstock sequencing and scheduling biogas production systems and demonstrates to yield good results.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.189-197
• /
• 1999

Assembly line balancing problem is known as one of difficult combinatorial optimization problems. This problem has been solved with linear programming, dynamic programming approaches. but unfortunately these approaches do not lead to efficient algorithms. Recently, genetic algorithm has been recognized as an efficient procedure for solving hard combinatorial optimization problems, but has a defect that requires long-run time and computational complexties to find the solution. For this reason, we adapt a new method called the Critical Node Method that is intuitive, easy to understand, simple for implementation. Fuzzy set theory is frequently used to represent uncertainty of information. In this paper, to treat the data of real world problems we use a fuzzy number to represent the duration and Critical Node Method based heuristic procedure is developed for solving fuzzy assembly line balancing problem.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.10
• /
• pp.675-682
• /
• 1988

An improved algorithm for optimal daily hydrothermal unit commitment is proposed in this paper. Especially, for the purpose of guarantee on the existence of feasible solution all the time, the secondary states as well as the primary state are considered at each step in the procedure of solution by Hybird Dynamic Programming to solve the problem of which solution may not exist due to the increased number of constraints to be taken into account. The computational problem which may be caused in the course of considering secondary policies through whole steps of the period examined is solved by the heuristic judgement in every step taking load variation rates into account. The effectivness of the algorithm has been demonstrated by applying it to a sample power system.