• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.7
• /
• pp.339-349
• /
• 2001

This paper suggests an optimal identification method for complex and nonlinear system modeling that is based on Fuzzy-Neural Networks(FNN). The proposed Hybrid Identification Algorithm is based on Yamakawa's FNN and uses the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. In this paper, the FNN modeling implements parameter identification using HCM algorithm and hybrid structure combined with two types of optimization theories for nonlinear systems. We use a HCM(Hard C-Means) clustering algorithm to find initial apexes of membership function. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are adjusted using hybrid algorithm. The proposed hybrid identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregated objective function(performance index) with weighting factor is introduced to achieve a sound balance between approximation and generalization abilities of the model. According to the selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity(distribution of I/O data), we show that it is available and effective to design an optimal FNN model structure with mutual balance and dependency between approximation and generalization abilities. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

• Journal of Korean Society of Water and Wastewater
• /
• v.27 no.4
• /
• pp.413-428
• /
• 2013

In this study, Ant Colony Algorithm(ACO) was used for optimal model. ACO which are metaheuristic algorithm for combinatorial optimization problem are inspired by the fact that ants are able to find the shortest route between their nest and food source. For applying the model to water distribution systems, pipes, tanks(reservoirs), pump construction and pump operation cost were considered as object function and pressure at each node and reservoir level were considered as constraints. Modified model from Ostfeld and Tubaltzev(2008) was verified by applying 2-Looped, Hanoi and Ostfeld's networks. And sensitivity analysis about ant number, number of ants in a best group and pheromone decrease rate was accomplished. After the verification, it was applied to real water network from S water treatment plant. As a result of the analysis, in the Two-looped network, the best design cost was found to $419,000 and in the Hanoi network, the best design cost was calculated to $6,164,384, and in the Ostfeld's network, the best design cost was found to $3,525,096. These are almost equal or better result compared with previous researches. Last, the cost of optimal design for real network, was found for 66 billion dollar that is 8.8 % lower than before. In addition, optimal diameter for aged pipes was found in this study and the 5 of 8 aged pipes were changed the diameter. Through this result, pipe construction cost reduction was found to 11 percent lower than before. And to conclusion, The least cost design model on water distribution system was developed and verified successfully in this study and it will be very useful not only optimal pipe change plan but optimization plan for whole water distribution system.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1268-1279
• /
• 2015

In order to manage a large number of devices connected to the Internet of Things (IoT), the Internet Engineering Task Force (IETF) proposed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). The route of the RPL network is generated through the use of an Objective Function (OF) that is suitable for the service that is required for the IoT network. Since the route of the RPL network is conventionally simply chosen only by considering the link quality between the nodes, it is sensible to seek an OF that can also provide better Quality of Service (QoS). In previous studies, the end-to-end delay might possibly be sub-optimal because they only deal with problems related to the reduction of energy consumption and not to the link quality on the path to the sink node. In this study, we propose a scheme that reduces the end-to-end delay but also gives full consideration to both the quality on the entire route to the destination and to the expected lifetime of nodes with bottlenecks from heaped traffic. Weighting factors for the proposed scheme are chosen by experiments and the proposed scheme can reduce the end-to-end delay and the energy consumption of previous studies by 20.8% and 10.5%, respectively.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.109-120
• /
• 2004

Since the late of 1990, there have been number of studies on the required number of probe vehicles and/or optimal aggregation interval sizes for travel time estimation and forecasting. However, in general one to five minutes are used as aggregation intervals for the travel time estimation intervals for the travel time estimation and/or forecasting of loop detector system without a reasonable validation. The objective of this study is to deveop models for identifying optimal aggregation interval sizes of loop detector data for travel time estimation and prediction. This study developed Cross Valiated Mean Square Error (CVMSE) model for the link and route travel time forecasting, The developed models were applied to the loop detector data of Kyeongbu expressway. It was found that the optimal aggregation sizes for the travel time estimation and forecasting are three to five minutes and ten to twenty minutes, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1095-1101
• /
• 2020

Vessels or aircraft should be loaded with containers or cargo to maintain weight balance in order to be stable when navigating the route. The container loading algorithm is known as the NP problem and several heuristic methods have been studied. Containers can be characterized by the uniform volume and weight, which makes it easier to find an optimal loading method. In this paper, we propose an algorithm for weight balance when the volume and weight of an object are uniform. It is assumed that the loading space has a special structure of m * n mesh (where m and n are both odd). In this case, we designed a greedy algorithm and proved that the algorithm is optimal in that it can always find a loading position that maintains a weight balance regardless of the number of objects. Our algorithm can be used in many engineering problems, such as loading algorithms and load balancing problems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.2
• /
• pp.1-12
• /
• 2017

The Seoul metropolitan transportation card's high value lies in its recording of total population movements of the public transit system. In case of recorded information on transit by bus, even though route information utilized by each passenger is accurate, the lack of passenger transfer information of the urban railway makes it difficult to estimate correct routes taken by each passenger. Therefore, pinpointing passenger path selection patterns arising in the metropolitan railway network and using this as part of a path movement estimation model is essential. This research seeks to determine that features of passenger movement routes in the urban railway system is comprised of M-similar routes with increasing number of transfer reflected as additional costs. In order to construct the path finding conditions, an M-similar route searching method is proposed, embedded with non additive path cost which appears through inclusion of the stepwise transportation parameter. As well, sensitivity of the M-similar route method based on transportation card records is evaluated and a stochastic trip assignment model using M-similar path finding is constructed. From these, link trip and transfer trip results between lines of the Seoul metropolitan railway are presented.

• Journal of Korean Society of Transportation
• /
• v.10 no.3
• /
• pp.7-20
• /
• 1992

The common cycle time for the linded signals is usually determined for the critical intersecion, just because the cpacity of a signalized intersection depends on the cycle time. This may not be optimal since the interactions between the flow and the spatial structure of the route or the area are disregarded in this case. It is common to separate the total delay incurred at signals into two parts, a deterministic or uniform delay and a stochastic or random delay. The deterministic delays and the stochastic delays on the artery particularly related to signal cycle time. For this purpose a microscopic simulation technique is used to evaluate deterministic delays, and a macroscopic simulation technique based on the principles of Markov chains is used to evaluate stochastic delays with over flow queue. As a result of investigating the relations between deterministic delays and cycle time in the various circumstances of spacing of signals and traffic volume. As for stochastic delays the resalts of comparisons of the macroscopic simulation and Newell's approximation with the microscopic simulation indicate that the former is valid for the degree of saturation less than 0.95 and the latter is for that above 0.95. Newell's argument that the total stochastic delay on an arterial is dominated by that at or caused by critical intersection is certified by the simulation experiments. The comprehensive analyses of the values of optimal cycle time with various conditions lead to a model. The cycle time determined by this model shows to be approximately 70% of that calculated by Webster's.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• Journal of the Korean Institute of Navigation
• /
• v.19 no.1
• /
• pp.33-48
• /
• 1995

In the process of containerization, the problem of regional maldistribution of container management plan arises seriously due to several factors like a number of unbalances of containers between loading and discharging ports. This study focus on the minimizing cost. This study is composed of two models which in effective management decision making show decision of the number of containers and transfer of empty containers. One is decision of the number of containers which carriers should possess by appropriate forecasting and the other is effective management decision making which includes the transfer of empty containers on calling ports. This study has suggested as follows, First, the Time Series analysis method, especially the "Exponential Smooting with Trend Adjustment" was used to forecast the trade volumes for the designated traffic route. Second, the Time Series analysis method in deciding the optimal number of owned container at the unbalances trade situation between East Bound and West Bound service, most important variables were found such as total traffic volume, the calling interval at a port, the number of days of voyage and the length of stay on shore of container for the optimal number of owned container. Third, effective management decision making model, which makes it possible to analyze the impacts of change in important matters such as lease and positioning policy, and actually influence decision making.on making.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.4
• /
• pp.566-578
• /
• 2017

For optimizing the operation plan when strike packages attack multiple targets, this article suggests a new mathematical model and a parallel hybrid genetic algorithm (PHGA) as a solution methodology. In the model, a package can assault multiple targets on a sortie and permitted the use of mixed munitions for a target. Furthermore, because the survival probability of a package depends on a flight route, it is formulated as a mixed integer programming which is synthesized the models for vehicle routing and weapon-target assignment. The hybrid strategy of the solution method (PHGA) is also implemented by the separation of functions of a GA and an exact solution method using ILOG CPLEX. The GA searches the flight routes of packages, and CPLEX assigns the munitions of a package to the targets on its way. The parallelism enhances the likelihood seeking the optimal solution via the collaboration among the HGAs.