• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.398-406
• /
• 2011

In this paper, we introduce a new architecture of PSO-based Polynomial Neural Networks (PNN) and discuss its comprehensive design methodology. The conventional PNN is based on a extended Group Method of Data Handling (GMDH) method, and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons located in each layer through a growth process of the network. Moreover it does not guarantee that the conventional PNN generated through learning results in the optimal network architecture. The PSO-based PNN results in a structurally optimized structure and comes with a higher level of flexibility that the one encountered in the conventional PNN. The PSO-based design procedure being applied at each layer of PNN leads to the selection of preferred PNs with specific local characteristics (such as the number of input variables, input variables, and the order of the polynomial) available within the PNN. In the sequel, two general optimization mechanisms of the PSO-based PNN are explored: the structural optimization is realized via PSO whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the PSO-based PNN, the model is experimented with using Gas furnace process data, and pH neutralization process data. For the characteristic analysis of the given entire data with non-linearity and the construction of efficient model, the given entire system data is partitioned into two type such as Division I(Training dataset and Testing dataset) and Division II(Training dataset, Validation dataset, and Testing dataset). A comparative analysis shows that the proposed PSO-based PNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.1-10
• /
• 2002

Multidisciplinary Design Optimization (MDO) is a new design approach, which aims to reduce the design cycle and the development cost, while improving the performance of the product. In order to develop a framework software where the multidisciplinary design is possible, several methods about the analysis codes integration, the analysis and optimization process management, and the software architecture, are proposed in this study. Centralized DataBase Management System (DBMS) is adopted. Both the Dynamic Link Library(DLL) and the File Interface are suggested and implemented as analysis codes integration methods. To efficiently manage the optimization process and the data flow, the Graphic Programming approach is introduced. The proposed integration methods are verified by two test case examples: Simple house design example and the aircraft wing design problem using three dimensional Panel Code.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.26-31
• /
• 2017

When mobile navigator device accesses data randomly, the cache memory performance is rapidly deteriorated due to low memory access locality. For instance, GPS (General Positioning System) of navigator program for automobiles or drones, that are currently in common use, uses data from 32 satellites and computes current position of a receiver. This computation of positioning is the major part of GPS which accounts more than 50% computation in the program. In this computation task, the satellite signals are received in real time and stored in buffer memories. At this task, since necessary data cannot be sequentially stored, the data is read and used at random. This data accessing patterns are generated randomly, thus, memory system performance is worse by low data locality. As a result, it is difficult to process data in real time due to low data localization. Improving the low memory access locality inherited on the algorithms of conventional communication applications requires a certain optimization technique to solve this problem. In this study, we try to do optimizations with data and memory to improve the locality problem. In experiment, we show that our case study can improve processing speed of core computation and improve our overall system performance by 14%.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.460-477
• /
• 2020

As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.

• Journal of Distribution Science
• /
• v.15 no.2
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.656-657
• /
• 2015

Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.561-572
• /
• 2007

In this paper, we describe various efficient optimization algorithms for obtaining an optimal customer allocation in the telephone call center. The main advantages of the proposed algorithms are simple, fast and very attractive for massive dataset. The proposed algorithms also provide comparable performance with the other more sophisticated linear programming methods. The proposed optimal allocation algorithms increase the customer contact, response rate and management product and optimize the performance of call centers. Simulation results are given to demonstrate the effectiveness of our algorithms.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.44 no.7
• /
• pp.1-13
• /
• 2002

Two global optimization methods, the SCE-UA method and the Annealing-simplex (A-S) method for calibrating a daily rainfall-runoff model, a Tank model, was compared with that of the Downhill Simplex method. The performance of the four objective functions, DRMS (daily root mean square), HMLE (heteroscedastic maximum likelihood estimator), ABSERR (mean absolute error), and NS (Nash-Sutcliffe measure), was tested and synthetic data and historical data were used. In synthetic data study. 100% success rates for all objective functions were obtained from the A-S method, and the SCE-UA method was also consistently able to obtain good estimates. The downhill simplex method was unable to escape from local optimum, the worst among the methods, and converged to the true values only when the initial guess was close to the true values. In the historical data study, the A-S method and the SCE-UA method showed consistently good results regardless of objective function. An objective function was developed with combination of DRMS and NS, which putted more weight on the low flows.

• The Journal of Asian Finance, Economics and Business
• /
• v.2 no.2
• /
• pp.13-18
• /
• 2015

In this paper the DRC model is presented for solving multi objective problem. The proposed model is a combination of data envelopment analysis, Cuckoo algorithm and the response surface method. Due to reasons like costs, time and irreversible damages, it is not possible to analyze each and every one of the proposed models in practice, so the simulation is used. Since the number of experiments for simulation process is high then the optimization has gone to practice and directs the simulation process. The response surface method is used as one of the approaches of simulation optimization. Furthermore, data envelopment analysis is used to consider several response surfaces as efficiency response surface. Then this efficiency response surface is solved by Cuckoo algorithms. The main advantage of DRC model is to make one efficiency response surface function instate of multi surface function for every output and also using the advantages of Cuckoo algorithms. In order to demonstrate the effectiveness of the proposed approach, the branches of Refah bank in Mashhad is analyzed and the results are presented.