Optimal small satellite orbit design based on robust multi-objective optimization method

With the complexity of mechanical manufacturing system design increasing, the traditional single-objective optimization method can no longer meet the needs of multi-objective optimization, such as lightweight, high efficiency, low energy consumption and long life. Multi-objective optimization algorithm is widely used in mechanical design and manufacturing process planning because of its good convergence and diversity. Taking robot motion planning as an example, this paper analyzes the application methods of multi-objective optimization algorithm in mechanical structure design in detail, including problem description, multi-objective optimization model construction, algorithm application and performance analysis. Through the application of Genetic Algorithm (GA), this paper shows how the multi-objective optimization algorithm can balance multiple objectives such as path length, energy consumption and obstacle avoidance effect, and realize more intelligent and efficient solutions in robot motion planning. Performance analysis shows that GA is superior to single-objective optimization and random search algorithm in optimization effect, computational efficiency and stability. In addition, this paper also discusses the influence of the change of target weight and algorithm parameters on the optimization results, which provides valuable reference for future algorithm optimization and practical application. Multi-objective optimization algorithm shows obvious advantages in mechanical manufacturing system, which provides new ideas and methods for realizing more efficient, more environmentally friendly and more intelligent mechanical manufacturing design.

In the context of Internet of Things (IoT), optimizing quality of service (QoS) parameters is a critical challenge due to its heterogeneous and resource-constrained nature. This paper proposes a novel quantum-inspired multi-objective optimization algorithm for IoT service management. Traditional multi-objective optimization algorithms often face limitations such as slow convergence and susceptibility to local optima, reducing their effectiveness in complex IoT environments. To address these issues, we introduce a quantum-inspired hybrid algorithm that combines the strengths of Multi-Objective Grey Wolf Optimization Algorithm (MOGWOA) and Multi-Objective Whale Optimization Algorithm (MOWOA), enhanced with quantum principles. This novel integration overcomes the limitations of traditional algorithms by improving convergence speed and avoiding local optima. The hybrid algorithm enhances QoS in IoT applications by achieving superior optimization in terms of energy efficiency, latency reduction, convergence, and coverage cost. The incorporation of quantum-inspired mechanisms, such as quantum position and behavior, strengthens the exploration and exploitation capabilities of the algorithm, enabling faster and more accurate optimization. Extensive simulations and testing demonstrate the proposed method’s superior performance compared to existing algorithms, validating its effectiveness in addressing key IoT challenges.

In this paper, we propose a Multi-objective Five-element Cycle Optimization algorithm based on Multi-strategy fusion (MOFECO-MS) to address the Bi-objective Traveling Thief Problem (BITTP), an extension of the Traveling Thief Problem that incorporates two conflicting objectives. The novelty of our approach lies in a unique individual selection strategy coupled with an innovative element update mechanism rooted in the Five-element Cycle Model. To balance global exploration and local exploitation, the algorithm categorizes the population into distinct groups and applies crossover operations both within and between these groups, while also employing a mutation operator for local searches on the best individuals. This coordinated approach optimizes parameter settings and enhances the search capabilities of the algorithm. Extensive experiments were conducted on nine BITTP instances, comparing MOFECO-MS against eight state-of-the-art multi-objective optimization algorithms. The results show that MOFECO-MS excels in both Hypervolume (HV) and Spread (SP) indicators, while also maintaining a high level of Pure Diversity (PD). Overall, MOFECO-MS outperformed the other algorithms in most instances, demonstrating its superiority and robustness in solving complex multi-objective optimization problems.

In this paper, the problems of fuel cost and emission reduction based on multi-objective optimization are studied and solved. Various multi-objective optimization algorithms, such as the multi-objective ant lion optimization (MOALO), the multi-objective multiverse optimization (MOMVO), the multi-objective particle swarm optimization (MOPSO), the multi-objective thermal exchange optimization (MOTEO), and the multi-objective grasshopper optimization algorithm (MOGOA), are used to reduce the cost and emissions of generation fuel. With equality and inequality restrictions, the suggested work is carried out in an IEEE 30 bus system. To determine the lowest system-wide minimization of generating cost and emission, the results of several optimization strategies are compared. In terms of lowering fuel costs and emissions, the MOGOA performs better than any other multi-objective algorithms.

Battle Royale Optimizer (BRO) is a recently proposed optimization algorithm that has added a new category named game-based optimization algorithms to the existing categorization of optimization algorithms. Both continuous and binary versions of this algorithm have already been proposed. Generally, optimization problems can be divided into single-objective and multi-objective problems. Although BRO has successfully solved single-objective optimization problems, no multi-objective version has been proposed for it yet. This gap motivated us to design and implement the multi-objective version of BRO (MOBRO). Although there are some multi-objective optimization algorithms in the literature, according to the no-free-lunch theorem, no optimization algorithm can efficiently solve all optimization problems. We applied the proposed algorithm to four benchmark datasets: CEC 2009, CEC 2018, ZDT, and DTLZ. We measured the performance of MOBRO based on three aspects: convergence, spread, and distribution, using three performance criteria: inverted generational distance, maximum spread, and spacing. We also compared its obtained results with those of three state-of-the-art optimization algorithms: the multi-objective Gray Wolf optimization algorithm (MOGWO), the multi-objective particle swarm optimization algorithm (MOPSO), the multi-objective artificial vulture's optimization algorithm (MOAVAO), the optimization algorithm for multi-objective problems (MAOA), and the multi-objective non-dominated sorting genetic algorithm III (NSGA-III). The obtained results approve that MOBRO outperforms the existing optimization algorithms in most of the benchmark suites and operates competitively with them in the others.

A performance comparison of multi-objective optimization algorithms for solving nearly-zero-energy-building design problems

This paper presents a comprehensive review of simulated annealing (SA)-based optimization algorithms. SA-based algorithms solve single and multiobjective optimization problems, where a desired global minimum/maximum is hidden among many local minima/maxima. Three single objective optimization algorithms (SA, SA with tabu search and CSA) and five multiobjective optimization algorithms (SMOSA, UMOSA, PSA, WDMOSA and PDMOSA) based on SA have been presented. The algorithms are briefly discussed and are compared. The key step of SA is probability calculation, which involves building the annealing schedule. Annealing schedule is discussed briefly. Computational results and suggestions to improve the performance of SA-based multiobjective algorithms are presented. Finally, future research in the area of SA is suggested.

This paper presents a new approach aims to solve robust multidisciplinary design optimization MDO problem called Improved Multi-objective Robust Collaborative Optimization . This method combines the Multi-objective Robust Collaborative Optimization method, the Worst Possible Point constraint cuts and the Genetic algorithm NSGA-II type as an optimizer to solve the robust optimization problem of complex structure named Y-stiffened panel under interval uncertainty . The proposed approach hierarchically decomposes the optimization problem into a structure level considered as an upper level in the Y-stiffened panel and a second level considered as a lower level of the studied panel. A robust multi-objective optimization problem intended to optimize the eigenfrequency, the global mass and the displacement at a fixed point of the Y-stiffened panel at the first level and each structure’s robust optimization problem allows optimizing its eigenfrequency and mass limited by their local constraint functions at the second one. Tor demonstrate our method, an engineering example of Y-stiffened panel is treated. A good performance of proposed method is proved by a comparison between obtained results and Non-Distributed Multi-objective Robust Optimization .

Multi-objective evolutionary optimization is widely utilized in industrial design. Despite the success of multi-objective evolutionary optimization algorithms in addressing complex optimization problems, research focusing on input disturbances remains limited. In many manufacturing processes, design parameters are vulnerable to random input disturbances, resulting in products that often perform less effectively than anticipated. To address this issue, we propose a novel robust multi-objective evolutionary optimization algorithm based on the concept of survival rate. The algorithm comprises two stages: the evolutionary optimization stage and the construction stage of the robust optimal front. In the former stage, we introduce the survival rate as a new optimization objective. Subsequently, we seek a robust optimal front that concurrently addresses convergence and robustness by employing a non-dominated sorting approach. Furthermore, we propose a precise sampling method and a random grouping mechanism to accurately recover solutions resilient to real noise while ensuring population’s diversity. In the latter stage, we introduce a performance measure that integrates both robustness and convergence to guide the construction of the robust optimal front. Experimental results demonstrate the superiority of the proposed algorithm in terms of both convergence and robustness compared to existing approaches under noisy conditions.

In order to solve the problem of the multi-objective spectrum allocation on the joint optimization of maximal network utility and fairness of users in cognitive radio network, based on quantum bee colony theory and membrane computing, a novel multi-objective discrete combinatorial optimization algorithm, named membrane-inspired quantum bee optimization, is proposed. The global optimal solution of single objective can be searched in the elementary membranes, and Pareto front solutions which take account of network utility and fairness, can be obtained from skin membrane with the proposed method. The multi-objective optimization algorithm, which can solve both single objective and multi-objective optimization problems at the same time, is designed by the communication rules between membranes, the cooperative evolution of foraging behavior based on quantum state, and non-dominated sorting. Compared with classical color-sensitive graph coloring algorithm, genetic algorithm, quantum genetic algorithm, and particle swarm optimization under different objective functions, the proposed spectrum allocation method can search the global optimal solution of single objective as shown by the simulation results, and it is superior to classical spectrum allocation algorithms and existing intelligence spectrum allocation methods. The optimal Pareto front solutions of multi-objective spectrum allocation are also obtained.

We propose a procedure to construct evolutionary bilevel optimization algorithms based on recent theoretical advances that have established connections between bilevel optimization and multiobjective optimization. In the proposed procedure, a new algorithm is defined by integrating an evolutionary multiobjective optimization algorithm with a partial order that is compatible with bilevel optimization. The advantages of the procedure include the ability to harness the methodology of evolutionary multiobjective optimization for bilevel optimization and to systematically develop new algorithms for single-objective and multiobjective bilevel optimization. No regularity assumptions are used, which ensures maximal applicability of the optimization algorithms constructed by the procedure. The necessary theoretical foundation is developed and the steps of the procedure are illustrated with an example.

This paper is devoted to a general methodological study on sensitivity analysis and robust optimization for a planar crank-slider mechanism in presence of joint clearances and random parameters and investigate the effects of parameter uncertainty on optimization results when joint clearance sizes are constantly changing due to wear. The first-order sensitivity analysis based on the response surface proxy model is performed. Then, a multiobjective robust optimization algorithm based on sensitivity analysis is carried out to reduce the undesirable effects of joint clearances and random parameters. In the algorithm, a multiobjective robust optimization model derived from the mean and variance of the objective function is constructed. Here, the objective function is defined based on the consideration of reducing the contact force generated at all clearance joints. Additionally, in order to balance computational accuracy and efficiency in the multiobjective robust optimization process, high-precision Kriging agent models are established. The optimum values of design variables are determined by combining Monte Carlo sampling and multiobjective particle swarm optimization method. By combining the Baumgarte approach with Lankarani–Nikravesh contact force model and Coulomb friction model, the dynamic equations of the planar multibody system with clearance joints are established. The uniform probability distribution is applied for characterizing random parameters. Simulation results show that the influence of design variable variations on the objective function changes in relation to the joint clearance size, but their relative influence degree on the objective function will not vary with the size of joint clearances. Moreover, the optimal solution selected on the Pareto front will affect the average levels and peak fluctuations of the dynamic responses in multibody systems.

This article formulates the daily economic/environmental hydrothermal scheduling problem as a multi-objective optimization problem. By introducing non-dominated sorting and crowding distance, the multi-objective artificial physical optimization algorithm is proposed to solve the daily economic/environmental hydrothermal scheduling problem. To enhance the performance of the proposed algorithm, new velocity update equation, which takes advantage of the individual memory and population information, is utilized. To overcome the drawback of premature convergence, a chaotic mutation is adopted in the multi-objective artificial physical optimization algorithm. Especially for handling the equality constraints of daily economic/environmental hydrothermal scheduling, novel heuristic strategies are developed to repair the infeasible solutions. To demonstrate the effectiveness of the multi-objective artificial physical optimization algorithm for solving daily economic/environmental hydrothermal scheduling, the proposed method is implemented on a hydrothermal system and the numerical results are compared with several optimization approaches. It demonstrates that the proposed multi-objective artificial physical optimization algorithm is competent as an alternative for the daily economic/environmental hydrothermal scheduling problem.

ABSTRACTTo reduce the scatter of fatigue life for welded structures, a robust optimization method is presented in this study based on a dual surrogate modelling and multi-objective particle swam optimization algorithm. Considering the perturbations of material parameters and environment variables, the mean and standard deviation of fatigue life are fitted using dual surrogate modelling and selected as the objective function to be minimized. As an example, a welded box girder is presented to reduce the standard deviation of fatigue life. A set of non-dominated solutions is produced through a multi-objective particle swam optimization algorithm. A cognitive approach is used to select the optimum solution from the Pareto sets. As a comparative study, traditional single objective optimizations are also presented in this study. The results reduced the standard deviation of the fatigue life by about 16.5%, which indicated that the procedure improved the robustness of the fatigue life.

In the past few years, multi-objective optimization algorithms have been extensively applied in several fields including engineering design problems. A major reason is the advancement of evolutionary multi-objective optimization (EMO) algorithms that are able to find a set of non-dominated points spread on the respective Pareto-optimal front in a single simulation. Besides just finding a set of Pareto-optimal solutions, one is often interested in capturing knowledge about the variation of variable values over the Pareto-optimal front. Recent innovization approaches for knowledge discovery from Pareto-optimal solutions remain as a major activity in this direction. In this article, a different data-fitting approach for continuous parameterization of the Pareto-optimal front is presented. Cubic B-spline basis functions are used for fitting the data returned by an EMO procedure in a continuous variable space. No prior knowledge about the order in the data is assumed. An automatic procedure for detecting gaps in the Pareto-optimal front is also implemented. The algorithm takes points returned by the EMO as input and returns the control points of the B-spline manifold representing the Pareto-optimal set. Results for several standard and engineering, bi-objective and tri-objective optimization problems demonstrate the usefulness of the proposed procedure.