• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.157-162
• /
• 2010

The cart-pole balancing problem is a pseudo-standard benchmark problem from the field of control methods including genetic algorithms, artificial neural networks, and reinforcement learning. In this paper, we propose a novel approach by using online reinforcement learning(OREL) to solve this cart-pole balancing problem. The objective is to analyze the learning method of the OREL learning system in the cart-pole balancing problem. Through experiment, we can see that approximate faster the optimal value-function than Q-learning.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.3
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.389-392
• /
• 2004

The column generation process for the set-partitioning model of the vehicle routing problem requires repeated solutions of column generation subproblems which has a combinatorial structure similar to that of the traveling salesman problem. This limits the size of the problem that can be addressed. We introduce a new modeling approach, termed route-splitting, which splits each vehicle route into segments, and results in more tractable subproblems. A lower bounding scheme that yields an updated bound at each iteration of the column generation process is developed. Implementation issues, including a technique of controlling columns in the master problem, are explored. Lower bounds are computed on standard benchmark problems with up to 199 customers.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.609-612
• /
• 2008

Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.1-9
• /
• 2018

The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.

• Smart Structures and Systems
• /
• v.10 no.4_5
• /
• pp.393-410
• /
• 2012

The 610 m high Canton Tower (formerly named Guangzhou New Television Tower) is currently considered as a benchmark problem for structural health monitoring (SHM) of high-rise slender structures. In the benchmark study task I, a set of 24-hour ambient vibration measurement data has been available for the output-only system identification study. In this paper, the vector autoregressive models (ARV) method is adopted in the operational modal analysis (OMA) for this TV tower. The identified natural frequencies, damping ratios and mode shapes are presented and compared with the available results from some other research groups which used different methods, e.g., the data-driven stochastic subspace identification (SSI-DATA) method, the enhanced frequency domain decomposition (EFDD) algorithm, and an improved modal identification method based on NExT-ERA technique. Furthermore, the environmental effects on the estimated modal parameters are also discussed.

• Computational Structural Engineering : An International Journal
• /
• v.1 no.1
• /
• pp.49-57
• /
• 2001

This paper presents exact solutions for the modal stress-resultant distributions for vibrating rectangular Mindlin plates involving two opposite sides simply supported while the other two sides free. These exact stress-resultants of vibrating plates with free edges, hitherto unavailable, are very important because they serve as benchmark solutions for checking numerical solutions and methods. Using the exact solutions of a square plate, this paper highlights the problem of determining accurate stress-resultants, especially the transverse shear forces and twisting moments in thin plates, when employing the widely used numerical methods such as the Ritz method and the finite element method. Thus, this study shows that there is a need for researchers to develop refinements to the Ritz method and the finite element method for determining very accurate stress-resultants in vibrating plates with free edges.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.11-20
• /
• 2000

The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.241-245
• /
• 2003

This paper presents the LRB-based hybrid base isolation system employing additional semiactive control devices for seismic protection of cable-stayed bridges by examining the ASCE first generation benchmark problem for a cable-stayed bridge. In this study, ideal magnetorheological dampers (MRDs) are considered as additional semiactive control devices. Numerical simulation results show that the hybrid base isolation system is effective in reducing the structural responses of the benchmark cable-stayed bridge under the historical earthquakes considered. The simulation results also demonstrate that the hybrid base Isolation system employing semiactive MRDs is robust to the stiffness uncertainty of the structure. Therefore, the LRB-based hybrid base isolation system employing MRDs could be appropriate in real applications for full-scale civil infrastructures.