• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4329-4348
• /
• 2019

Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• Herbal Formula Science
• /
• v.21 no.2
• /
• pp.121-132
• /
• 2013

Objectives : The objectives of this study is to establish data-base to find out similar herbal formulas with a particular herbal formula by comparing composition ratio of configuring herbs. And this thesis is to analyze differences of prescriptions and find out similar prescriptions by utilizing galenical mass ratio, which is directly related to effectiveness of galenical. Methods : This study was proceeded by using Access 2007 with Window 7(MS) and 2,787 prescriptions of which herbal configuration could be indicated by weight unit were analysed from Donguibogam. We standardize all units of the prescription and input the mass ratio data when entered galenical data. Results : We could confirm a degree of similarity between compared prescriptions and a particular prescription according to the sum of differences of herb weight ratio and similarity ratio. Conclusions : A most similar herbal formula could be searched through comparing multi prescriptions by multi prescriptions of herbal configuration from established herbal formula data-base where herb weight ratio of prescriptions is to be input.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.5
• /
• pp.118-125
• /
• 2003

This paper presents a scheme for the placement of dispersed generator systems(DGs) based on load model in unbalanced systems. Groups of each individual load model consist of residential, industrial, commercial, official and agricultural load The main idea of solving fuzzy goal programming is to transform the original objective function and constraints into the equivalent multi-objectives functions with fuzzy sets to evaluate their imprecise nature for the criterion of power loss minimization, the number or total capacity of DGs and the bus voltage deviation, and then solve the problem using genetic algorithm The method proposed is applied to IEEE 13 bus unbalanced distribution systems to demonstrate its effectiveness.

• Journal of Korean Society for Atmospheric Environment
• /
• v.23 no.5
• /
• pp.526-538
• /
• 2007

Since air quality monitoring data sets are important base for developing of air quality management strategies including policy making and policy performance assessment, the environmental protection authorities need to organize and operate monitoring network properly. Air quality monitoring network of Busan, consisting of 18 stations, was allocated under unscientific and irrational principles. Thus the current state of air quality monitoring networks was reassessed the effect and appropriateness of monitoring objectives such as population protection and sources surveillance. In the process of the reassessment, a GIS-based decision support system was constructed and used to simulate air quality over complex terrain and to conduct optimization analysis for air quality monitoring network with multi-objective. The maximization of protection capability for population appears to be the most effective and principal objective among various objectives. The relocation of current monitoring stations through optimization analysis of multi-objective appears to be better than the network building for maximization of population protection capability. The decision support system developed in this study on the basis of GIS-based database appear to be useful for the environmental protection authorities to plan and manage air quality monitoring network over complex terrain.

• Membrane and Water Treatment
• /
• v.1 no.1
• /
• pp.61-74
• /
• 2010

This paper will integrate models at different levels (from filtration, backwashing to chemical cleaning and membrane lifetime) that can be used to minimize overall operating costs of a dead-end ultra filtration process that is used for the purification of surface water. Integration of the models leads to a multi-level optimization problem (at different levels different objectives should be reached). This problem is solved as a MINLP. Systematic modelling and optimization of membrane systems is not extensively discussed in the scientific literature. In this paper the first steps are taken in the formulation of proper models and the use of systems engineering tools to come to real optimal operating conditions. The optimized variables are used to calculate fouling profiles which can subsequently be used as inputs for a control system that actually enforces the profiles to a real pilot plant.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.984-993
• /
• 1992

Fuzzy L.P. with Multi-criteria function is adopted in this VAR planning algorithm to accomplish the optimization of comflicting objectives, such as the amount of the VAR installed and power system loss, while keeping the bus voltage profile within an admissible range. Fuzzy L.P. with Multi-criteria function, a powerful tool dealing with the fuzziness of satisfaction levels of the constraints and the goal of objective functions, enables us to search for the solutions which may contribute in VAR planning. This advantage is not provided by traditional standardized L.P. The effectiveness of the proposed algorithm has been verified by the test on the IEEE-30 bus system.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.233-235
• /
• 2000

SVC(Static Var Compensator) is commonly installed with conventional mechanically switched existing reactor or capacitor banks for wide range voltage control. The frequencies of switching of external banks have a great impact on the quality of voltage, but is limited since the life time of the external banks depends severely on the number of switching. So it is a complete multi-objective nonlinear optimization problem with conflicting objectives. This paper presents a method to determine the optimal coordination of SVC and external banks using genetic algorithm based on the multi-objective criteria. Optimal dead band and delay time of external banks is sought for reliable and efficient operation

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

This paper presents a rank-constrained linear matrix inequality (LMI) approach to the design of a multi-objective controller such as $H_2/H_{\infty}$ control. Multi-objective control is formulated as an LMI optimization problem with a nonconvex rank condition, which is imposed on the controller gain matirx not Lyapunov matrices. With this rank-constrained formulation, we can expect to reduce conservatism because we can use separate Lyapunov matrices for different control objectives. An iterative penalty method is applied to solve this rank-constrained LMI optimization problem. Numerical experiments are performed to illustrate the proposed method.

• IE interfaces
• /
• v.21 no.2
• /
• pp.170-176
• /
• 2008

Consider a multi-floor facility with multiple rooms of unequal size on each floor. Students come from many organizations to attend the conference to be held at this facility. In assigning the rooms to the students, several constraints must be met; such as boys and girls must not be assigned to the rooms on the same floor. Given the capacity of each room and the number of students from each organization, the problem is assigning students to rooms under a set of constraints and various objectives. We present six models with different objective functions; and formulate them as binary integer programming problems. A numerical example and a case study follow to illustrate the proposed models.