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

In this work, Self-adaptive Differential Evolutionary (SaDE) algorithm is proposed to solve Optimal Location and Size of Capacitor (OLSC) problem in radial distribution networks. To obtain the SaDE algorithm, two improvements have been applied on control parameters of mutation and crossover operators. To expand the study, three load conditions have been considered, i.e., constant, varying and effective loads. Objective function is introduced for the load conditions. The annual cost is fitness of problem, in addition to this cost, CPU time, voltage profile, active power loss and total installed capacitor banks and their related costs have been used for comparisons. To confirm the ability of each improvements of SaDE, the improvements are studied both in separate and simultaneous conditions. To verify the effectiveness of the proposed algorithm, it is tested on IEEE 10-bus and 34-bus radial distribution networks and compared with other approaches.

• Journal of the Economic Geographical Society of Korea
• /
• v.14 no.2
• /
• pp.116-128
• /
• 2011

Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

• Journal of the Korean Institute of Gas
• /
• v.25 no.3
• /
• pp.53-58
• /
• 2021

The number of patients with cardiovascular diseases who experience an out-of-hospital cardiac arrest (OHCA) are increasing among young adults as well as the aged population. An automated external defibrillator (AED) is vital in improving survival rates of OHCA victims. Survival rates of OHCA were shown to decline exponentially in time to defibrillation, yet studies in Korea are uncommon that captures the properties of their survival rates in examining optimal locations of AEDs. In this study, we worked on the maximal gradual coverage location problem (MGCLP) with exponential decay coverage function to decide on their optimal locations. The exponential decay coverage function mitigates the drawback of over-estimating survival rates of OHCA patients. It is expected that a more sophisticated facility location problem will be developed to identify the "emergent" characteristics of pedestrians who responds to the OHCA occurrence by incorporating random pedestrian locations and movement through simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.41-50
• /
• 1989

This paper deals with the problem of space allocation of items within a warehouse. Recognizing the importance of weights associated with material handling, mathematical models are developed for two cases, out-and-back selection and storage retrieval interleaving. It is proved that the density order index rule we proposed generates an optimal solution for the first model. An example problem solved with the pairwise interchange method indicates that the rule is also fairly efficient for the second model. The proposed rule is compared with other assignment rules of warehouse space such as COI rule, space and popularity.

• The Journal of Information Systems
• /
• v.27 no.1
• /
• pp.89-110
• /
• 2018

Purpose There is much information in customer reviews, but finding key information in many texts is not easy. Business decision makers need a model to solve this problem. In this study we propose a multi-topic sentiment analysis approach using Latent Dirichlet Allocation (LDA) for user-generated contents (UGC). Design/methodology/approach In this paper, we collected a total of 104,039 hotel reviews in seven of the world's top tourist destinations from TripAdvisor (www.tripadvisor.com) and extracted 30 topics related to the hotel from all customer reviews using the LDA model. Six major dimensions (value, cleanliness, rooms, service, location, and sleep quality) were selected from the 30 extracted topics. To analyze data, we employed R language. Findings This study contributes to propose a lexicon-based sentiment analysis approach for the keywords-embedded sentences related to the six dimensions within a review. The performance of the proposed model was evaluated by comparing the sentiment analysis results of each topic with the real attribute ratings provided by the platform. The results show its outperformance, with a high ratio of accuracy and recall. Through our proposed model, it is expected to analyze the customers' sentiments over different topics for those reviews with an absence of the detailed attribute ratings.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.127-132
• /
• 2012

In the Seoul metropolitan bus network, it may be necessary for a bus passenger to pick up a parcel, which has been purchased through e-commerce, at his or her convenient bus stop on the way to home or office. The flow-capturing location-allocation model can be applied to select pickup points for such bus stops so that they maximize the captured passenger flows, where each passenger flow represents an origin-destination (O-D) pair of a passenger trip. In this paper, we propose a fast heuristic algorithm to select pickup points using a large O-D matrix, which has been extracted from five million transportation card transactions. The experimental results demonstrate the bus stops chosen as pickup points in terms of passenger flow and capture ratio, and illustrate the spatial distribution of the top 20 pickup points on a map.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.443-449
• /
• 2015

In this paper, we proposed Channel allocation scheme according to the user's location with IR. In VLC System, LED can generate various colors of light by controlling the mixing ratio of each individual RGB color element. Thus, each RGB channel will have a different signal power, and each channel will have different performance. This proposed system using Visible light(RGB) as way to transmit signals, it depends on the mixture RGB, which decided the color of light, moreover, each things determined their performance. However, if the signal were fixed allocated RGB to transmit such as the original system, the importance of the each signals a different occur the limit on the quality of signals. To solve this problem in this paper, according to the RGB mixture ratios analyze the performance for the LED, which analyzed based on allocating the signal by transmitting to improve the quality was about how researched. In addition, our proposed system is able to improve the performance of BER and satisfied the Qos to desire users.

• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.45-66
• /
• 2008

Refuse collection, one of important elements in reverse logistics, is an activity rendering recyclables or wastes and moving them to some points where further treatment is required. Among various decisions in the collection activity, we focus on network design, which is the problem of locating collection points as well as allocating refuses at demand points to collection points while satisfying the capacity restriction at each collection point. Here, the collection point is the place where recyclables or wastes near the point are gathered, and locating the collection points is done by selecting them from a given set of potential sites. The objective is to minimize the sum of fixed costs to open collection points and transportation costs to move refuses from demand points to collection points. An integer programming model is developed to represent the problem mathematically and due to the complexity of the problem, two types of heuristics, one with simultaneous and the others with separate location and allocation, are suggested. Computational experiments were done on test problems up to 500 potential sites, and the results are reported. In particular, some heuristics gave near optimal solutions for small-size test problems, i.e., 2% gaps in average from the optimal solution values.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1638-1654
• /
• 2018

The heterogeneous network (HetNet) has been one of the key technologies in Long Term Evolution-Advanced (LTE-A) with growing capacity and coverage demands. However, the introduction of femtocells has brought serious co-layer interference and cross-layer interference, which has been a major factor affecting system throughput. It is generally acknowledged that the resource allocation has significant impact on suppressing interference and improving the system performance. In this paper, we propose a hybrid-clustering algorithm based on the $Mat{\acute{e}}rn$ hard-core process (MHP) to restrain two kinds of co-channel interference in the HetNet. As the impracticality of the hexagonal grid model and the homogeneous Poisson point process model whose points distribute completely randomly to establish the system model. The HetNet model based on the MHP is adopted to satisfy the negative correlation distribution of base stations in this paper. Base on the system model, the spectrum sharing problem with restricted spectrum resources is further analyzed. On the basis of location information and the interference relation of base stations, a hybrid clustering method, which takes into accounts the fairness of two types of base stations is firstly proposed. Then, auction mechanism is discussed to achieve the spectrum sharing inside each cluster, avoiding the spectrum resource waste. Through combining the clustering theory and auction mechanism, the proposed novel algorithm can be applied to restrain the cross-layer interference and co-layer interference of HetNet, which has a high density of base stations. Simulation results show that spectral efficiency and system throughput increase to a certain degree.