• Journal of Internet of Things and Convergence
• /
• v.10 no.6
• /
• pp.151-165
• /
• 2024

The planning of underground logistics pipeline networks is a crucial component of urban underground logistics systems, aiming to find the optimal construction path for the logistics network, improve logistics efficiency, and reduce operational costs. However, due to the complexity and uncertainty of the underground environment, traditional planning methods often fall short. This paper proposes a improved underground logistics pipeline network planning method based on the White Shark Optimization(WSO) algorithm, referred to as LGWSO(White Shark Algorithms Combining Logistic Maps and Gaussian Variations). The proposed method first establishes an underground space model and then uses the LGWSO algorithm for path planning. By adopting chaos initialization method and Gaussian mutation strategy, the performance of the algorithm has been effectively improved. Through simulation experiments, the algorithm has demonstrated significant advantages in optimization accuracy, convergence speed, and robustness. Compared to traditional planning methods, the proposed approach is better suited to handle the complex underground environment, providing an optimized strategy for the construction of urban logistics system underground networks.

• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.833-841
• /
• 2001

Abstract In this work, we analyze the Levy mutation operations based on the Levy probability distribution in the evolutionary programming via the mean square displacement and the distinctness. The Levy probability distribution is characterized by an infinite second moment and has been widely studied in conjunction with the fractals. The Levy mutation operators not only generate small varied offspring, but are more likely to generate large varied offspring than the conventional mutation operators. Based on this fact, we prove mathematically, via the mean square displacement and the distinctness, that the Levy mutation operations can explore and exploit a search space more effectively. As a result, one can get better performance with the Levy mutation than the conventional Gaussian mutation for the multi-valued functional optimization problems.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.905-915
• /
• 2012

This paper suggests the online method to identify normal and abnormal state of water quality on the ocean USN. To define normal of the ocean water quality, we utilize the negative selection algorithm of artificial immunity system which has self and nonself identification characteristics. To distinguish abnormal status, normal state set of the ocean water quality needs to be defined. For this purpose, we generate normal state set base on mutations of each data and mutation of the data as logical product. This mutated normal (or self) sets used to identify abnormal status of the water quality. We represent the experimental result about mutated self set with the Gaussian function. Through setting the method on the ocean sensor logger, we can monitor whether the ocean water quality is normal or abnormal state by online.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.56-63
• /
• 2015

The optimization is an important role in wide geographical distribution of electrical power market, finding the optimum solution for the operation and design of power systems has become a necessity with the increasing cost of raw materials, depleting energy resources and the ever growing demand for electrical energy. In this paper, the real coded biogeography based optimization is proposed to minimize the operating cost with optimal setting of equality and inequality constraints of thermal power system. The proposed technique aims to improve the real coded searing ability, unravel the prematurity of solution and enhance the population assortment of the biogeography based optimization algorithm by using adaptive Gaussian mutation. This algorithm is demonstrated on the standard IEEE-30 bus system and the comparative results are made with existing population based methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.92-103
• /
• 1997

This paper proposes a new gray-level image segmentation method using GA(genetic algorithm) and an ACA(adaptive clustering algorithm). The solution in the general GA can be moving because of stochastic reinsertion, and suffer from the premature convergence problem owing to deficiency of individuals before finding the optimal solution. To cope with these problems and to reduce processing time, we propose the new GBR algorithm and the technique that resolves the premature convergence problem. GBR selects the individual in the child pool that has the fitness value superior to that of the individual in the parents pool. We resolvethe premature convergence problem with producing the mutation in the parents population, and propose the new method that removes the small regions in the segmented results. The experimental results show that the proposed segmentation algorithm gives better perfodrmance than the ACA ones in Gaussian noise environments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.686-691
• /
• 2011

This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.23-31
• /
• 2011

The simple bacteria cooperative optimization (sBCO) algorithm that we developed as one of optimization algorithms has shown relatively good performances, but their performances were limited by step-by-step movement of individuals at a time. In order to solve this problem, we proposed a new method that assigned a speed to each individual according to its rank and it was confirmed that it improved the performances of sBCO in some degree. In addition to the assigning of speed to the individuals, we employed a new mutation operation that most existing evolutionary algorithms used in order to enhance the performances of sBCO in this paper. A specific percent of bad individuals are mutated within an area that is proportion to the rank of the individual in the mutation operation. That is, Gaussian noise of large standard deviation is added as the fitness of individuals is low. From this, the probability that the individuals with lower ranks can be located far from its parent will be increased. This causes that the probability of falling into local optimum areas is decreased and the probability of fast escaping the local optimum areas is increased. From experimental results with four function optimization problems, we showed that the performances of sBCO with mutation operation and individual speed were increased. If the optimization function is quite complex, however, the performances are not always better. We should devise a new method for solving this problem as a further work.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.171-176
• /
• 2022

A dramatic rise in the number of people dying from heart disease has prompted efforts to find a way to identify it sooner using efficient approaches. A variety of variables contribute to the condition and even hereditary factors. The current estimate approaches use an automated diagnostic system that fails to attain a high level of accuracy because it includes irrelevant dataset information. This paper presents an effective neural network with convolutional layers for classifying clinical data that is highly class-imbalanced. Traditional approaches rely on massive amounts of data rather than precise predictions. Data must be picked carefully in order to achieve an earlier prediction process. It's a setback for analysis if the data obtained is just partially complete. However, feature extraction is a major challenge in classification and prediction since increased data increases the training time of traditional machine learning classifiers. The work integrates the CNN-MDRP classifier (convolutional neural network (CNN)-based efficient multimodal disease risk prediction with TANFIS (tuned adaptive neuro-fuzzy inference system) for earlier accurate prediction. Perform data cleaning by transforming partial data to informative data from the dataset in this project. The recommended TANFIS tuning parameters are then improved using a Laplace Gaussian mutation-based grasshopper and moth flame optimization approach (LGM²G). The proposed approach yields a prediction accuracy of 98.40 percent when compared to current algorithms.