• Journal of Korean Society on Water Environment
• /
• v.24 no.2
• /
• pp.180-184
• /
• 2008

A distributed hydrologic model of an urban drainage area on Bugok drainage area in Oncheon stream was developed and combined with a optimization method to determine the optimal location and number of best management practices (BMPs) for storm water runoff reduction. This model is based on the SCS-CN method and integrated with a distributed hydrologic network model of the drainage area using system of 4,211 hydrologic response units (HRUs). Optimal location is found by locating HRU combination that leads to a maximum reduction in peak flow at the drainage outlet in this model. The results of this study indicate the optimal locations and numbers of BMPs, however, for more exact application of this model, project cost and SCS-CN reduction rate of structural facilities such infiltration trench and pervious pavement will have to be considered.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.2179-2183
• /
• 2009

As urbanization is progressed, the network for distributing water in a basin become complex due to the spatial expansion and parameter uncertainties of water supply systems. When a long range water supply plan is determined, the total construction and operation cost has to be evaluated with the system components and parameter uncertainties as many as possible. In this paper, the robust optimization approach of Bertsimas and Sim is applied in a hypothetical system to find a solution which remains feasible under the possible parameter uncertainties having the correlation effect between the uncertain coefficients. The system components to supply, treatment, and transport water are included in the developed water supply system and construction and expansion of the system is allowed for a long-range period. In this approach, the tradeoff between system robustness and total cost of the system is evaluated in terms of the degree of conservatism which can be converted to the probability of constraint violation. As a result, the degree of conservatism increases, the total cost is increased due to the installation of large capacity of treatment and transportation systems. The applied robust optimization technique can be used to determine a long-range water supply plan with the consideration of system failure.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2146-2156
• /
• 2017

When a failure occurs in active distribution system, it will be isolated through the action of circuit breakers and sectionalizing switches. As a result, the network might be divided into several connected components, in which distributed generations could supply power for customers. Aimed at decreasing customer interruption cost, this paper proposes a theoretically optimal island partition model for such connected components, and a simplified but more practical model is also derived. The model aims to calculate a dynamic island partition schedule during the failure recovery time period, instead of a static islanding status. Fluctuation and stochastic characteristics of the renewable distributed generations and loads are considered, and the interruption cost functions of the loads are fitted. To solve the optimization model, a heuristic search algorithm based on the hill climbing method is proposed. The effectiveness of the proposed model and algorithm is evaluated by comparing with an existing static island partitioning model and intelligent algorithms, respectively.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.5
• /
• pp.991-1001
• /
• 2013

Instead of building new substations or transmission lines, proper installation of flexible AC transmission systems (FACTS) devices can make the transmission networks accommodate more power transfers with less expansion cost. In this paper, the problem to maximize power system loadability by optimally installing two types of FACTS devices, namely static var compensator (SVC) and thyristor controlled series compensator (TCSC), is formulated as a mixed discrete-continuous nonlinear optimization problem (MDCP). To reduce the complexity of the problem, the locations suitable for SVC and TCSC installations are first investigated with tangent vector technique and real power flow performance index (PI) sensitivity factor and, with the specified locations for SVC and TCSC installations, a set of schemes is formed. For each scheme with the specific locations for SVC and TCSC installations, the MDCP is reduced to a continuous nonlinear optimization problem and the computing efficiency can be largely improved. Finally, to cope with the technical and economic concerns simultaneously, the scheme with the biggest utilization index value is recommended. The IEEE-14 bus system and a practical power system are used to validate the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.13-29
• /
• 1997

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.
ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.52-59
• /
• 2010

MAC frame aggregation is a method that combines multiple MPDUs (MAC protocol data units) into one PPDU (PHY protocol data units) to enhance network performance at the MAC layer. In ad hoc networks, TCP underperforms due to the congestion window overshooting problem and thus by setting CWL (congestion window limit) TCP performance can be improved. In this paper, we investigate the problem of setting CWL for TCP performance optimization in ad hoc networks with MAC frame aggregation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.660-665
• /
• 2004

In this study, a new architecture and comprehensive design methodology of genetically optimized Multi-layer Fuzzy Neural Networks (gMFNN) are introduced and a series of numeric experiments are carried out. The gMFNN architecture results from a synergistic usage of the hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). FNN contributes to the formation of the premise part of the overall network structure of the gMFNN. The consequence part of the gMFNN is designed using PNN. The optimization of the FNN is realized with the aid of a standard back-propagation learning algorithm and genetic optimization. The development of the PNN dwells on the extended Group Method of Data Handling (GMDH) method and Genetic Algorithms (GAs). To evaluate the performance of the gMFNN, the models are experimented with the use of a numerical example.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.367-376
• /
• 2005

The smooth handoff supported by the route optimization extension to the mobile IP standard protocol should support a packet buffering mechanism at the base station (BS), in order to reduce the degradation in TCP performance caused by packet losses within mobile network environments. The purpose of packet buffering at the BS is to recover the packets dropped during intersubnetwork handoff by forwarding the packets buffered at the previous BS to the new BS. However, when the mobile host moves to a congested BS within a new foreign subnetwork, the buffered packets forwarded by the previous BS are likely to be dropped. This subsequently causes global synchronization to occur, resulting in the degradation of the wireless link in the congested BS, due to the increased congestion caused by the forwarded burst packets. Thus, in this paper, we propose an implicit priority forwarding (IPF) packet buffering scheme as a solution to this problem within mobile IP based networks. In the proposed IPF method, the previous BS implicitly marks the priority packets being used for inter-subnetwork handoff. Moreover, the proposed modified random early detection (M-RED) buffer at the new congested BS guarantees some degree of reliability to the priority packets. The simulation results show that the proposed IPF packet buffering scheme increases the wireless link utilization and, thus, it enhances the TCP throughput performance in the context of various intersubnetwork handoff cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2670-2685
• /
• 2020

Flying ad-hoc networks (FANETs) is a vibrant research area nowadays. This type of network ranges from various military and civilian applications. FANET is formed by micro and macro UAVs. Among many other problems, there are two main issues in FANET. Limited energy and high mobility of FANET nodes effect the flight time and routing directly. Clustering is a remedy to handle these types of problems. In this paper, an efficient clustering technique is proposed to handle routing and energy problems. Transmission range of FANET nodes is dynamically tuned accordingly as per their operational requirement. By optimizing the transmission range packet loss ratio (PLR) is minimized and link quality is improved which leads towards reduced energy consumption. To elect optimal cluster heads (CHs) based on their fitness we use k-means. Selection of optimal CHs reduce the routing overhead and improves energy consumption. Our proposed scheme outclasses the existing state-of-the-art techniques, ACO based CACONET and PSO based CLPSO, in terms of energy consumption and cluster building time.