Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: MULTI-OBJECTIVE OPTIMIZATION (MOPSO).
Статті в журналах з теми "MULTI-OBJECTIVE OPTIMIZATION (MOPSO)"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "MULTI-OBJECTIVE OPTIMIZATION (MOPSO)".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Trưởng, Nguyễn Huy, and Dinh-Nam Dao. "New hybrid between NSGA-III with multi-objective particle swarm optimization to multi-objective robust optimization design for Powertrain mount system of electric vehicles." Advances in Mechanical Engineering 12, no. 2 (February 2020): 168781402090425. http://dx.doi.org/10.1177/1687814020904253.
Повний текст джерелаАнотація:
In this study, a new methodology, hybrid NSGA-III with multi-objective particle swarm optimization (HNSGA-III&MOPSO), has been developed to design and achieve cost optimization of Powertrain mount system stiffness parameters. This problem is formalized as a multi-objective optimization problem involving six optimization objectives: mean square acceleration and mean square displacement of the Powertrain mount system. A hybrid HNSGA-III&MOPSO is proposed with the integration of multi-objective particle swarm optimization and a genetic algorithm (NSGA-III). Several benchmark functions are tested, and results reveal that the HNSGA-III&MOPSO is more efficient than the typical multi-objective particle swarm optimization, NSGA-III. Powertrain mount system stiffness parameter optimization with HNSGA-III&MOPSO is simulated, respectively. It proved the potential of the HNSGA-III&MOPSO for Powertrain mount system stiffness parameter optimization problem. The amplitude of the acceleration of the vehicle frame decreased by 22.8%, and the amplitude of the displacement of the vehicle frame reduced by 12.4% compared to the normal design case. The calculation time of the algorithm HNSGA-III&MOPSO is less than the algorithm NSGA-III, that is, 5 and 6 h, respectively, compared to the algorithm multi-objective particle swarm optimization.
2
Zeltni, Kamel, and Souham Meshoul. "Multi-Objective Cuckoo Search Under Multiple Archiving Strategies." International Journal of Computational Intelligence and Applications 15, no. 04 (December 2016): 1650020. http://dx.doi.org/10.1142/s1469026816500206.
Повний текст джерелаАнотація:
Cuckoo Search (CS) is a recent addition to the field of swarm-based metaheuristics. It has been shown to be an efficient approach for global optimization. Moreover, its application for solving Multi-objective Optimization (MOO) shows very promising results as well. In multi-objective context, a bounded archive is required to store the set of nondominated solutions. But, what is the best archiving strategy to use in order to maintain a bounded set with good characteristics is a critical issue that may lead to a questionable choice. In this work, the behavior of the developed multi-objective CS is studied under several archiving strategies. An extensive experimental study has been conducted using several test problems and two performance metrics related to convergence and diversity. A nonparametric test for statistical analysis is performed. In addition, we used a Multi-Objective Particle Swarm Optimization (MOPSO) for further analysis and comparison. The results revealed that archiving strategies play an important role as they can impact differently on the quality of obtained fronts depending on the problem’s characteristics. Also, this study confirms that the proposed MOCS algorithm is a very promising approach for MOPs compared to the widely used MOPSO.
3
Alabbadi, Afra A., and Maysoon F. Abulkhair. "Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing." Algorithms 14, no. 3 (February 27, 2021): 77. http://dx.doi.org/10.3390/a14030077.
Повний текст джерелаАнотація:
Recently, with the development of mobile devices and the crowdsourcing platform, spatial crowdsourcing (SC) has become more widespread. In SC, workers need to physically travel to complete spatial–temporal tasks during a certain period of time. The main problem in SC platforms is scheduling a set of proper workers to achieve a set of spatial tasks based on different objectives. In actuality, real-world applications of SC need to optimize multiple objectives together, and these objectives may sometimes conflict with one another. Furthermore, there is a lack of research dealing with the multi-objective optimization (MOO) problem within an SC environment. Thus, in this work we focused on task scheduling based on multi-objective optimization (TS-MOO) in SC, which is based on maximizing the number of completed tasks, minimizing the total travel costs, and ensuring the balance of the workload between workers. To solve the previous problem, we developed a new method, i.e., the multi-objective task scheduling optimization (MOTSO) model that consists of two algorithms, namely, the multi-objective particle swarm optimization (MOPSO) algorithm with our fitness function Alabbadi, et al. and the ranking strategy algorithm based on the task entropy concept and task execution duration. The main purpose of our ranking strategy is to improve and enhance the performance of our MOPSO. The primary goal of the proposed MOTSO model is to find an optimal solution based on the multiple objectives that conflict with one another. We conducted our experiment with both synthetic and real datasets; the experimental results and statistical analysis showed that our proposed model is effective in terms of maximizing the number of completed tasks, minimizing the total travel costs, and balancing the workload between workers.
4
Anh, Ho Pham Huy, and Cao Van Kien. "Optimal energy management of microgrid using advanced multi-objective particle swarm optimization." Engineering Computations 37, no. 6 (February 7, 2020): 2085–110. http://dx.doi.org/10.1108/ec-05-2019-0194.
Повний текст джерелаАнотація:
Purpose The purpose of this paper is to propose an optimal energy management (OEM) method using intelligent optimization techniques applied to implement an optimally hybrid heat and power isolated microgrid. The microgrid investigated combines renewable and conventional power generation. Design/methodology/approach Five bio-inspired optimization methods include an advanced proposed multi-objective particle swarm optimization (MOPSO) approach which is comparatively applied for OEM of the implemented microgrid with other bio-inspired optimization approaches via their comparative simulation results. Findings Optimal multi-objective solutions through Pareto front demonstrate that the advanced proposed MOPSO method performs quite better in comparison with other meta-heuristic optimization methods. Moreover, the proposed MOPSO is successfully applied to perform 24-h OEM microgrid. The simulation results also display the merits of the real time optimization along with the arbitrary of users’ selection as to satisfy their power requirement. Originality/value This paper focuses on the OEM of a designed microgrid using a newly proposed modified MOPSO algorithm. Optimal multi-objective solutions through Pareto front demonstrate that the advanced proposed MOPSO method performs quite better in comparison with other meta-heuristic optimization approaches.
5
Wang, Yule, Wanliang Wang, Ijaz Ahmad, and Elsayed Tag-Eldin. "Multi-Objective Quantum-Inspired Seagull Optimization Algorithm." Electronics 11, no. 12 (June 9, 2022): 1834. http://dx.doi.org/10.3390/electronics11121834.
Повний текст джерелаАнотація:
Objective solutions of multi-objective optimization problems (MOPs) are required to balance convergence and distribution to the Pareto front. This paper proposes a multi-objective quantum-inspired seagull optimization algorithm (MOQSOA) to optimize the convergence and distribution of solutions in multi-objective optimization problems. The proposed algorithm adopts opposite-based learning, the migration and attacking behavior of seagulls, grid ranking, and the superposition principles of quantum computing. To obtain a better initialized population in the absence of a priori knowledge, an opposite-based learning mechanism is used for initialization. The proposed algorithm uses nonlinear migration and attacking operation, simulating the behavior of seagulls for exploration and exploitation. Moreover, the real-coded quantum representation of the current optimal solution and quantum rotation gate are adopted to update the seagull population. In addition, a grid mechanism including global grid ranking and grid density ranking provides a criterion for leader selection and archive control. The experimental results of the IGD and Spacing metrics performed on ZDT, DTLZ, and UF test suites demonstrate the superiority of MOQSOA over NSGA-II, MOEA/D, MOPSO, IMMOEA, RVEA, and LMEA for enhancing the distribution and convergence performance of MOPs.
6
Thawkar, Shankar, Law Kumar Singh, and Munish Khanna. "Multi-objective techniques for feature selection and classification in digital mammography." Intelligent Decision Technologies 15, no. 1 (March 24, 2021): 115–25. http://dx.doi.org/10.3233/idt-200049.
Повний текст джерелаАнотація:
Feature selection is a crucial stage in the design of a computer-aided classification system for breast cancer diagnosis. The main objective of the proposed research design is to discover the use of multi-objective particle swarm optimization (MOPSO) and Nondominated sorting genetic algorithm-III (NSGA-III) for feature selection in digital mammography. The Pareto-optimal fronts generated by MOPSO and NSGA-III for two conflicting objective functions are used to select optimal features. An artificial neural network (ANN) is used to compute the fitness of objective functions. The importance of features selected by MOPSO and NSGA-III are assessed using artificial neural networks. The experimental results show that MOPSO based optimization is superior to NSGA-III. MOPSO achieves high accuracy with a 55% feature reduction. MOPSO based feature selection and classification deliver an efficiency of 97.54% with 98.22% sensitivity, 96.82% specificity, 0.9508 Cohen’s kappa coefficient, and area under curve AZ= 0.983 ± 0.003.
7
Chen, Shuming, Wenbo Zhu, and Yabing Cheng. "Multi-Objective Optimization of Acoustic Performances of Polyurethane Foam Composites." Polymers 10, no. 7 (July 18, 2018): 788. http://dx.doi.org/10.3390/polym10070788.
Повний текст джерелаАнотація:
Polyurethane (PU) foams are widely used as acoustic package materials to eliminate vehicle interior noise. Therefore, it is important to improve the acoustic performances of PU foams. In this paper, the grey relational analysis (GRA) method and multi-objective particle swarm optimization (MOPSO) algorithm are applied to improve the acoustic performances of PU foam composites. The average sound absorption coefficient and average transmission loss are set as optimization objectives. The hardness and content of Ethylene Propylene Diene Monomer (EPDM) and the content of deionized water and modified isocyanate (MDI) are selected as design variables. The optimization process of GRA method is based on the orthogonal arrays L9(34), and the MOPSO algorithm is based on the Response Surface (RS) surrogate model. The results show that the acoustic performances of PU foam composites can be improved by optimizing the synthetic formula. Meanwhile, the results that were obtained by GRA method show the degree of influence of the four design variables on the optimization objectives, and the results obtained by MOPSO algorithm show the specific effects of the four design variables on the optimization objectives. Moreover, according to the confirmation experiment, the optimal synthetic formula is obtained by MOPSO algorithm when the weight coefficient of the two objectives set as 0.5.
8
Mahmoud, Ali, and Xiaohui Yuan. "SHAPE OPTIMIZATION OF ROCKFILL DAM WITH RUBIK CUBE REPRODUCTION BASED MULTI-OBJECTIVE PARTICLE SWARM ALGORITHM." ASEAN Engineering Journal 11, no. 4 (November 25, 2021): 204–31. http://dx.doi.org/10.11113/aej.v11.18021.
Повний текст джерелаАнотація:
A rockfill dam's quality and its economic aspects are inextricably interwoven with each other. Approaching the optimal design of a rockfill dam paves the path to achieve the best quality with the fewest expenses. Choosing the Sardasht rockfill dam as a case study, two semi-empirical models are presented for seepage and safety factor. These two models, together with construction costs, were employed as three objective functions for the Sardasht rockfill dam's shape optimization. Optimization was handled using a robust multi-objective particle swarm optimization algorithm (RCR-MOPSO). A new reproducing method inspired by a Rubik's cube shape (RCR) and NSGA-III are building blocks of RCR-MOPSO. Three benchmark problems and two real-world problems were solved using RCR-MOPSO and compared with NSGA-III and MOPSO to ensure the performance of RCR-MOPSO. The solution quality and performance of RCR-MOPSO are significantly better than the original MOPSO and close to NSGA-III. Nevertheless, RCR-MOPSO recorded a 38% shorter runtime than NSGA-III. RCR-MOPSO presented a set of non-dominated solutions as final results for the Sardasht rockfill dam shape optimization. Due to the defined constraints, all solutions dominate the original design. Regarding the final results, compared with Sardasht dam's original design, the construction price was reduced by 31.12% on average, while seepage and safety factor improved by 15.84% and 27.78% on average, respectively.
9
Mouassa, Souhil, and Tarek Bouktir. "Multi-objective ant lion optimization algorithm to solve large-scale multi-objective optimal reactive power dispatch problem." COMPEL - The international journal for computation and mathematics in electrical and electronic engineering 38, no. 1 (January 7, 2019): 304–24. http://dx.doi.org/10.1108/compel-05-2018-0208.
Повний текст джерелаАнотація:
Purpose In the vast majority of published papers, the optimal reactive power dispatch (ORPD) problem is dealt as a single-objective optimization; however, optimization with a single objective is insufficient to achieve better operation performance of power systems. Multi-objective ORPD (MOORPD) aims to minimize simultaneously either the active power losses and voltage stability index, or the active power losses and the voltage deviation. The purpose of this paper is to propose multi-objective ant lion optimization (MOALO) algorithm to solve multi-objective ORPD problem considering large-scale power system in an effort to achieve a good performance with stable and secure operation of electric power systems. Design/methodology/approach A MOALO algorithm is presented and applied to solve the MOORPD problem. Fuzzy set theory was implemented to identify the best compromise solution from the set of the non-dominated solutions. A comparison with enhanced version of multi-objective particle swarm optimization (MOEPSO) algorithm and original (MOPSO) algorithm confirms the solutions. An in-depth analysis on the findings was conducted and the feasibility of solutions were fully verified and discussed. Findings Three test systems – the IEEE 30-bus, IEEE 57-bus and large-scale IEEE 300-bus – were used to examine the efficiency of the proposed algorithm. The findings obtained amply confirmed the superiority of the proposed approach over the multi-objective enhanced PSO and basic version of MOPSO. In addition to that, the algorithm is benefitted from good distributions of the non-dominated solutions and also guarantees the feasibility of solutions. Originality/value The proposed algorithm is applied to solve three versions of ORPD problem, active power losses, voltage deviation and voltage stability index, considering large -scale power system IEEE 300 bus.
10
Majumder, Arindam. "Optimization of Modern Manufacturing Processes Using Three Multi-Objective Evolutionary Algorithms." International Journal of Swarm Intelligence Research 12, no. 3 (July 2021): 96–124. http://dx.doi.org/10.4018/ijsir.2021070105.
Повний текст джерелаАнотація:
The optimization in manufacturing processes refers to the investigation of multiple responses simultaneously. Therefore, it becomes very necessary to introduce a technique that can solve the multiple response optimization problem efficiently. In this study, an attempt has been taken to find the application of three newly introduced multi-objective evolutionary algorithms, namely multi-objective dragonfly algorithm (MODA), multi-objective particle swarm optimization algorithm (MOPSO), and multi-objective teaching-learning-based optimization (MOTLBO), in the modern manufacturing processes. For this purpose, these algorithms are used to solve five instances of modern manufacturing process—CNC process, continuous drive friction welding process, EDM process, injection molding process, and friction stir welding process—during this study. The performance of these algorithms is measured using three parameters, namely coverage to two sets, spacing, and CPU time. The obtained experimental results initially reveal that MODA, MOPSO, and MOTLBO provide better solutions as compared to widely used nondominated sorting genetic algorithm II (NSGA-II). Moreover, this study also shows the superiority of MODA over MOPSO and MOTLBO while considering coverage to two sets and CPU time. Further, in terms of spacing a marginally inferior performance is observed in MODA as compared to MOPSO and MOTLBO.
11
Fan, Qin Man, and Qin Man Fan. "The Multi-Objective Optimization Design of Leaf Spring of few Piece Variable Cross-Section." Advanced Materials Research 213 (February 2011): 231–35. http://dx.doi.org/10.4028/www.scientific.net/amr.213.231.
Повний текст джерелаАнотація:
Being the ability of global optimization, MOPSO algorithm have some virtue such as high calculate velocity, good solution quality, great robustness, and so on. In allusion to a leaf spring of few piece variable cross-section, its multi-objective optimization mathematical model was built regarding minimum mass and minimum stiffness deviation as sub-objective functions. Taking the leaf spring of front suspension of a light truck as an example, the Pareto optimal solution set of optimization problem was obtained by using MOPSO algorithm. The optimization results show that the mass of the leaf spring reduced by 24.2% and the stiffness deviation is only 0.32% after optimization by using MOPSO algorithm.
12
Ouyang, Aijia, Kenli Li, Xiongwei Fei, Xu Zhou, and Mingxing Duan. "A Novel Hybrid Multi-Objective Population Migration Algorithm." International Journal of Pattern Recognition and Artificial Intelligence 29, no. 01 (January 4, 2015): 1559001. http://dx.doi.org/10.1142/s0218001415590016.
Повний текст джерелаАнотація:
This paper presents a multi-objective co-evolutionary population migration algorithm based on Good Point Set (GPSMCPMA) for multi-objective optimization problems (MOP) in view of the characteristics of MOPs. The algorithm introduces the theory of good point set (GPS) and dynamic mutation operator (DMO) and adopts the entire population co-evolutionary migration, based on the concept of Pareto nondomination and global best experience and guidance. The performance of the algorithm is tested through standard multi-objective functions. The experimental results show that the proposed algorithm performs much better in the convergence, diversity and solution distribution than SPEA2, NSGA-II, MOPSO and MOMASEA. It is a fast and robust multi-objective evolutionary algorithm (MOEA) and is applicable to other MOPs.
13
CHEN, LEI, and HAI-LIN LIU. "A REGION DECOMPOSITION-BASED MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION ALGORITHM." International Journal of Pattern Recognition and Artificial Intelligence 28, no. 08 (December 2014): 1459009. http://dx.doi.org/10.1142/s0218001414590095.
Повний текст джерелаАнотація:
In this paper, a novel multi-objective particle swarm optimization algorithm based on MOEA/D-M2M decomposition strategy (MOPSO-M2M) is proposed. MOPSO-M2M can decompose the objective space into a number of subregions and then search all the subregions using respective sub-swarms simultaneously. The M2M decomposition strategy has two very desirable properties with regard to MOPSO. First, it facilitates the determination of the global best (gbest) for each sub-swarm. A new global attraction strategy based on M2M decomposition framework is proposed to guide the flight of particles by setting an archive set which is used to store the historical best solutions found by the swarm. When we determine the gbest for each particle, the archive set is decomposed and associated with each sub-swarm. Therefore, every sub-swarm has its own archive subset and the gbest of the particle in a sub-swarm is selected randomly in its archive subset. The new global attraction strategy yields a more reasonable gbest selection mechanism, which can be more effective to guide the particles to the Pareto Front (PF). This strategy can ensure that each sub-swarm searches its own subregion so as to improve the search efficiency. Second, it has a good ability to maintain the diversity of the population which is desirable in multi-objective optimization. Additionally, MOPSO-M2M applies the Tchebycheff approach to determine the personal best position (pbest) and no additional clustering or niching technique is needed in this algorithm. In order to demonstrate the performance of the proposed algorithm, we compare it with two other algorithms: MOPSO and DMS-MO-PSO. The experimental results indicate the validity of this method.
14
Chen, Taowei, Yiming Yu, and Kun Zhao. "A Multi-objective Particle Swarm Optimization Based on P System Theory." MATEC Web of Conferences 232 (2018): 03039. http://dx.doi.org/10.1051/matecconf/201823203039.
Повний текст джерелаАнотація:
Particle swarm optimization(PSO) algorithm has been widely applied in solving multi-objective optimization problems(MOPs) since it was proposed. However, PSO algorithms updated the velocity of each particle using a single search strategy, which may be difficult to obtain approximate Pareto front for complex MOPs. In this paper, inspired by the theory of P system, a multi-objective particle swarm optimization (PSO) algorithm based on the framework of membrane system(PMOPSO) is proposed to solve MOPs. According to the hierarchical structure, objects and rules of P system, the PSO approach is used in elementary membranes to execute multiple search strategy. And non-dominated sorting and crowding distance is used in skin membrane for improving speed of convergence and maintaining population diversity by evolutionary rules. Compared with other multi-objective optimization algorithm including MOPSO, dMOPSO, SMPSO, MMOPSO, MOEA/D, SPEA2, PESA2, NSGAII on a benchmark series function, the experimental results indicate that the proposed algorithm is not only feasible and effective but also have a better convergence to true Pareto front.
15
Ünal, Ali Nadi, and Gülgün Kayakutlu. "Multi-objective particle swarm optimization with random immigrants." Complex & Intelligent Systems 6, no. 3 (June 12, 2020): 635–50. http://dx.doi.org/10.1007/s40747-020-00159-y.
Повний текст джерелаАнотація:
Abstract Complex problems of the current business world need new approaches and new computational algorithms for solution. Majority of the issues need analysis from different angles, and hence, multi-objective solutions are more widely used. One of the recently well-accepted computational algorithms is Multi-objective Particle Swarm Optimization (MOPSO). This is an easily implemented and high time performance nature-inspired approach; however, the best solutions are not found for archiving, solution updating, and fast convergence problems faced in certain cases. This study investigates the previously proposed solutions for creating diversity in using MOPSO and proposes using random immigrants approach. Application of the proposed solution is tested in four different sets using Generational Distance, Spacing, Error Ratio, and Run Time performance measures. The achieved results are statistically tested against mutation-based diversity for all four performance metrics. Advantages of this new approach will support the metaheuristic researchers.
16
Karimi, Mohammad, Maryam Miriestahbanati, Hamed Esmaeeli, and Ciprian Alecsandru. "Multi-Objective Stochastic Optimization Algorithms to Calibrate Microsimulation Models." Transportation Research Record: Journal of the Transportation Research Board 2673, no. 4 (March 29, 2019): 743–52. http://dx.doi.org/10.1177/0361198119838260.
Повний текст джерелаАнотація:
The calibration process for microscopic models can be automatically undertaken using optimization algorithms. Because of the random nature of this problem, the corresponding objectives are not simple concave functions. Accordingly, such problems cannot easily be solved unless a stochastic optimization algorithm is used. In this study, two different objectives are proposed such that the simulation model reproduces real-world traffic more accurately, both in relation to longitudinal and lateral movements. When several objectives are defined for an optimization problem, one solution method may aggregate the objectives into a single-objective function by assigning weighting coefficients to each objective before running the algorithm (also known as an a priori method). However, this method does not capture the information exchange among the solutions during the calibration process, and may fail to minimize all the objectives at the same time. To address this limitation, an a posteriori method (multi-objective particle swarm optimization, MOPSO) is employed to calibrate a microscopic simulation model in one single step while minimizing the objectives functions simultaneously. A set of traffic data collected by video surveillance is used to simulate a real-world highway in VISSIM. The performance of the a posteriori-based MOPSO in the calibration process is compared with a priori-based optimization methods such as particle swarm optimization, genetic algorithm, and whale optimization algorithm. The optimization methodologies are implemented in MATLAB and connected to VISSIM using its COM interface. Based on the validation results, the a posteriori-based MOPSO leads to the most accurate solutions among the tested algorithms with respect to both objectives.
17
Yao, Zhi Hui, and Min Zhou. "Applying Multi-Objective Particle Swarm Optimization to Maintenance Scheduling for CNC Machine Tools." Applied Mechanics and Materials 721 (December 2014): 144–48. http://dx.doi.org/10.4028/www.scientific.net/amm.721.144.
Повний текст джерелаАнотація:
This paper focuses on the maintenance scheduling for CNC machine tools. A bi-objective mathematical model is built with the repair time and maintenance cost. A multi-objective particle swarm optimization (MOPSO), which combines the global best position adaptive selection and local search, is proposed to solve the mathematical model. The results show that MOPSO has a better performance than other method for solving the maintenance scheduling. They also show that MOPSO is an effective algorithm that has strong convergence.
18
Chen, Fei, Yanmin Liu, Jie Yang, Meilan Yang, Qian Zhang, and Jun Liu. "Multi-objective particle swarm optimization with reverse multi-leaders." Mathematical Biosciences and Engineering 20, no. 7 (2023): 11732–62. http://dx.doi.org/10.3934/mbe.2023522.
Повний текст джерелаАнотація:
<abstract> <p>Despite being easy to implement and having fast convergence speed, balancing the convergence and diversity of multi-objective particle swarm optimization (MOPSO) needs to be further improved. A multi-objective particle swarm optimization with reverse multi-leaders (RMMOPSO) is proposed as a solution to the aforementioned issue. First, the convergence strategy of global ranking and the diversity strategy of mean angular distance are proposed, which are used to update the convergence archive and the diversity archive, respectively, to improve the convergence and diversity of solutions in the archives. Second, a reverse selection method is proposed to select two global leaders for the particles in the population. This is conducive to selecting appropriate learning samples for each particle and leading the particles to quickly fly to the true Pareto front. Third, an information fusion strategy is proposed to update the personal best, to improve convergence of the algorithm. At the same time, in order to achieve a better balance between convergence and diversity, a new particle velocity updating method is proposed. With this, two global leaders cooperate to guide the flight of particles in the population, which is conducive to promoting the exchange of social information. Finally, RMMOPSO is simulated with several state-of-the-art MOPSOs and multi-objective evolutionary algorithms (MOEAs) on 22 benchmark problems. The experimental results show that RMMOPSO has better comprehensive performance.</p> </abstract>
19
Singh, Dhirendra Pratap. "Optimization of Electric Discharge Machining of Al/Al2O3 Metal Matrix Composites using MOPSO." International Journal of Engineering Research in Mechanical and Civil Engineering (IJERMCE) 9, no. 5 (May 18, 2022): 39–47. http://dx.doi.org/10.36647/ijermce/09.05.a007.
Повний текст джерелаАнотація:
In this article, Response Surface Methodology (RSM) and Multi-objective Particle Swarm Optimization (MOPSO) were used to optimize the output response of Material Removal Rate (MRR) and Surface Roughness(SR) of die-sinking Electrical discharge machining (EDM). An aluminum based metal matrix composites, reinforced with alumina, prepared by stir casting, was used for machining on EDM by Copper (Cu) and Titanium (Ti) tool. Box- Behnken Design (BBD) approach of RSM was used to design the experiment by considering four input factors at three levels. This developed model for multi-objective optimization by MOPSO and an RSM-based multi-objective optimization was also designed for input parameters. And it was found that the MOPSO technique was easy and valuable for parametric optimization of EDM. From MOPSO, optimized input parameters for machining of AMMC using Cu tool are current 4A, Voltage 60V, pulse on-time 100 µs, and duty factor 6. From MOPSO, optimized input parameters for machining of AMMC using Ti tool are current 4.241658A, Voltage 60V, pulse on-time 100 µs, and duty factor 4. The confirmatory test found that MRR and SR decreased by 63.86 % and 53.083% for the Cu tool, respectively, for MOPSO compared to RSM optimize value.
20
Shang, Junliang, Yiting Li, Yan Sun, Feng Li, Yuanyuan Zhang, and Jin-Xing Liu. "MOPIO: A Multi-Objective Pigeon-Inspired Optimization Algorithm for Community Detection." Symmetry 13, no. 1 (December 30, 2020): 49. http://dx.doi.org/10.3390/sym13010049.
Повний текст джерелаАнотація:
Community detection is a hot research direction of network science, which is of great importance to complex system analysis. Therefore, many community detection methods have been developed. Among them, evolutionary computation based ones with a single-objective function are promising in either benchmark or real data sets. However, they also encounter resolution limit problem in several scenarios. In this paper, a Multi-Objective Pigeon-Inspired Optimization (MOPIO) method is proposed for community detection with Negative Ratio Association (NRA) and Ratio Cut (RC) as its objective functions. In MOPIO, the genetic operator is used to redefine the representation and updating of pigeons. In each iteration, NRA and RC are calculated for each pigeon, and Pareto sorting scheme is utilized to judge non-dominated solutions for later crossover. A crossover strategy based on global and personal bests is designed, in which a compensation coefficient is developed to stably complete the work transition between the map and compass operator, and the landmark operator. When termination criteria were met, a leader selection strategy is employed to determine the final result from the optimal solution set. Comparison experiments of MOPIO, with MOPSO, MOGA-Net, Meme-Net and FN, are performed on real-world networks, and results indicate that MOPIO has better performance in terms of Normalized Mutual information and Adjusted Rand Index.
21
Welhazi, Yosra, Tawfik Guesmi, and Hsan Hadj Abdallah. "Eigenvalue Assignments in Multimachine Power Systems using Multi-Objective PSO Algorithm." International Journal of Energy Optimization and Engineering 4, no. 3 (July 2015): 33–48. http://dx.doi.org/10.4018/ijeoe.2015070103.
Повний текст джерелаАнотація:
Applying multi-objective particle swarm optimization (MOPSO) algorithm to multi-objective design of multimachine power system stabilizers (PSSs) is presented in this paper. The proposed approach is based on MOPSO algorithm to search for optimal parameter settings of PSS for a wide range of operating conditions. Moreover, a fuzzy set theory is developed to extract the best compromise solution. The stabilizers are selected using MOPSO to shift the lightly damped and undamped electromechanical modes to a prescribed zone in the s-plane. The problem of tuning the stabilizer parameters is converted to an optimization problem with eigenvalue-based multi-objective function. The performance of the proposed approach is investigated for a three-machine nine-bus system under different operating conditions. The effectiveness of the proposed approach in damping the electromechanical modes and enhancing greatly the dynamic stability is confirmed through eigenvalue analysis, nonlinear simulation results and some performance indices over a wide range of loading conditions.
22
Pieprzycki, Adam, and Wiesław Ludwin. "Selected issues of multi-objective WLAN planning." Science, Technology and Innovation 3, no. 2 (December 27, 2018): 69–78. http://dx.doi.org/10.5604/01.3001.0012.8170.
Повний текст джерелаАнотація:
The aim of the article is to apply a multicriteria approach to MOO (Multi Objective Optimization) planning for WLAN (Wireless Local Area Network) using selected swarm optimization methods. For this purpose, in the process of searching for the extremum of two criterion functions, which are an optimization index, two swarm algorithms were used: MOCS (Multi Objective Cuckoo Search) and MOPSO (Multi Objective Particle Swarm Optimization). The results were compared with the single-criterion SOO (Single Objective Optimization) range-based network planning based on the regular distribution of TP (test point) using the CS Cuckoo Search algorithm.
23
Reddy, M. Janga, and D. Nagesh Kumar. "Performance evaluation of elitist-mutated multi-objective particle swarm optimization for integrated water resources management." Journal of Hydroinformatics 11, no. 1 (January 1, 2009): 79–88. http://dx.doi.org/10.2166/hydro.2009.042.
Повний текст джерелаАнотація:
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.
24
Leng, Rui, Aijia Ouyang, Yanmin Liu, Lian Yuan, and Zongyue Wu. "A Multi-Objective Particle Swarm Optimization Based on Grid Distance." International Journal of Pattern Recognition and Artificial Intelligence 34, no. 03 (July 30, 2019): 2059008. http://dx.doi.org/10.1142/s0218001420590089.
Повний текст джерелаАнотація:
In modern intelligent algorithms and real-industrial applications, there are many fields involving multi-objective particle swarm optimization algorithms, but the conflict between each objective in the optimization process will easily lead to the algorithm falling into local optimal. In order to prevent the algorithm from quickly falling into local optimization and improve the robustness of the algorithm, a multi-objective particle swarm optimization algorithm based on grid distance (GDMOPSO) was proposed, which has to improve the diversity of the algorithm and the search ability. Based on the MOPSO algorithm, a new external archive control strategy was established by using the grid technology and Pareto-dominant ordering principle, and the learning samples were improved. The proposed GDMOPSO is compared with a group of benchmark function tests and four classical algorithms. The results of experiment show that our proposed algorithm can effectively avoid premature convergence in terms of generational distance and hyper-volume (HV) indicator compared with other four classical MOPSO algorithms.
25
Haeri, Abdorrahman, and Reza Tavakkoli-Moghaddam. "DEVELOPING A HYBRID DATA MINING APPROACH BASED ON MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION FOR SOLVING A TRAVELING SALESMAN PROBLEM." Journal of Business Economics and Management 13, no. 5 (October 4, 2012): 951–67. http://dx.doi.org/10.3846/16111699.2011.643445.
Повний текст джерелаАнотація:
A traveling salesman problem (TSP) is an NP-hard optimization problem. So it is necessary to use intelligent and heuristic methods to solve such a hard problem in a less computational time. This paper proposes a novel hybrid approach, which is a data mining (DM) based on multi-objective particle swarm optimization (MOPSO), called intelligent MOPSO (IMOPSO). The first step of the proposed IMOPSO is to find efficient solutions by applying the MOPSO approach. Then, the GRI (Generalized Rule Induction) algorithm, which is a powerful association rule mining, is used for extracting rules from efficient solutions of the MOPSO approach. Afterwards, the extracted rules are applied to improve solutions of the MOPSO for large-sized problems. Our proposed approach (IMOPSP) conforms to a standard data mining framework is called CRISP-DM and is performed on five standard problems with bi-objectives. The associated results of this approach are compared with the results obtained by the MOPSO approach. The results show the superiority of the proposed IMOPSO to obtain more and better solutions in comparison to the MOPSO approach.
26
Li, Bo, Chao Xiong, Yong Shun Zhang, and Jian Xun Gao. "Multi-Objective Optimization Design of CFRP Winding Mortar Barrel with Metal Liner Based on MOPSO." Key Engineering Materials 753 (August 2017): 109–13. http://dx.doi.org/10.4028/www.scientific.net/kem.753.109.
Повний текст джерелаАнотація:
A model of composite mortar barrel made of carbon fibre reinforced plastic (CFRP) jacket and steel liner was developed based on the finite method. The multi-objective particle swarm optimization (MOPSO) was employed for the multi-objective design of composite mortar barrel during design processing. The winding angle of carbon fibre and the thickness of composite layers are defined as optimization variables. The fundamental frequency and structure weight of barrel are defined as optimization objectives. The Pareto solution set of composite mortar barrel is obtained by MOPSO. The corresponding design solution of composite mortar barrel is improved in stiffness and weight.
27
Fu, Yanming, Xiao Liu, Weigeng Han, Shenglin Lu, Jiayuan Chen, and Tianbing Tang. "Overlapping Coalition Formation Game via Multi-Objective Optimization for Crowdsensing Task Allocation." Electronics 12, no. 16 (August 15, 2023): 3454. http://dx.doi.org/10.3390/electronics12163454.
Повний текст джерелаАнотація:
With the rapid development of sensor technology and mobile services, the service model of mobile crowd sensing (MCS) has emerged. In this model, user groups perceive data through carried mobile terminal devices, thereby completing large-scale and distributed tasks. Task allocation is an important link in MCS, but the interests of task publishers, users, and platforms often conflict. Therefore, to improve the performance of MCS task allocation, this study proposes a repeated overlapping coalition formation game MCS task allocation scheme based on multiple-objective particle swarm optimization (ROCG-MOPSO). The overlapping coalition formation (OCF) game model is used to describe the resource allocation relationship between users and tasks, and design two game strategies, allowing users to form overlapping coalitions for different sensing tasks. Multi-objective optimization, on the other hand, is a strategy that considers multiple interests simultaneously in optimization problems. Therefore, we use the multi-objective particle swarm optimization algorithm to adjust the parameters of the OCF to better balance the interests of task publishers, users, and platforms and thus obtain a more optimal task allocation scheme. To verify the effectiveness of ROCG-MOPSO, we conduct experiments on a dataset and compare the results with the schemes in the related literature. The experimental results show that our ROCG-MOPSO performs superiorly on key performance indicators such as average user revenue, platform revenue, task completion rate, and user average surplus resources.
28
Wei, Qing Guo, Yan Mei Wang, and Zong Wu Lu. "Cultural-Based Multi-Objective Particle Swarm Optimization for EEG Channel Reduction in Multi-Class Brain-Computer Interfaces." Applied Mechanics and Materials 239-240 (December 2012): 1027–32. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1027.
Повний текст джерелаАнотація:
Applying many electrodes is undesirable for real-life brain-computer interface (BCI) application since the recording preparation can be troublesome and time-consuming. Multi-objective particle swarm optimization (MOPSO) has been widely utilized to solve multi-objective optimization problems and thus can be employed for channel selection. This paper presented a novel method named cultural-based MOPSO (CMOPSO) for channel selection in motor imagery based BCI. The CMOPSO method introduces a cultural framework to adapt the personalized flight parameters of the mutated particles. A comparison between the proposed algorithm and typical L1-norm algorithm was conducted, and the results showed that the proposed approach is more effective in selecting a smaller subset of channels while maintaining the classification accuracy unreduced.
29
Liu, Qi, Jiahao Liu, and Dunhu Liu. "Intelligent Multi-Objective Public Charging Station Location with Sustainable Objectives." Sustainability 10, no. 10 (October 18, 2018): 3760. http://dx.doi.org/10.3390/su10103760.
Повний текст джерелаАнотація:
This paper investigates a multi-objective charging station location model with the consideration of the triple bottom line principle for green and sustainable development from economic, environmental and social perspectives. An intelligent multi-objective optimization approach is developed to handle this problem by integrating an improved multi-objective particle swarm optimization (MOPSO) process and an entropy weight method-based evaluation process. The MOPSO process is utilized to obtain a set of Pareto optimal solutions, and the entropy weight method-based evaluation process is utilized to select the final solution from Pareto optimal solutions. Numerical experiments are conducted based on large-scale GPS data. Experimental results demonstrate that the proposed approach can effectively solve the problem investigated. Moreover, the comparison of single-objective and multi-objective models validates the efficiency and necessity of the proposed multi-objective model in public charging station location problems.
30
Srivastav, Achin, and Sunil Agrawal. "Multi-objective optimization of a mixture inventory system using a MOPSO–TOPSIS hybrid approach." Transactions of the Institute of Measurement and Control 39, no. 4 (October 19, 2015): 555–66. http://dx.doi.org/10.1177/0142331215611211.
Повний текст джерелаАнотація:
This paper studies a multi-objective mixture inventory problem for a pharmaceutical distributor. The work starts with a discussion of a mixture inventory model and three objectives, namely the minimization of: 1) ordering and holding costs, 2) number of units that stockout and 3) frequency of stockout occasions. Multi-objective particle swarm optimization (MOPSO) is used to determine the non-dominated solutions and generate Pareto curves for the inventory system. Two variants of MOPSO are proposed, based on the selection of inertia weight. The performance of the proposed MOPSO algorithms is evaluated in comparison with two robust algorithms like non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective cuckoo search (MOCS). The metrics that are used for the performance measurement of the algorithms are error ratio, spacing and maximum spread. Furthermore, the technique of order preference by similarity to ideal solution (TOPSIS) is used to rank the non-dominated solutions and determine the best compromise solution among them. A factorial analysis develops the linear regression expressions of optimal cost, service level measures, lot size and safety stock factor for practitioners. Lastly, the results of the regression equations are compared using a MOPSO–TOPSIS approach and the validity of the developed equations are checked.
31
Fallah-Mehdipour, E., O. Bozorg Haddad, and M. A. Mariño. "MOPSO algorithm and its application in multipurpose multireservoir operations." Journal of Hydroinformatics 13, no. 4 (December 14, 2010): 794–811. http://dx.doi.org/10.2166/hydro.2010.105.
Повний текст джерелаАнотація:
The main reason for applying evolutionary algorithms in multi-objective optimization problems is to obtain near-optimal nondominated solutions/Pareto fronts, from which decision-makers can choose a suitable solution. The efficiency of multi-objective optimization algorithms depends on the quality and quantity of Pareto fronts produced by them. To compare different Pareto fronts resulting from different algorithms, criteria are considered and applied in multi-objective problems. Each criterion denotes a characteristic of the Pareto front. Thus, ranking approaches are commonly used to evaluate different algorithms based on different criteria. This paper presents three multi-objective optimization methods based on the multi-objective particle swarm optimization (MOPSO) algorithm. To evaluate these methods, bi-objective mathematical benchmark problems are considered. Results show that all proposed methods are successful in finding near-optimal Pareto fronts. A ranking method is used to compare the capability of the proposed methods and the best method for further study is suggested. Moreover, the nominated method is applied as an optimization tool in real multi-objective optimization problems in multireservoir system operations. A new technique in multi-objective optimization, called warm-up, based on the PSO algorithm is then applied to improve the quality of the Pareto front by single-objective search. Results show that the proposed technique is successful in finding an optimal Pareto front.
32
Nguyen, S., and V. Kachitvichyanukul. "Movement Strategies for Multi-Objective Particle Swarm Optimization." International Journal of Applied Metaheuristic Computing 1, no. 3 (July 2010): 59–79. http://dx.doi.org/10.4018/jamc.2010070105.
Повний текст джерелаАнотація:
Particle Swarm Optimization (PSO) is one of the most effective metaheuristics algorithms, with many successful real-world applications. The reason for the success of PSO is the movement behavior, which allows the swarm to effectively explore the search space. Unfortunately, the original PSO algorithm is only suitable for single objective optimization problems. In this paper, three movement strategies are discussed for multi-objective PSO (MOPSO) and popular test problems are used to confirm their effectiveness. In addition, these algorithms are also applied to solve the engineering design and portfolio optimization problems. Results show that the algorithms are effective with both direct and indirect encoding schemes.
33
Salmasnia, Ali, Saeed Hasannejad, and Hadi Mokhtari. "A multi-objective optimization for brush monofilament tufting process design." Journal of Computational Design and Engineering 5, no. 1 (August 12, 2017): 120–36. http://dx.doi.org/10.1016/j.jcde.2017.08.001.
Повний текст джерелаАнотація:
Abstract This paper addresses the optimization of monofilament tufting process as the most important and the main stage of toothbrush production in sanitary industries. In order to minimize both process time and depreciation costs, and ultimately increase the production efficiency in such an industrial unit, we propose a metaheuristic based optimization approach to solve it. The Traveling Salesman Problem (TSP) is used to formulate the proposed problem. Then by using multi-objective evolutionary algorithms, NSGA-II and MOPSO, we seek to obtain the best solution and objective functions described above. Extensive computational experiments on three different kinds of toothbrush handles are performed and the results demonstrate the applicability and appropriate performance of algorithms. The comparison metrics like spacing, number of Pareto solutions, time, mean distance from the ideal solution and diversity are used to evaluate the quality of solutions. Moreover a sensitivity analysis is done for investigation of the performance in various setting of parameters. Key points Brush monofilament tufting process design. NSGA-II and MOPSO as multi-objective approaches. Extensive computational experiments. Comparison metrics like spacing, number of Pareto solutions, time, mean distance from ideal solution and diversity.
34
Xie, Zhengwei, Yilun Li, and Shiyou Yang. "A Hybrid Multi-Objective Optimization Method and Its Application to Electromagnetic Device Designs." Applied Sciences 12, no. 23 (November 26, 2022): 12110. http://dx.doi.org/10.3390/app122312110.
Повний текст джерелаАнотація:
Optimization algorithms play a critical role in electromagnetic device designs due to the ever-increasing technological and economical competition. Although evolutionary algorithm-based methods have successfully been applied to different design problems, these methods exhibit deficiencies when solving complex problems with multimodal and discontinuous objective functions, which is quite common in electromagnetic device optimization designs. In this paper, a hybrid multi-objective optimization algorithm based on a non-dominated sorting genetic algorithm (NSGA-II) and a multi-objective particle swarm optimization method (MOPSO) is proposed. In order to enhance the convergence and diversity performance of the algorithm, a new population update mechanism of MOPSO is introduced. Moreover, an adaptive operator involving crossover and mutation is presented to achieve a better balance between global and local searches. The performance of the hybrid algorithm is validated using standard test functions and the multi-objective design of a superconducting magnetic energy storage (SMES) device. Numerical results demonstrate the effectiveness and superiority of the proposed method.
35
Abbas, Nizar Hadi, and Jaafer Ahmed Abdulsaheb. "An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning." Journal of Engineering 22, no. 7 (July 1, 2016): 164–81. http://dx.doi.org/10.31026/j.eng.2016.07.10.
Повний текст джерелаАнотація:
This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper path from the start to the destination position with minimum distance and time.
36
Patel, G. C. M., P. Krishna, P. R. Vundavilli, and M. B. Parappagoudar. "Multi-Objective Optimization of Squeeze Casting Process using Genetic Algorithm and Particle Swarm Optimization." Archives of Foundry Engineering 16, no. 3 (September 1, 2016): 172–86. http://dx.doi.org/10.1515/afe-2016-0073.
Повний текст джерелаАнотація:
Abstract The near net shaped manufacturing ability of squeeze casting process requiresto set the process variable combinations at their optimal levels to obtain both aesthetic appearance and internal soundness of the cast parts. The aesthetic and internal soundness of cast parts deal with surface roughness and tensile strength those can readily put the part in service without the requirement of costly secondary manufacturing processes (like polishing, shot blasting, plating, hear treatment etc.). It is difficult to determine the levels of the process variable (that is, pressure duration, squeeze pressure, pouring temperature and die temperature) combinations for extreme values of the responses (that is, surface roughness, yield strength and ultimate tensile strength) due to conflicting requirements. In the present manuscript, three population based search and optimization methods, namely genetic algorithm (GA), particle swarm optimization (PSO) and multi-objective particle swarm optimization based on crowding distance (MOPSO-CD) methods have been used to optimize multiple outputs simultaneously. Further, validation test has been conducted for the optimal casting conditions suggested by GA, PSO and MOPSO-CD. The results showed that PSO outperformed GA with regard to computation time.
37
Kumar, Vijendra, and S. M. Yadav. "Multi-objective reservoir operation of the Ukai reservoir system using an improved Jaya algorithm." Water Supply 22, no. 2 (October 28, 2021): 2287–310. http://dx.doi.org/10.2166/ws.2021.374.
Повний текст джерелаАнотація:
Abstract This paper introduces an effective and reliable approach based on a multi-population approach, namely the self-adaptive multi-population Jaya algorithm (SAMP-JA), to extract multi-purpose reservoir operation policies. The current research focused on two goals: minimizing irrigation deficits and maximizing hydropower generation. Three different models were formulated. The results were compared with those for an ordinary Jaya algorithm (JA), particle swarm optimization (PSO), and an invasive weed optimization (IWO) algorithm. In Model-1, the minimum irrigation deficit obtained by SAMP-JA and JA was 305092.99 . SAMP-JA was better than JA, PSO and IWO in terms of convergence. In Model-2, the maximum hydropower generation achieved by SAMP-JA, JA and PSO was 1723.50 . When comparing the average hydropower generation, SAMP-JA and PSO performed better than JA and IWO. In terms of convergence, SAMP-JA was better than PSO. In Model-3, a self-adaptive multi-population multi-objective Jaya algorithm (SAMP-MOJA) was better than multi-objective particle swarm optimization (MOPSO) and multi-objective Jaya algorithm (MOJA) in terms of maximum hydropower generation, and MOPSO was better than SAMP-MOJA and MOJA in terms of minimum irrigation deficiency. While comparing convergence, SAMP-MOJA was found to be better than MOPSO and MOJA. Overall, SAMP-JA was found to outperform JA, POS and IWO.
38
Fatima, Aisha, Nadeem Javaid, Ayesha Anjum Butt, Tanzeela Sultana, Waqar Hussain, Muhammad Bilal, Muhammad Hashmi, Mariam Akbar, and Manzoor Ilahi. "An Enhanced Multi-Objective Gray Wolf Optimization for Virtual Machine Placement in Cloud Data Centers." Electronics 8, no. 2 (February 16, 2019): 218. http://dx.doi.org/10.3390/electronics8020218.
Повний текст джерелаАнотація:
Cloud computing offers various services. Numerous cloud data centers are used to provide these services to the users in the whole world. A cloud data center is a house of physical machines (PMs). Millions of virtual machines (VMs) are used to minimize the utilization rate of PMs. There is a chance of unbalanced network due to the rapid growth of Internet services. An intelligent mechanism is required to efficiently balance the network. Multiple techniques are used to solve the aforementioned issues optimally. VM placement is a great challenge for cloud service providers to fulfill the user requirements. In this paper, an enhanced levy based multi-objective gray wolf optimization (LMOGWO) algorithm is proposed to solve the VM placement problem efficiently. An archive is used to store and retrieve true Pareto front. A grid mechanism is used to improve the non-dominated VMs in the archive. A mechanism is also used for the maintenance of an archive. The proposed algorithm mimics the leadership and hunting behavior of gray wolves (GWs) in multi-objective search space. The proposed algorithm was tested on nine well-known bi-objective and tri-objective benchmark functions to verify the compatibility of the work done. LMOGWO was then compared with simple multi-objective gray wolf optimization (MOGWO) and multi-objective particle swarm optimization (MOPSO). Two scenarios were considered for simulations to check the adaptivity of the proposed algorithm. The proposed LMOGWO outperformed MOGWO and MOPSO for University of Florida 1 (UF1), UF5, UF7 and UF8 for Scenario 1. However, MOGWO and MOPSO performed better than LMOGWO for UF2. For Scenario 2, LMOGWO outperformed the other two algorithms for UF5, UF8 and UF9. However, MOGWO performed well for UF2 and UF4. The results of MOPSO were also better than the proposed algorithm for UF4. Moreover, the PM utilization rate (%) was minimized by 30% with LMOGWO, 11% with MOGWO and 10% with MOPSO.
39
Ma, Zi Rui. "Particle Swarm Optimization Based on Multiobjective Optimization." Applied Mechanics and Materials 263-266 (December 2012): 2146–49. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.2146.
Повний текст джерелаАнотація:
PSO will population each individual as the search space without a volume and quality of particle. These particles in the search space at a certain speed flight, the speed according to its own flight experience and the entire population of flight experience dynamic adjustment. We describe the standard PSO, multi-objective optimization and MOPSO. The main focus of this thesis is several PSO algorithms which are introduced in detail and studied. MOPSO algorithm introduced adaptive grid mechanism of the external population, not only to groups of particle on variation, but also to the value scope of the particles and variation, and the variation scale and population evolution algebra in proportion.
40
Zhuang, Yucheng, Yikun Huang, and Wenyu Liu. "Integrating Sensor Ontologies with Niching Multi-Objective Particle Swarm Optimization Algorithm." Sensors 23, no. 11 (May 25, 2023): 5069. http://dx.doi.org/10.3390/s23115069.
Повний текст джерелаАнотація:
Sensor ontology provides a standardized semantic representation for information sharing between sensor devices. However, due to the varied descriptions of sensor devices at the semantic level by designers in different fields, data exchange between sensor devices is hindered. Sensor ontology matching achieves data integration and sharing between sensors by establishing semantic relationships between sensor devices. Therefore, a niching multi-objective particle swarm optimization algorithm (NMOPSO) is proposed to effectively solve the sensor ontology matching problem. As the sensor ontology meta-matching problem is essentially a multi-modal optimization problem (MMOP), a niching strategy is introduced into MOPSO to enable the algorithm to find more global optimal solutions that meet the needs of different decision makers. In addition, a diversity-enhancing strategy and an opposition-based learning (OBL) strategy are introduced into the evolution process of NMOPSO to improve the quality of sensor ontology matching and ensure the solutions converge to the real Pareto fronts (PFs). The experimental results demonstrate the effectiveness of NMOPSO in comparison to MOPSO-based matching techniques and participants of the Ontology Alignment Evaluation Initiative (OAEI).
41
Bakshi, Shalley, Surbhi Sharma, and Rajesh Khanna. "A Novel Metaheuristic Optimization for Throughput Maximization in Energy Harvesting Cognitive Radio Network." Elektronika ir Elektrotechnika 28, no. 3 (June 28, 2022): 78–89. http://dx.doi.org/10.5755/j02.eie.31245.
Повний текст джерелаАнотація:
In this article, a novel technique is proposed, namely rank-based multi-objective antlion optimization (RMOALO), and applied to optimize the performance of the energy harvesting cognitive radio network (EHCRN). The original selection method in multi-objective antlion optimizer (MOALO) is suitably changed to improve the algorithm, thus reaching the optimal solution for the problem. The proposed technique shows considerable performance improvement over the method used in the multi-objective antlion optimizer (MOALO). The performance of the proposed RMOALO is demonstrated on five benchmark mathematical functions and compared to multi-objective particle swarm optimization (MOPSO), multi-objective moth flame optimization (MOMFO), MOALO-Tournament, and MOALO-Roulette. The simulation results show an improved convergence of RMOALO and find the optimal solution to the throughput maximization problem. We show that RMOALO provides 16.33 % improved average throughput with the optimal value of sensing duration for the varying amount of harvested energy compared to MOPSO, MOMFO, MOALO-Roulette, and MOALO-Tournament.
42
Ling, Qing-Hua, Zhi-Hao Tang, Gan Huang, and Fei Han. "An Improved Multi-Objective Particle Swarm Optimization Algorithm Based on Angle Preference." Symmetry 14, no. 12 (December 10, 2022): 2619. http://dx.doi.org/10.3390/sym14122619.
Повний текст джерелаАнотація:
Multi-objective particle swarm optimization (MOPSO) algorithms based on angle preference provide a set of preferred solutions by incorporating a user’s preference. However, since the search mechanism is stochastic and asymmetric, traditional MOPSO based on angle preference are still easy to fall into local optima and lack enough selection pressure on excellent individuals. In this paper, an improved MOPSO algorithm based on angle preference called IAPMOPSO is proposed to alleviate those problems. First, to create a stricter partial order among the non-dominated solutions, reference vectors are established in the preference region, and the adaptive penalty-based boundary intersection (PBI) value is used to update the external archive. Second, to effectively alleviate the swarm to fall into local optima, an adaptive preference angle is designed to increase the diversity of the population. Third, neighborhood individuals are selected for each particle to update the individual optimum to increase the information exchange among the particles. With the proposed angle preference-based external archive update strategy, solutions with a smaller PBI are given higher priority to be selected, and thus the selection pressure on excellent individuals is enhanced. In terms of an increase in the diversity of the population, the adaptive preference angle adjustment strategy that gradually narrows the preferred area, and the individual optimum update strategy which updates the individual optimum according to the information of neighborhood individuals, are presented. The experimental results on the benchmark test functions and GEM data verify the effectiveness and efficiency of the proposed method.
43
Gao, Meng, Chenji Wei, Xiangguo Zhao, Ruijie Huang, Baozhu Li, Jian Yang, Yan Gao, Shuangshuang Liu, and Lihui Xiong. "Intelligent Optimization of Gas Flooding Based on Multi-Objective Approach for Efficient Reservoir Management." Processes 11, no. 7 (July 24, 2023): 2226. http://dx.doi.org/10.3390/pr11072226.
Повний текст джерелаАнотація:
The efficient development of oil reservoirs mainly depends on the comprehensive optimization of the subsurface fluid flow process. As an intelligent analysis technique, artificial intelligence provides a novel solution to multi-objective optimization (MOO) problems. In this study, an intelligent agent model based on the Transformer framework with the assistance of the multi-objective particle swarm optimization (MOPSO) algorithm has been utilized to optimize the gas flooding injection–production parameters in a well pattern in the Middle East. Firstly, 10 types of surveillance data covering 12 years from the target reservoir were gathered to provide a data foundation for model training and analysis. The prediction performance of the Transformer model reflected its higher accuracy compared to traditional reservoir numerical simulation (RNS) and other intelligent methods. The production prediction results based on the Transformer model were 21, 12, and 4 percentage points higher than those of RNS, bagging, and the bi-directional gated recurrent unit (Bi-GRU) in terms of accuracy, and it showed similar trends in the gas–oil ratio (GOR) prediction results. Secondly, the Pareto-based MOPSO algorithm was utilized to fulfil the two contradictory objectives of maximizing oil production and minimizing GOR simultaneously. After 10,000 iterations, the optimal injection–production parameters were proposed based on the generated Pareto frontier. To validate the feasibility and superiority of the developed approach, the development effects of three injection–production schemes were predicted in the intelligent agent model. In the next 400 days of production, the cumulative oil production increased by 25.3% compared to the average distribution method and 12.7% compared to the reservoir engineering method, while GOR was reduced by 27.1% and 15.3%, respectively. The results show that MOPSO results in a strategy that more appropriately optimizes oil production and GOR compared to some previous efforts published in the literature. The injection–production parameter optimization method based on the intelligent agent model and MOPSO algorithm can help decision makers to update the conservative development strategy and improve the development effect.
44
Nagalingam, Umadevi, Balaji Mahadevan, Kamaraj Vijayarajan, and Ananda Padmanaban Loganathan. "Design optimization for cogging torque mitigation in brushless DC motor using multi-objective particle swarm optimization algorithm." COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering 34, no. 4 (July 6, 2015): 1302–18. http://dx.doi.org/10.1108/compel-07-2014-0162.
Повний текст джерелаАнотація:
Purpose – The purpose of this paper is to propose a multi-objective particle swarm optimization (MOPSO) algorithm based design optimization of Brushless DC (BLDC) motor with a view to mitigate cogging torque and enhance the efficiency. Design/methodology/approach – The suitability of MOPSO algorithm is tested on a 120 W BLDC motor considering magnet axial length, stator slot opening and air gap length as the design variables. It avails the use of MagNet 7.5.1, a Finite Element Analysis tool, to account for the geometry and the non-linearity of material for assuaging an improved design framework and operates through the boundaries of generalized regression neural network (GRNN) to advocate the optimum design. The results of MOPSO are compared with Multi-Objective Genetic Algorithm and Non-dominated Sorting Genetic Algorithm-II based formulations for claiming its place in real world applications. Findings – A MOPSO design optimization procedure has been enlivened to escalate the performance of the BLDC motor. The optimality in design has been out reached through minimizing the cogging torque, maximizing the average torque and reducing the total losses to claim an increase in the efficiency. The results have been fortified in well-distributed Pareto-optimal planes to arrive at trade-off solutions between different objectives. Research limitations/implications – The rhetoric theory of multi objective formulations has been reinforced to provide a decisive solution with regard to the choice of the design obtained from Pareto-optimal planes. Practical implications – The incorporation of a larger number of design variables together with an orientation to thermal and vibration analysis will still go a long way in bringing on board new dimensions to the fold of optimality in the design of BLDC motors. Originality/value – The proposal offers a new perspective to the design of BLDC motor in the sense it be-hives the facility of a swarm based approach to optimize the parameters in order that it serves to improve its performance. The results of a 120 W motor in terms of lowering the losses, minimizing the cogging torque and maximizing the average torque emphasize the benefits of the GRNN based multi-objective formulation and establish its viability for use in practical applications.
45
Bouali, Hamid, Bachir Benhala, and Mohammed Guerbaoui. "Multi-objective optimization of CMOS low noise amplifier through nature-inspired swarm intelligence." Bulletin of Electrical Engineering and Informatics 12, no. 5 (October 1, 2023): 2824–36. http://dx.doi.org/10.11591/eei.v12i5.5512.
Повний текст джерелаАнотація:
This paper presents the application of two swarm intelligence techniques, multi-objective artificial bee colony (MOABC) and multi-objective particle swarm optimization (MOPSO), to the optimal design of a complementary metal oxide semiconductor (CMOS) low noise amplifier (LNA) cascode with inductive source degeneration. The aim is to achieve a balanced trade-off between voltage gain and noise figure. The optimized LNA circuit operates at 2.4 GHz with a 1.8 V power supply and is implemented in a 180 nm CMOS process. Both optimization algorithms were implemented in MATLAB and evaluated using the ZDT1, ZDT2, and ZDT3 test functions. The optimized designs were then simulated using the advance design system (ADS) simulator. The results showed that the MOABC and MOPSO techniques are practical and effective in optimizing LNA design, resulting in better performance than previously published works, with a gain of 21.2 dB and a noise figure of 0.848 dB.
46
Ullah, Ubaid, and Arif Ullah. "An evolutionary algorithm for the solution of multi-objective optimization problem." International Journal of Advances in Applied Sciences 11, no. 4 (December 1, 2022): 287. http://dx.doi.org/10.11591/ijaas.v11.i4.pp287-295.
Повний текст джерелаАнотація:
<span>Worldwide, the COVID-19 widespread has significant impact on a great number of people. The hospital admittance issue for patients with COVID-19 has been optimized by previous research. Identifying the symptoms that can be used to determine a patient's health status, whether they are dead or alive it is difficult task for medical professionals. To solve this issue, multi-objective group counselling optimization (MOGCO) algorithm used to control this problem. First, the zitzler-deb-thiele (ZDT)-2 benchmark function is used to evaluate the MOGCO, multi-objective particle swarm optimization (MOPSO), and non dominated sorting genetic algorithm (NSGA) II. In comparison to MOPSO and NSGA-II, MOGCO is closest to the Pareto front line according to graphic statistics on different fitness evolution values such as 4000, 6000, 8000, and 10000. As a result, MOGCO is used for the COVID-19 data optimization. Moreover, six symptoms (heart rate, oxygen saturation, fever, body pain, flue, and breath) were optimized to see if the COVID-19 patients were still alive. The information was gathered from GitHub. Based on the minimum and maximum values of these symptoms as obtained by the suggested methodology, the optimum study shows that COVID-19 patients can remain alive.</span>
47
Wang, Mingming, Sen Zheng, and Chris Sweetapple. "A Framework for Comparing Multi-Objective Optimization Approaches for a Stormwater Drainage Pumping System to Reduce Energy Consumption and Maintenance Costs." Water 14, no. 8 (April 13, 2022): 1248. http://dx.doi.org/10.3390/w14081248.
Повний текст джерелаАнотація:
Reducing energy consumption and maintenance costs of a pumping system is seen as an important but difficult multi-objective optimization problem. Many evolutionary algorithms, such as particle swarm optimization (PSO), multi-objective particle swarm optimization (MOPSO), and non-dominated sorting genetic algorithm II (NSGA-II) have been used. However, a lack of comparison between these approaches poses a challenge to the selection of optimization approach for stormwater drainage pumping stations. In this paper, a new framework for comparing multi-objective approaches is proposed. Two kinds of evolutionary approaches, single-objective optimization and multi-objective optimization, are considered. Three approaches representing these two types are selected for comparison, including PSO with linear weighted sum method (PSO-LWSM), MOPSO with technique for order preference by similarity to an ideal solution (MOPSO-TOPSIS), and NSGA-II with TOPSIS (NSGA-II-TOPSIS). Four optimization objectives based on the number of pump startups/shutoffs, working hours, energy consumption, and drainage capacity are considered, of which the first two are new ones quantified in terms of operational economy in this paper. Two comparison methods—TOPSIS and operational economy and drainage capacity (E&C)—are used. The framework is demonstrated and tested by a case in China. The average values of the TOPSIS comprehensive evaluation index of the three approaches are 0.021, 0.154, and 0.375, respectively, and for E&C are 0.785, 0.813, and 0.839, respectively. The results show that the PSO-LWSM has better optimization results. The results validate the efficiency of the framework. The proposed framework will help to find a better optimization approach for pumping systems to reduce energy consumption and maintenance costs.
48
Liu, Wei Lin, and Li Na Liu. "Multi-Reservoir Ecological Operation Using Multi-Objective Particle Swarm Optimization." Applied Mechanics and Materials 641-642 (September 2014): 65–69. http://dx.doi.org/10.4028/www.scientific.net/amm.641-642.65.
Повний текст джерелаАнотація:
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.
49
Amiryousefi, Mohammad Reza, Mohebat Mohebbi, Faramarz Khodaiyan, and Mostafa Ghazizadeh Ahsaee. "Multi-Objective Optimization of Deep-Fat Frying of Ostrich Meat Plates Using Multi-Objective Particle Swarm Optimization (MOPSO)." Journal of Food Processing and Preservation 38, no. 4 (May 17, 2013): 1472–79. http://dx.doi.org/10.1111/jfpp.12106.
Повний текст джерела
50
Goudos, Sotirios K., Zaharias D. Zaharis, and Konstantinos B. Baltzis. "Particle Swarm Optimization as Applied to Electromagnetic Design Problems." International Journal of Swarm Intelligence Research 9, no. 2 (April 2018): 47–82. http://dx.doi.org/10.4018/ijsir.2018040104.
Повний текст джерелаАнотація:
Particle swarm optimization (PSO) is a swarm intelligence algorithm inspired by the social behavior of birds flocking and fish schooling. Numerous PSO variants have been proposed in the literature for addressing different problem types. In this article, the authors apply different PSO variants to common design problems in electromagnetics. They apply the Inertia Weight PSO (IWPSO), the Constriction Factor PSO (CFPSO), and the Comprehensive Learning Particle Swarm Optimization (CLPSO) algorithms to real-valued optimization problems, i.e. microwave absorber design, and linear array synthesis. Moreover, the authors use discrete PSO optimizers such as the binary PSO (binPSO) and the Boolean PSO with a velocity mutation (BPSO-vm) in order to solve discrete-valued optimization problems, i.e. patch antenna design. Additionally, the authors apply and compare binPSO with different transfer functions to thinning array design problems. In the case of a multi-objective optimization problem, they apply two multi-objective PSO variants to dual-band base station antenna optimization for mobile communications. Namely, these are the Multi-Objective PSO (MOPSO) and the Multi-Objective PSO with Fitness Sharing (MOPSO-fs) algorithms. Finally, the authors conclude the paper by providing a discussion on future trends and the conclusion.