• Journal of Korean Society of Transportation
• /
• v.18 no.1
• /
• pp.61-73
• /
• 2000

The equilibrium network design problem can be formulated as a mathematical Program with variational inequality constraints. We know this problem may have may multiple local solutions due to its inherent characteristics - Nonlinear Objective function and Nonlinear, Nonconvex constraints. Hence, it is difficult to solve for a globally optimal solution. In this paper, we propose a genetic algorithm to obtain a globa1 optimum among many local optima. A Proposed a1gorithm is compared with 4 different solution algorithms for 1 small test network and 1 real-size network. The results of some computational testing are reported.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.726-732
• /
• 2017

In practical distributed sensing and prediction applications over wireless sensor networks (WSN), environmental sensing activities are highly dynamic because of noisy sensory information from moving source signals. The recent distributed online convex optimization frameworks have been developed as promising approaches for solving approximately stochastic learning problems over network of sensors in a distributed manner. Negligence of mobility consequence in the original distributed saddle point algorithm (DSPA) could strongly affect the convergence rate and stability of learning results. In this paper, we propose an integrated sliding windows mechanism in order to stabilize predictions and achieve better convergence rates in cooperative detection of a moving source signal scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10B
• /
• pp.900-908
• /
• 2006

This paper studied on the future market competitive structure among mobile multimedia services that offer a variety of multimedia services and contents through wireless networks. In the past, forecasting methods based on market data would be used popularly in telecommunications industry. However, methods must focus on not market data but customer preferences. In this reason, paper use to forecast the market competitive structure and offer firm strategies and policies using a customer choice probability model.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.127-137
• /
• 2009

A practical algorithm of generating most probable states in decreasing order of probability of the network system state is suggested for approximating the performance of multi-mode network system using algebraic structure of the system states. Most complex system having network structure with multi-mode unit state is difficult to evaluate the performance or reliability due to exponentially increasing size of state space. Hence not an exact computing method but an approximated one is reasonable approach to solve the problem. To achieve the goal we should enumerate the network system states in order as a pre-processing step. In this paper, we suggest an improved algorithm of generating most probable multi-mode states to get the ordered system states efficiently. The method is compared with the previous algorithms in respective to memory requirement and empirical computing time. From the experiment proposed method has some advantages with regard to the criterion of algorithm performance. We investigate the advantages and disadvantage by illustrating experiment examples.

• Journal of the Society of Naval Architects of Korea
• /
• v.32 no.1
• /
• pp.25-36
• /
• 1995

The application of the reliability analysis is investigated as a probabilistic approach to the assessment of ship's structural strength and to the establishment of design format for longitudinal strength. Reliability analyses are carried out for 34 ships of tankers and bulk carriers built in HHI for some failure modes such as tensile yielding, compressive buckling and ultimate strength of hull girder. The safety assessment of each ship, the calculation of sensitivity factors and the derivation of target reliability index are performed. As results. the difference of reliability indices among ships is great for all modes. To provide more uniform levels of safety the establishment of new strength criteria using partial safety factors is performed. The partial safety factors for the design format are obtained according to the AFOSM method and the reliability-conditioned(RC) method. Finally, a design format using partial safety factors has been proposed. We could find out that new strength criteria can produce consistent reliability indices which are close to the target value.

• Journal of Creative Information Culture
• /
• v.5 no.2
• /
• pp.145-156
• /
• 2019

In this study, we have developed and evaluated an information extracting module based on the named entity recognition technique. For the given purpose in this paper, the module was designed to apply to the problem dealing with extraction of postal address information from arbitrary documents without any prior knowledge on the document layout. From the perspective of information technique practice, our approach can be said as a probabilistic n-gram (bi- or tri-gram) method which is a generalized technique compared with a uni-gram based keyword matching. It is the main difference between our approach and the conventional methods adopted in natural language processing that applying sentence detection, tokenization, and POS tagging recursively rather than applying the models sequentially. The test results with approximately two thousands documents are presented at this paper.

• Journal of Korean Society of Steel Construction
• /
• v.13 no.5
• /
• pp.567-575
• /
• 2001

In order to consider statistical properties of probability variables used in the structural analysis the conventional approach using the safety factor based on past experience usually estimated the safety of a structure Also the real structures could only be analyzed with the error in estimation of loads material characters and the dimensions of the members. But the errors should be considered systematically in the structural analysis Safety of structure could not precisely be appraised by the traditional structural design concept Recently new aproach based on the probability concept has been applied to the assessment of structural safety using the reliability concept Thus the computer program by the Probabilitstic FEM is developed by incorporating the probabilistic concept into the conventional FEM method. This paper estimated for the reliability of a plane stress structure by Advanced First-Order Second Moment method using von Mises, Tresca and Mohr-Coulomb failure criterions. Verification of the reliability index and failure probability of attained by the Monte Carlo Simulation method with the von Mises criterion were same as PFEM, but the Monte Carlo Simulation were very time-consuming. The variance of member thickness and load could influence the reliability and failure probability most sensitively among the design variables from the results of the parameter analysis. The proper failure criterion according to characteristic of materials must be used for safe design.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.33 no.2
• /
• pp.129-136
• /
• 2020

In this study, we develop a sampling-based seismic probabilistic risk assessment (SPRA) quantification technique that can accurately consider a partially dependent condition of component seismic fragility information. Specifically, the SPRA quantification method is proposed by combining the advantages of two representative methodologies: EPRI seismic fragility and JAERI seismic fragility input-based quantification. The most important feature of the proposed method is that it performs a SPRA using a sampling technique by transforming the EPRI seismic fragility input into JAERI seismic fragility input. When the proposed sampling-based approach was applied to an example of simple system and to a SPRA problem of a nuclear power plant, it was observed that the proposed method yields approximately similar system seismic fragility and seismic risk results as those of the exact solution. Therefore, it is believed that the approach proposed in this study can be used as a useful tool for accurately assessing seismic risks, considering the partial seismic dependence among the components; the existing SPRA method cannot handle such partial dependencies.

• Korean Journal of Food Science and Technology
• /
• v.38 no.4
• /
• pp.589-593
• /
• 2006

The objective of this study was to evaluate the use of fuzzy math strategy to calculate variability and uncertainty in quantitative risk assessment. We compared the propagation of uncertainty using fuzzy math simulation with Monte Carlo simulation. The risk far Listeria monocytogenes contamination was estimated for carcass and processed pork by fuzzy math and Monte Carlo simulations, respectively. The data used in these simulations were taken from a recent report on pork production. In carcass, the mean values for the risk from fuzzy math and Monte Carlo simulations were -4.393 log $CFU/cm^2$ and -4.589 log $CFU/cm^2$, respectively; in processed pork, they were -4.185 log $CFU/cm^2$ and -4.466 log $CFU/cm^2$ respectively. The distribution of values obtained using the fuzzy math simulation included all of the results obtained using the Monte Carlo simulation. Consequently, fuzzy math simulation was found to be a good alternative to Monte Carlo simulation in quantitative risk assessment of pork production.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.