• Industrial Engineering and Management Systems
• /
• v.8 no.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.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.3
• /
• pp.84-95
• /
• 2005

This paper presents solution heuristics to solving optimal multiple-viewpoint location problems that are based on topographic features. The visibility problem is to maximise the viewshed area for a set of viewpoints on digital elevation models (DEM). For this analysis, five areas are selected, and fundamental topographic features (peak, pass, and pit) are extracted from the DEMs of the study areas. To solve the visibility problem, at first, solution approaches based on the characteristics of the topographic features are explored, and then, a benchmark test is undertaken that solution performances of the solution methods, such as computing times, and visible area sizes, are compared with the performances of traditional spatial heuristics. The feasibility of the solution methods, then, are discussed with the benchmark test results. From the analysis, this paper can conclude that fundamental topographic features based solution methods suggest a new sight of visibility analysis approach which did not discuss in traditional algorithmic approaches. Finally, further research avenues are suggested such as exploring more sophisticated selection process of topographic features related to visibility analysis, exploiting systematic methods to extract topographic features, and robust spatial analytical techniques and optimization techniques that enable to use the topographic features effectively.

• Smart Structures and Systems
• /
• v.17 no.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
• /
• v.21 no.3
• /
• pp.193-204
• /
• 1989

This paper develops a new method for reconstructing neutron flux distribution, that is based on the maximum entropy Principle in information theory. The Probability distribution that maximizes the entropy Provides the most unbiased objective Probability distribution within the known partial information. The partial information are the assembly volume-averaged neutron flux, the surface-averaged neutron fluxes and the surface-averaged neutron currents, that are the results of the nodal calculation. The flux distribution on the boundary of a fuel assembly, which is the boundary condition for the neutron diffusion equation, is transformed into the probability distribution in the entropy expression. The most objective boundary flux distribution is deduced using the results of the nodal calculation by the maximum entropy method. This boundary flux distribution is then used as the boundary condition in a procedure of the imbedded heterogeneous assembly calculation to provide detailed flux distribution. The results of the new method applied to several PWR benchmark problem assemblies show that the reconstruction errors are comparable with those of the form function methods in inner region of the assembly while they are relatively large near the boundary of the assembly. The incorporation of the surface-averaged neutron currents in the constraint information (that is not done in the present study) should provide better results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.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.

• Journal of the Society of Naval Architects of Korea
• /
• v.41 no.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.

• IE interfaces
• /
• v.25 no.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
• /
• v.2 no.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.

• Nuclear Engineering and Technology
• /
• v.15 no.2
• /
• pp.135-141
• /
• 1983

Computational accuracy of the modified Borresen's coarse-mesh diffusion theory scheme is investigated with the steady-state solutions of the two- and three-dimensional LRA-BWR bench-mark problem. By comparing the numerical results available for the critical eigenvalue and power distribution of the LRA-BWR, it is shown that the modified scheme is capable of predicting the power distribution of the multi-dimensional BWR problem with an improved accuracy.