• 대한안전경영과학회지
• /
• 제10권1호
• /
• pp.145-153
• /
• 2008

The vehicle routing problem determines each vehicle routes to find the transportation costs, subject to meeting the customer demands of all delivery points in geography. Vehicle routing problem 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. And computational experiments on these instances show that the proposed heuristic yields better results than the simple tabu search does.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• 한국지리정보학회지
• /
• 제8권3호
• /
• pp.84-95
• /
• 2005

본 논문은 가시권역의 최대화를 만족하는 가시권 분석에 있어 지형요소가 어떻게 이용될 수 있으며 이러한 최적 다중 가시점 탐색 문제에 있어 지형요소의 이용이 얼마나 효과적인지를 살펴보는 연구이다. 이를 위하여 다양한 지형상태를 반영하는 지역의 DEM 자료와 각 DEM자료에 대한 지형요소 (peak, pass, pit)의 특정을 반영한 여섯 종류의 탐색방법을 제시하고 전통적인 공간 휴리스틱 (spatial heuristic)과의 비교 분석 (계산 시간과 총 가시권역 크기)을 통해서 지형요소를 이용한 방법의 효율성과 적용 가능성을 살펴보았다. 연구결과로써, 가시구역의 중복을 최소화하기 위해 제시된 버퍼링을 이용한 방법의 경우, 비록 공간 휴리스틱 방법에 비해 적은 가시구역 면적을 제시하였지만, 컴퓨팅 시간적인 측면에서 많은 이점을 제공하고 있음을 볼 수 있다. 또한 연구지역의 DEM상의 각각의 개별 그리드 셀을 대상으로 전체 DEM에 대해 계산된 가시구역을 이용한 방법의 경우, 비록 부가적인 계산 시간이 소요됨에도 불구하고 단순한 지형요소를 이용한 방법보다 향상된 분석 결과를 제시하였음을 알 수 있다.

• Smart Structures and Systems
• /
• 제17권3호
• /
• pp.363-389
• /
• 2016

Deficient modes that cannot be always identified from different sets of measurement data may exist in the application of operational modal analysis such as the stochastic subspace identification techniques in large-scale civil structures. Based on a recent work using the long-term ambient vibration measurements from an instrumented cable-stayed bridge under different wind excitation conditions, a benchmark problem is launched by taking the same bridge as a test bed to further intensify the exploration of mode identifiability. For systematically assessing this benchmark problem, a recently developed SSI algorithm based on an alternative stabilization diagram and a hierarchical sifting process is extended and applied in this research to investigate several sets of known and blind monitoring data. The evaluation of delicately selected cases clearly distinguishes the effect of traffic excitation on the identifiability of the targeted deficient mode from the effect of wind excitation. An additional upper limit for the vertical acceleration amplitude at deck, mainly induced by the passing traffic, is subsequently suggested to supplement the previously determined lower limit for the wind speed. Careful inspection on the shape vector of the deficient mode under different excitation conditions leads to the postulation that this mode is actually induced by the motion of the central tower. The analysis incorporating the tower measurements solidly verifies this postulation by yielding the prevailing components at the tower locations in the extended mode shape vector. Moreover, it is also confirmed that this mode can be stably identified under all the circumstances with the addition of tower measurements. An important lesson learned from this discovery is that the problem of mode identifiability usually comes from the lack of proper measurements at the right locations.

• Nuclear Engineering and Technology
• /
• 제21권3호
• /
• pp.193-204
• /
• 1989

본 논문에서는 정보 이론의 maximum entropy Principle을 이용하여 중성자속 분포를 재생하는 새로운 방법을 시도하였다. 어떤 대상에 대한 부분적인 정보가 있을 때, 이 정보의 한도 내에서 entropy를 최대화시키는 확률 분포는 가장 객관적인 것이 된다. Nodal method계산결과인 평균 중성자속과 current의 값을 prior information으로 삼고, 핵 연료 집합체의 경계에서의 중성자속 분포를 확률의 형태로 변환해서 확률로써 다룬다. Prior information의 한도 내에서 entropy를 최대화시키는 경계에서의 확률 분포를 구하면 핵연료 집합체의 경계에서의 중성자속 분포가 구해지는데, 이것을 경계조건으로 heterogeneous assembly calculation을 행하여 세부적인 중성자속 분포를 구한다. 이 새로운 방법을 몇 개의 benchmark problem assembly에 응용해 본 결과, 노심의 안쪽 부분에서는 이 방법이 form function method에 의한 것과 비슷한 정확도를 보였고 바깥 부분에서는 다소 큰 오차를 보였다. 본 논문에서는 surface-averaged neutron current를 prior in-formation에 포함시키지 못했는데, 이것을 포함시키면 결과가 훨씬 개선 될 것으로 보인다.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.447-456
• /
• 2007

The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which has been developed in recent years. Originally ACO was used for solving the well-known Traveling Salesperson Problem. More recently, ACO has been used to solve many difficult problems. In this paper, we develop an ant colony optimization method to solve the maximum independent set problem, which is known to be NP-hard. In this paper, we suggest a new method for local information of ACO. Parameters of the ACO algorithm are tuned by evolutionary operations which have been used in forecasting and time series analysis. To show the performance of the ACO algorithm, the set of instances from discrete mathematics and computer science (DIMACS)benchmark graphs are tested, and computational results are compared with a previously developed ACO algorithm and other heuristic algorithms.

• 한국경영과학회지
• /
• 제27권4호
• /
• pp.87-109
• /
• 2002

A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

• 대한조선학회논문집
• /
• 제41권2호
• /
• pp.47-54
• /
• 2004

Exact solution on the vertical responses of ships having uniform sectional properties in waves is derived. Boundary value problem consisted of Timoshenko beam equation and free-free end condition is solved analytically. The responses are assumed as linear and wave loads are calculated by using strip method. Vertical bending moment, shear force and deflection are calculated. The developed analysis model is used for the benchmark test of the numerical codes in this problem. Also the application on the preliminary design of barge-like ships and VLFS (Very Large Floating Structure) is expected.

• 산업공학
• /
• 제25권2호
• /
• pp.153-162
• /
• 2012

The reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure and it has been considered as one of the major design parameters in the field of industries. Reliability-Redundancy Optimization Problem(RROP) involves selec tion of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. However, in practice both active and cold standby redundancies may be used within a particular system design. Therefore, a redundancy strategy(active, cold standby) for each subsystem in order to maximize system reliability is considered in this study. Due to the nature of RROP, i.e. NP-hard problem, A Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve the mathematical programming model and it gives consistently better quality solutions than existing studies for benchmark problems.

• Journal of information and communication convergence engineering
• /
• 제2권1호
• /
• pp.36-39
• /
• 2004

In this paper, a method of improving the learning speed and convergence rate is proposed to exploit the advantages of artificial neural networks and neuro-fuzzy systems. This method is applied to the XOR problem, n bit parity problem, which is used as the benchmark in the field of pattern recognition. The method is also applied to the recognition of digital image for practical image application. As a result of experiment, it does not always guarantee convergence. However, the network showed considerable improvement in learning time and has a high convergence rate. The proposed network can be extended to any number of layers. When we consider only the case of the single layer, the networks had the capability of high speed during the learning process and rapid processing on huge images.