Fuzzy-Based Multi-Objective Design Optimization of Buried Pipelines

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.

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.

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

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.

Structural reliability analysis with fuzzy random variables using error principle

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 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.

A novel approach to hybrid dynamic environmental-economic dispatch of multi-energy complementary virtual power plant considering renewable energy generation uncertainty and demand response

Simultaneous multi-objective optimization of a PHEV power management system and component sizing in real world traffic condition

Due to the adversarial limitations between the output solutions in the multi-objective optimization stage, the energy efficiency optimization of large pumping stations has the disadvantage of difficult coordination between power consumption and efficiency. Therefore, a multi-objective Bayesian hyperparameter optimization algorithm design for energy efficiency optimization of large pumping stations has been carried out. A multi-objective optimization model for energy efficiency of large pumping stations was constructed by combining the input power of the main motor, transmission energy loss, transformer loss, and energy consumption of auxiliary equipment, with efficiency as the constraint. We extract sequence features that affect pump water demand, and use feature labels as hyperparameters for the multi-objective optimization model of energy efficiency in large pumping stations. We transform the multi-objective optimization problem into a hyperparameter optimization problem, avoiding adversarial output solutions. We iterate the query points collected by EI, so the output model reaches a convergent optimal solution. The test results show that the designed algorithm can improve the pumping efficiency of the pump station while controlling the power consumption of the pump station, achieving collaborative optimization of efficiency.

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.

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 address multiobjective, multi constraint and time-consuming structural optimization problems in a vehicle axle system, a multiobjective cooperative optimization model of a vehicle axle structure is established. In light of the difficulty in the nondominated sorting of the NSGA-II algorithm caused by inconsistent effects of the uniformity objective function and physical objective function, this paper combines a multiobjective genetic algorithm with cooperative optimization and presents a strategy for handling the optimization of a vehicle axle structure. The uniformity objective function of the sub discipline is transformed to its self-constraint. Taking the multiobjective optimization of a vehicle axle system as an example, a multiobjective cooperative optimization design for the system is carried out in ISIGHT. The results show that the multiobjective cooperative optimization strategy can simplify the complexity of optimization problems and that the multiobjective cooperative optimization method based on an approximate model is favorable for accuracy and efficiency, thereby providing a theoretical basis for the optimization of similar complex structures in practical engineering.

Relevant with some important subjects like target recognition, sensor fusion systems can be considered as one of the main issues highlighting here. Environmental condition, target characteristic and sensor efficiency are three parameters which can impress on sensor value in target recognition so for recognizing targets, a group of sensors which have more recognition rates, must be selected intelligently. Utilizing many sensors to acquire the highest object recognition rate would have extra cost and decrease energy of mobile sensors rapidly. Therefore make a tradeoff between sensor numbers and object recognition rate would be imperatively. This paper attempts to design a multi objective optimization service by using optimization algorithm and neural network. This service specifies highest recognition rate for each distinct sensor numbers. We propose multi objective optimization algorithm to help accessing the best sensory configuration for a definite environment regarding to the environmental conditions, sensors performance, and object features. Our multi objective optimization algorithm has two functions. Genetic algorithm is used to perform as one of functions to specify object recognition rates of each sensor group. Neural network is used to perform as fitness function of each genetic algorithm chromosomes. Another function is sensor numbers determinant. Highest recognition rate and lowest sensor numbers are two objects which multi objective optimization algorithm wants to make a balance between them. We define 500 different scenarios for 6 different sensors in different conditions. Object recognition rate of each sensor is collected. These rates are used for neural networks training process. By defining new scenario and run multi objective optimization algorithm in this scenario, this algorithm makes a Pareto front between sensor numbers and object recognition rate. Finally this algorithm finds, by distinct numbers of sensor, which sensors by which recognition ability must be used to reach the highest recognition rate.

An application based on a microservice architecture with a set of independent, fine-grained modular services is desirable, due to its low management cost, simple deployment, and high portability. This type of container technology has been widely used in cloud computing. Several methods have been applied to container-based microservice scheduling, but they come with significant disadvantages, such as high network transmission overhead, ineffective load balancing, and low service reliability. In order to overcome these disadvantages, in this study, we present a multi-objective optimization problem for container-based microservice scheduling. Our approach is based on the particle swarm optimization algorithm, combined parallel computing, and Pareto-optimal theory. The particle swarm optimization algorithm has fast convergence speed, fewer parameters, and many other advantages. First, we detail the various resources of the physical nodes, cluster, local load balancing, failure rate, and other aspects. Then, we discuss our improvement with respect to the relevant parameters. Second, we create a multi-objective optimization model and use a multi-objective optimization parallel particle swarm optimization algorithm for container-based microservice scheduling (MOPPSO-CMS). This algorithm is based on user needs and can effectively balance the performance of the cluster. After comparative experiments, we found that the algorithm can achieve good results, in terms of load balancing, network transmission overhead, and optimization speed.