Multi-Objective Optimization of Multi-Product Parallel Disassembly Line Balancing Problem Considering Multi-Skilled Workers Using a Discrete Chemical Reaction Optimization Algorithm

This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.

Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based Dynamic Algorithms

Cloud Computing has the ability to provide on-demand access to a shared resource pool.It has completely changed the way businesses are managed,implement applications,and provide services.The rise in popularity has led to a significant increase in the user demand for services.However,in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization.This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms.Specifically,metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic.In a cloud-based context,this paper describes load balancing measurements,including the benefits and drawbacks associated with the selected load balancing techniques.It also summarizes the algorithms based on implementation,time complexity,adaptability,associated issue(s),and targeted QoS parameters.Additionally,the analysis evaluates the tools and instruments utilized in each investigated study.Moreover,comparative analysis among static,traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed.Finally,the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed.

A Multi-Object Genetic Algorithm for the Assembly Line Balance Optimization in Garment Flexible Job Shop Scheduling

Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations.As a result,the production efficiency of the enterprise is not high,and the production organization is not up to expectations.Aiming at the problem of flexible process route planning in garment workshops,a multi-object genetic algorithm is proposed to solve the assembly line bal-ance optimization problem and minimize the machine adjustment path.The encoding method adopts the object-oriented path representation method,and the initial population is generated by random topology sorting based on an in-degree selection mechanism.The multi-object genetic algorithm improves the mutation and crossover operations according to the characteristics of the clothing process to avoid the generation of invalid offspring.In the iterative process,the bottleneck station is optimized by reasonable process splitting,and process allocation conforms to the strict limit of the station on the number of machines in order to improve the compilation efficiency.The effectiveness and feasibility of the multi-object genetic algorithm are proven by the analysis of clothing cases.Compared with the artificial allocation process,the compilation efficiency of MOGA is increased by more than 15%and completes the optimization of the minimum machine adjustment path.The results are in line with the expected optimization effect.

Fuzzy Fruit Fly Optimized Node Quality-Based Clustering Algorithm for Network Load Balancing

Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.

Evapotranspiration Estimation Based on MODIS Products and Surface Energy Balance Algorithms for Land(SEBAL) Model in Sanjiang Plain,Northeast China

In this study,the Surface Energy Balance Algorithms for Land(SEBAL) model and Moderate Resolution Imaging Spectroradiometer(MODIS) products from Terra satellite were combined with meteorological data to estimate evapotranspiration(ET) over the Sanjiang Plain,Northeast China.Land cover/land use was classified by using a recursive partitioning and regression tree with MODIS Normalized Difference Vegetation Index(NDVI) time series data,which were reconstructed based on the Savitzky-Golay filtering approach.The MODIS product Quality Assessment Science Data Sets(QA-SDS) was analyzed and all scenes with valid data covering more than 75% of the Sanjiang Plain were selected for the SEBAL modeling.This provided 12 overpasses during 184-day growing season from May 1st to October 31st,2006.Daily ET estimated by the SEBAL model was misestimaed at the range of-11.29% to 27.57% compared with that measured by Eddy Covariance system(10.52% on average).The validation results show that seasonal ET from the SEBAL model is comparable to that from ground observation within 8.86% of deviation.Our results reveal that the time series daily ET of different land cover/use increases from vegetation on-going until June or July and then decreases as vegetation senesced.Seasonal ET is lower in dry farmland(average(Ave):491 mm) and paddy field(Ave:522 mm) and increases in wetlands to more than 586 mm.As expected,higher seasonal ET values are observed for the Xingkai Lake in the southeastern part of the Sanjiang Plain(Ave:823 mm),broadleaf forest(Ave:666 mm) and mixed wood(Ave:622 mm) in the southern/western Sanjiang Plain.The ET estimation with SEBAL using MODIS products can provide decision support for operational water management issues.

Research on Modified Shifting Balance Genetic Algorithms

The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search capability of the core population,the sub-space method was used to generate uniformly distributed initial colony populations over the decision variable space. The core population was also dynamically divided,making simultaneous searching in several local spaces possible. The algorithm proposed in this paper was compared to the original one by searching for the optimum of a complicated multi-modal function. The results indicate that the solutions obtained by the modified algorithm are better than those of the original algorithm.

Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.

Genetic-algorithm-based balanced distribution of functional characteristics for machines

In order to make reconfigurable manufacturing system （RMS） adapt to the fluctuations of production demand with the minimum number of reconflgurations in its full life cycle, we presented a method to design RMS based on the balanced distribution of functional characteristics for ma- chines. With this method, functional characteristics were classified based on machining functions of cutting-tools and machining accuracy of machines. Then the optimization objective was set as the to- tal shortest mobile distance that all the workpieces are moved from one machine to another, and an improved genetic algorithm （GA） was proposed to optimize the configuration. The elitist strategy was used to enhance the global optimization ability of GA, and excellent gene pool was designed to maintain the diversity of population. Software Matlab was used to realize the algorithm, and a case study of simulation was used to evaluate the method.

Unbalance Level Regulating Algorithm in Power Distribution Networks

The paper dwells on the unified power quality indexes characterizing the phenomenon of voltage unbalance in three-phase systems. Voltage unbalance is one of the commonest occurrences in the town mains of 0.38 kV voltage. The phenomenon describes as inequality of vector magnitude of phase voltage and shearing angle between them. Causes and consequences of the voltage unbalance in distribution networks have been considered. The algorithm, which allows switching one-phase load, has been developed as one of the methods of reducing the unbalance level. The algorithm is written in the function block diagram programming language. For determining the duration and magnitude of the unbalance level it is proposed to introduce the forecasting algorithm. The necessary data for forecasting are accumulated in the course of the algorithm based on the Function Block Diagram. The algorithm example is given for transforming substation of the urban electrical power supply system. The results of the economic efficiency assessment of the algorithm implementation are shown in conclusion. The use of automatic switching of the one-phase load for explored substation allows reducing energy losses (active electric energy by 7.63%;reactive energy by 8.37%). It also allows improving supply quality to a consumer. For explored substation the average zero-sequence unbalance factor has dropped from 3.59% to 2.13%, and the negative-sequence unbalance factor has dropped from 0.61% to 0.36%.

Solving the Balance Problem of On-Line Role-Playing Games Using Evolutionary Algorithms

In on-line role-playing games (RPG), each race holds some attributes and skills. Each skill contains several abilities such as physical damage, hit rate, etc. Parts of the attributes and all the abilities are a function of the character’s level, which are called Ability-Increasing Functions (AIFs). A well-balanced on-line RPG is characterized by having a set of well-balanced AIFs. In this paper, we propose an evolutionary design method, including integration with an improved Probabilistic Incremental Program Evolution (PIPE) and a Cooperative Coevolutionary Algorithm (CCEA), for on-line RPGs to maintain the game balance. Moreover, we construct a simplest turn-based game model and perform a series of experiments based on it. The results indicate that the proposed method is able to obtain a set of well-balanced AIFs efficiently. They also show that in this case the CCEA outperforms the simple genetic algorithm, and that the capability of PIPE has been significantly improved through the improvement work.

Improved Arithmetic Optimization Algorithm with Multi-Strategy Fusion Mechanism and Its Application in Engineering Design

This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.

Multipath Selection Algorithm Based on Dynamic Flow Prediction

Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Defined Network (SDN) to dynamically predict the traffic and comprehensively consider the current and predicted load of the network in order to select the optimal forwarding path and balance the network load. Experiments have demonstrated that the algorithm achieves significant improvement in both system throughput and average packet loss rate for the purpose of improving network quality of service.

A New Method Based on Evolutionary Algorithm for Symbolic Network Weak Unbalance

The symbolic network adds the emotional information of the relationship,that is,the“+”and“-”information of the edge,which greatly enhances the modeling ability and has wide application in many fields.Weak unbalance is an important indicator to measure the network tension.This paper starts from the weak structural equilibrium theorem,and integrates the work of predecessors,and proposes the weak unbalanced algorithm EAWSB based on evolutionary algorithm.Experiments on the large symbolic networks Epinions,Slashdot and WikiElections show the effectiveness and efficiency of the proposed method.In EAWSB,this paper proposes a compression-based indirect representation method,which effectively reduces the size of the genotype space,thus making the algorithm search more complete and easier to get better solutions.

The Algorithm of Balanced Orthogonal Multiwavelets and Its Application in Denoising

In order to extract fault features of a weak signal from the strong noise and maintain signal smoothness, a new method of denoising based on the algorithm of balanced orthogonal multiwavelets is proposed. Multiwavelets have several scaling functions and wavelet functions, and possess excellent properties that a scalar wavelet cannot satisfy simultaneously, and match the different characteristics of signals. Moreover, the balanced orthogonal multiwavelets can avoid the Gibbs phenomena and their processes have the advantages in denoising. Therefore, the denoising based on the algorithm of balanced orthogonal multiwavelets is introduced into the signal process. The algorithm of bal- anced orthogonal multiwavelet and the implementation steps of this denoising are described. The experimental compar- ison of the denoising effect between this algorithm and the traditional multiwavelet algorithm was done. The experi- ments indieate that this method is effective and feasible to extract the fault feature submerged in heavy noise.

Joint eigenvalue estimation by balanced simultaneous Schur decomposition

The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.

Effective Hybrid Teaching-learning-based Optimization Algorithm for Balancing Two-sided Assembly Lines with Multiple Constraints

Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

Dynamic and Integrated Load-Balancing Scheduling Algorithm for Cloud Data Centers

One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.

Optimization of assembly line balancing using genetic algorithm

In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).

Load Balancing Routing Algorithm Based on Extended Link States in LEO Constellation Network

As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO network.Therefore,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is proposed.Simulation results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.

Combined Viterbi Detector for a Balanced Code in Page Memories

Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memories, the combined Viterbi detector scheme is proposed to improve raw biterror rate performance by mitigating the occurrence of a twobit reversing error event in an estimated codeword for the balanced code. The effectiveness of the detection scheme is verified for different data quantizations using Monte Carlo simulations. Key words holographic data storage - balanced code - modulation code - Viterbi algorithm - path metric CLC number TN 911. 21 Foundation item: Supported by National 973 Research Program of China (G1999033006)Biography: Chen Duan-rong (1960-), male, Lecturer, Ph. D candidate, research direction: coding and signal processing for the recording channel of holographic data storage.