scholarly journals Multiobjective Particle Swarm Optimization Based on PAM and Uniform Design

2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Xiaoshu Zhu ◽  
Jie Zhang ◽  
Junhong Feng
Keyword(s):  
Particle Swarm Optimization ◽  
Clustering Algorithm ◽  
Uniform Design ◽  
Particle Swarm ◽  
Test Problems ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

In MOPSO (multiobjective particle swarm optimization), to maintain or increase the diversity of the swarm and help an algorithm to jump out of the local optimal solution, PAM (Partitioning Around Medoid) clustering algorithm and uniform design are respectively introduced to maintain the diversity of Pareto optimal solutions and the uniformity of the selected Pareto optimal solutions. In this paper, a novel algorithm, the multiobjective particle swarm optimization based on PAM and uniform design, is proposed. The differences between the proposed algorithm and the others lie in that PAM and uniform design are firstly introduced to MOPSO. The experimental results performing on several test problems illustrate that the proposed algorithm is efficient.

scholarly journals The Biobjective Bike-Sharing Rebalancing Problem with Balance Intervals: A Multistart Multiobjective Particle Swarm Optimization Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Yongji Jia ◽  
Yuanyuan Xu ◽  
Dong Yang ◽  
Jia Li
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Mixed Integer ◽  
Variable Neighbourhood Search ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Bike Sharing

The bike-sharing system (BSS), as a sustainable way to deal with the “last mile” problem of mass transit systems, is increasingly popular in recent years. Despite its success, the BSS tends to suffer from the mismatch of bike supply and user demand. BSS operators have to transfer bikes from surplus stations to deficit stations to redistribute them among stations by means of trucks. In this paper, we deal with the bike-sharing rebalancing problem with balance intervals (BRP-BIs), which is a variant of the static bike-sharing rebalancing problem. In this problem, the equilibrium of station is characterized by a balance interval instead of a balance point in the literature. We formulate the BRP-BI as a biobjective mixed-integer programming model with the aim of determining both the minimum cost route for a single capacitated vehicle and the maximum average rebalance utility, an index for the balanced degree of station. Then, a multistart multiobjective particle swarm optimization (MS-MOPSO) algorithm is proposed to solve the model such that the Pareto optimal solutions can be derived. The proposed algorithm is extended with crossover operator and variable neighbourhood search to enhance its exploratory capability. Compared with Hybrid NSGA-II and MOPSO, the computational experimental results demonstrate that our MS-MOPSO can obtain Pareto optimal solutions with higher quality.

scholarly journals An Improved Particle Swarm Optimization for Solving Bilevel Multiobjective Programming Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Tao Zhang ◽  
Tiesong Hu ◽  
Yue Zheng ◽  
Xuning Guo
Keyword(s):  
Particle Swarm Optimization ◽  
Programming Problem ◽  
Multiobjective Programming ◽  
Particle Swarm ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Multiobjective Programming Problem

An improved particle swarm optimization (PSO) algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP). For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed for specific versions or based on specific assumptions. The BLMPP is transformed to solve multiobjective optimization problems in the upper level and the lower level interactively by an improved PSO. And a set of approximate Pareto optimal solutions for BLMPP is obtained using the elite strategy. This interactive procedure is repeated until the accurate Pareto optimal solutions of the original problem are found. Finally, some numerical examples are given to illustrate the feasibility of the proposed algorithm.

Comprehensive Optimization Management of Engineering Project Based on Multi-Objective Particle Swarm Optimization

2020 ◽  
Vol 13 ◽  
Author(s):  
Yong Xiang ◽  
Huidan Zheng ◽  
Wuwen Cao ◽  
Dong Gong ◽  
Jiazhen Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Traditional Management ◽  
Multi Objective ◽  
Management Objectives ◽  
Optimization Management

: As the construction industry becomes more sustainable in the future, such as green, ecology, and safety, the higher the requirements for the ultimate objectives of the project.The traditional management objectives of investment, duration, and quality can no longer meet the requirements of comprehensive optimization management. Therefore, from the perspective of the project owners, the work introduced the safety and environmental objectives based on traditional management objectives. The thesis analyzes the relationship between the objectives, and builds the equilibrium optimization model. Moreover, this thesis uses multi-objective particle swarm optimization (MOPSO) to solve the problem, and obtains a series of Pareto optimal solutions. Then, according to the specific requirements of project management and the use of the efficacy coefficient method, the best solution is selected from the Pareto optimal solutions. Finally, a Sichuan wind power project is taken as an example. The work used the MOPSO to run 1,000 trails, and calculate the mean and standard deviation. It verified the rationality of model and the practicability of MOPSO.

Multi-Reservoir Ecological Operation Using Multi-Objective Particle Swarm Optimization

2014 ◽  
Vol 641-642 ◽  
pp. 65-69 ◽  
Author(s):  
Wei Lin Liu ◽  
Li Na Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Water Resources ◽  
Particle Swarm ◽  
Main Stream ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
River Ecosystem ◽  
Swarm Optimization ◽  
Multi Objective

Traditional reservoir operation ignores ecological demands of rivers. This would probably lead to degradation of river ecosystem. In order to alleviate the influence of reservoirs on river ecosystem, multi-objective reservoir ecological operation was proposed from perspective of maintaining the river ecosystem health. Multi-objective mathematical model of multi-reservoir ecological operation was established. A multi-objective particle swarm optimization (MOPSO) algorithm was introduced to generate a set of Pareto-optimal solutions. In addition, to facilitate easy implementation for the reservoir operator, a simple but effective decision-making method was presented to choose the desired alternative from a set of Pareto-optimal solutions. Finally, the proposed approach was applied to the ecological operation of the reservoirs at the main stream of Xiuhe river in Poyang Lake basin in China. The results show that the proposed approach is able to offer many alternative policies for the water resources managers, and it is a viable alternative to solve multi-objective water resources and hydrology problems.

Solving Environmental/Economic Dispatch Problem

2010 ◽  
pp. 123-145
Author(s):  
M.A. Abido
Keyword(s):  
Environmental Economic ◽  
Economic Dispatch ◽  
Test System ◽  
Standard Test ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Nondominated Solutions ◽  
Multiobjective Particle Swarm Optimization

Multiobjective particle swarm optimization (MOPSO) technique for environmental/economic dispatch (EED) problem is proposed and presented in this work. The proposed MOPSO technique evolves a multiobjective version of PSO by proposing redefinition of global best and local best individuals in multiobjective optimization domain. The proposed MOPSO technique has been implemented to solve the EED problem with competing and non-commensurable cost and emission objectives. Several optimization runs of the proposed approach have been carried out on a standard test system. The results demonstrate the capabilities of the proposed MOPSO technique to generate a set of well-distributed Pareto-optimal solutions in one single run. The comparison with the different reported techniques demonstrates the superiority of the proposed MOPSO in terms of the diversity of the Pareto optimal solutions obtained. In addition, a quality measure to Pareto optimal solutions has been implemented where the results confirm the potential of the proposed MOPSO technique to solve the multiobjective EED problem and produce high quality nondominated solutions.

scholarly journals Performance evaluation of elitist-mutated multi-objective particle swarm optimization for integrated water resources management

2009 ◽  
Vol 11 (1) ◽  
pp. 79-88 ◽  
Author(s):  
M. Janga Reddy ◽  
D. Nagesh Kumar
Keyword(s):  
Decision Making ◽  
Particle Swarm Optimization ◽  
Resource Management ◽  
Water Resources ◽  
Water Resource Management ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multi Objective

Optimal allocation of water resources for various stakeholders often involves considerable complexity with several conflicting goals, which often leads to multi-objective optimization. In aid of effective decision-making to the water managers, apart from developing effective multi-objective mathematical models, there is a greater necessity of providing efficient Pareto optimal solutions to the real world problems. This study proposes a swarm-intelligence-based multi-objective technique, namely the elitist-mutated multi-objective particle swarm optimization technique (EM-MOPSO), for arriving at efficient Pareto optimal solutions to the multi-objective water resource management problems. The EM-MOPSO technique is applied to a case study of the multi-objective reservoir operation problem. The model performance is evaluated by comparing with results of a non-dominated sorting genetic algorithm (NSGA-II) model, and it is found that the EM-MOPSO method results in better performance. The developed method can be used as an effective aid for multi-objective decision-making in integrated water resource management.

An Improved Particle Swarm Optimization Algorithm for Dynamic Power Allocation Problem

2014 ◽  
Vol 687-691 ◽  
pp. 1380-1384
Author(s):  
Jian Jun Zhao ◽  
Wen Jie Zhao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Dynamic Environment ◽  
Particle Swarm ◽  
Case Based Reasoning ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Case Based

In this paper, we propose a fast multiobjective particle swarm optimization algorithm (called CBR-fMOPSO for short). In the algorithm, a case-based reasoning (CBR) technique is used to retrieve history optimization results and experts’ experience and add them into the population of multiobjective particle swarm optimization algorithm (MOPSO) in dynamic environment. The optimal solutions found by CBR-fMOPSO are used to mend the case library to improve the accuracy of solving based on CBR in next solving. The results from a suit of experiments in electric furnaces show that the proposed algorithm maintains good performances however the environment changes.

scholarly journals An Improved Multiobjective Particle Swarm Optimization Algorithm Using Minimum Distance of Point to Line

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Zhengwu Fan ◽  
Tie Wang ◽  
Zhi Cheng ◽  
Guoxing Li ◽  
Fengshou Gu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Minimum Distance ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Relative Displacement ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Rear Tire

In a multiobjective particle swarm optimization algorithm, selection of the global best particle for each particle of the population from a set of Pareto optimal solutions has a significant impact on the convergence and diversity of solutions, especially when optimizing problems with a large number of objectives. In this paper, a new method is introduced for selecting the global best particle, which is minimum distance of point to line multiobjective particle swarm optimization (MDPL-MOPSO). Using the basic concept of minimum distance of point to line and objective, the global best particle among archive members can be selected. Different test functions were used to test and compare MDPL-MOPSO with CD-MOPSO. The result shows that the convergence and diversity of MDPL-MOPSO are relatively better than CD-MOPSO. Finally, the proposed multiobjective particle swarm optimization algorithm is used for the Pareto optimal design of a five-degree-of-freedom vehicle vibration model, which resulted in numerous effective trade-offs among conflicting objectives, including seat acceleration, front tire velocity, rear tire velocity, relative displacement between sprung mass and front tire, and relative displacement between sprung mass and rear tire. The superiority of this work is demonstrated by comparing the obtained results with the literature.

scholarly journals Multi-objective clustering algorithm using particle swarm optimization with crowding distance (MCPSO-CD)

2020 ◽  
Vol 6 (1) ◽  
pp. 72
Author(s):  
Alwatben Batoul Rashed ◽  
Hazlina Hamdan ◽  
Nurfadhlina Mohd Sharef ◽  
Md Nasir Sulaiman ◽  
Razali Yaakob ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Clustering Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Solution Technique ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Crowding Distance

Clustering, an unsupervised method of grouping sets of data, is used as a solution technique in various fields to divide and restructure data to become more significant and transform them into more useful information. Generally, clustering is difficult and complex phenomenon, where the appropriate numbers of clusters are always unknown, comes with a large number of potential solutions, and as well the datasets are unsupervised. These problems can be addressed by the Multi-Objective Particle Swarm Optimization (MOPSO) approach, which is commonly used in addressing optimization problems. However, MOPSO algorithm produces a group of non-dominated solutions which make the selection of an “appropriate” Pareto optimal or non-dominated solution more difficult. According to the literature, crowding distance is one of the most efficient algorithms that was developed based on density measures to treat the problem of selection mechanism for archive updates. In an attempt to address this problem, the clustering-based method that utilizes crowding distance (CD) technique to balance the optimality of the objectives in Pareto optimal solution search is proposed. The approach is based on the dominance concept and crowding distances mechanism to guarantee survival of the best solution. Furthermore, we used the Pareto dominance concept after calculating the value of crowding degree for each solution. The proposed method was evaluated against five clustering approaches that have succeeded in optimization that comprises of K-means Clustering, MCPSO, IMCPSO, Spectral clustering, Birch, and average-link algorithms. The results of the evaluation show that the proposed approach exemplified the state-of-the-art method with significant differences in most of the datasets tested.

Sign in / Sign up

Export Citation Format

Share Document