Multi-objective Optimization Method for Distribution System Configuration using Pareto Optimal Solution

2008 ◽  
Vol 128 (10) ◽  
pp. 1208-1216 ◽  
Author(s):  
Yasuhiro Hayashi ◽  
Hirotaka Takano ◽  
Junya Matsuki ◽  
Yuji Nishikawa
Keyword(s):  
Distribution System ◽  
Optimal Solution ◽  
Optimization Method ◽  
Pareto Optimal Solution ◽  
Pareto Optimal ◽  
Multi Objective Optimization ◽  
System Configuration ◽  
Multi Objective

Multi-Objective Optimization Algorithm Design and Implementation of Mobile Base Station Site Selection

2010 ◽  
Vol 29-32 ◽  
pp. 2496-2502
Author(s):  
Min Wang ◽  
Jun Tang
Keyword(s):  
Site Selection ◽  
Engineering Application ◽  
Optimal Solution ◽  
Base Station ◽  
Pareto Optimal Solution ◽  
Antibody Concentration ◽  
Pareto Optimal ◽  
Memory Cells ◽  
Multi Objective Optimization ◽  
Multi Objective

The number of base station location impact the network quality of service. A new method is proposed based on immune genetic algorithm for site selection. The mathematical model of multi-objective optimization problem for base station selection and the realization of the process were given. The use of antibody concentration selection ensures the diversity of the antibody and avoiding the premature convergence, and the use of memory cells to store Pareto optimal solution of each generation. A exclusion algorithm of neighboring memory cells on the updating and deleting to ensure that the Pareto optimal solution set of the distribution. The experiments results show that the algorithm can effectively find a number of possible base station and provide a solution for the practical engineering application.

A Tradeoff-Based Interactive Multi-Objective Optimization Method Driven by Evolutionary Algorithms

2017 ◽  
Vol 21 (2) ◽  
pp. 284-292 ◽  
Author(s):  
Lu Chen ◽  
◽  
Bin Xin ◽  
Jie Chen ◽  
◽  
...  
Keyword(s):  
Evolutionary Algorithms ◽  
Optimal Solution ◽  
Optimization Method ◽  
Normal Vector ◽  
Pareto Optimal ◽  
Management Problem ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Tangent Hyperplane ◽  
Conflicting Objectives

Multi-objective optimization problems involve two or more conflicting objectives, and they have a set of Pareto optimal solutions instead of a single optimal solution. In order to support the decision maker (DM) to find his/her most preferred solution, we propose an interactive multi-objective optimization method based on the DM’s preferences in the form of indifference tradeoffs. The method combines evolutionary algorithms with the gradient-based interactive step tradeoff (GRIST) method. An evolutionary algorithm is used to generate an approximate Pareto optimal solution at each iteration. The DM is asked to provide indifference tradeoffs whose projection onto the tangent hyperplane of the Pareto front provides a tradeoff direction. An approach for approximating the normal vector of the tangent hyperplane is proposed which is used to calculate the projection. A water quality management problem is used to demonstrate the interaction process of the interactive method. In addition, three benchmark problems are used to test the accuracy of the normal vector approximation approach and compare the proposed method with GRIST.

scholarly journals Multi-Task Scheduling Based on Classification in Mobile Edge Computing

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 938 ◽  
Author(s):  
Xiao Zheng ◽  
Yuanfang Chen ◽  
Muhammad Alam ◽  
Jun Guo
Keyword(s):  
Task Scheduling ◽  
Upper Bound ◽  
Optimization Algorithms ◽  
Optimal Solution ◽  
Pareto Optimal Solution ◽  
Edge Computing ◽  
Pareto Optimal ◽  
Mobile Edge Computing ◽  
Multi Objective Optimization ◽  
Multi Objective

In this paper, a dynamic multi-task scheduling prototype is proposed to improve the limited resource utilization in the vehicular networks (VNET) assisted by mobile edge computing (MEC). To ensure quality of service (QoS) and meet the growing data demands, multi-task scheduling strategies should be specially constructed by considering vehicle mobility and hardware service constraints. We investigate the rational scheduling of multiple computing tasks to minimize the VNET loss. To avoid conflicts between tasks when the vehicle moves, we regard multi-task scheduling (MTS) as a multi-objective optimization (MOO) problem, and the whole goal is to find the Pareto optimal solution. Therefore, we develop some gradient-based multi-objective optimization algorithms. Those optimization algorithms are unable to deal with large-scale task scheduling because they become unscalable as the task number and gradient dimensions increase. We therefore further investigate an upper bound of the loss of multi-objective and prove that it can be optimized in an effective way. Moreover, we also reach the conclusion that, with practical assumptions, we can produce a Pareto optimal solution by upper bound optimization. Compared with the existing methods, the experimental results show that the accuracy is significantly improved.

Sign in / Sign up

Export Citation Format

Share Document