Search

In this paper, we present a novel memetic algorithm (MA) for the solution of the resource leveling problem (RLP). The evolutionary framework of the MA is based on integration of a genetic algorithm and simulated annealing methods along with a resource leveling heuristic. The main objective of the proposed algorithm is to integrate complementary strengths of different optimization methods and incorporate the individual learning as a separate process for achieving a successful optimization method for the RLP. The performance of the MA is compared with the state-of-the-art leveling methods. For small instances up to 30 activities, mixed-integer linear models are presented for two leveling metrics to provide a basis for performance evaluation. The computational results indicate that the new integrated framework of the MA outperforms the state-of-the-art leveling heuristics and meta-heuristics and provides a successful method for the RLP. The limitations of popular commercial project management software are also illustrated along with the improvements achieved by the MA to reveal potential contributions of the proposed integrated framework in practice. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid nature-inspired metaheuristic algorithm based on the Genetic Algorithm and the African Buffalo Optimization is proposed. The hybrid approach adaptively switches between the Genetic Algorithm and the African Buffalo Optimization during the optimization process, leveraging their respective strengths to improve performance. To improve randomness, the hybrid approach uses two high-quality pseudorandom number generators—the 64-bit and 32-bit versions of the SIMD-Oriented Fast Mersenne Twister. The effectiveness of the hybrid algorithm is evaluated on the NP-hard Container Relocation Problem, focusing on a test set of restricted Container Relocation Problems with higher complexity. The results show that the hybrid algorithm outperforms the individual Genetic Algorithm and the African Buffalo Optimization, which use standard pseudorandom number generators. The adaptive switch method allows the algorithm to adapt to different optimization problems and mitigate problems such as premature convergence and local optima. Moreover, the importance of pseudorandom number generator selection in metaheuristic algorithms is highlighted, as it directly affects the optimization results. The use of powerful pseudorandom number generators reduces the probability of premature convergence and local optima, leading to better optimization results. Overall, the research demonstrates the potential of hybrid metaheuristic approaches for solving complex optimization problems, which makes them relevant for scientific research and practical applications. [ABSTRACT FROM AUTHOR]

This paper presents the minimization of total harmonic distortion in a seven-level cascaded H-bridge multilevel inverter with resistive load using the teaching–learning-based optimization algorithm. The minimization of Total Harmonic Distortion (THD)is a challenging optimization problem due to the fact that nonlinear equations are involved. Recently, bio-inspired algorithms have become very popular approaches to solving various optimization problems in different areas of engineering. For this reason, the results obtained with the Teaching–Learning-Based Optimization (TLBO)algorithm were compared with three other popular bio-inspired algorithms, the genetic algorithm, differential evolution, and particle swarm optimization. The comparative analysis, conducted by sweeping the modulation index, made it possible to obtain graphs and data on the behavior of the four analyzed algorithms. Finally, it was concluded that the TLBO algorithm is very effective and is able to solve the THD-minimization problem. Its main advantage over the other algorithms is the fact that it does not require control parameters for its correct operation in the solution of the problem. [ABSTRACT FROM AUTHOR]

In this paper, a structural design and controller optimization process for a five-bar planar manipulator are studied using three different population-based optimization techniques: particle swarm optimization, genetic algorithm, and differential evolution. First, the desired kinematic properties of the manipulator, such as the position, velocity, and acceleration of the endpoint, are determined using inverse kinematics. Then, an optimization problem is created to minimize the shaking force and moments, and the desired kinematic quantities are implemented as constraints. All the link properties of the manipulator are defined as design variables, and the optimization results are obtained. The results show that it is possible to significantly reduce the shaking force and moment significantly thanks to the optimal design parameters. Finally, the controller is optimized to find the best PID gains considering the forward kinematics of the manipulator. It is observed that the shaking force and shaking moment can be reduced by 99% and 54%, respectively, which has a very positive effect on the accuracy of the trajectory tracking. Moreover, the performances of the optimization methods are compared by using the same number of iterations in the calculations, and thus, it can be seen that the GA method achieves the best results compared to the others. Therefore, the results of this study are of utmost importance for a manufacturer, who wants to design a five-bar planar manipulator and its controller. [ABSTRACT FROM AUTHOR]

The optimal allocation of protective devices is a serious issue in an electrical power system; in order to reduce the possibility of faults, the protection devices should be optimally placed. The paper presents a continuous genetic algorithm (CGA) for the optimal allocation of directional relays for the efficient energy minimization in a radial distribution system (DG). The algorithm is flexible to use for the changes and improvements in the optimal location for a DG unit and can optimize the energy consumption in the radial distribution system. The proposed algorithm has been implemented on IEEE 33 and 69-bus system using MATLAB (R2014b, MathWorks). Low energy consumption is a common design objective in an energy-constrained distribution system. Engineers, power utilities, and network operators can profit from the proposed methodology to enhance the use of DG in distribution networks. [ABSTRACT FROM AUTHOR]

In this paper we introduce the draft of a new graph-based algorithm for optimization of scheduling problems. Our algorithm is based on the Generalized Lifelong Planning A* algorithm, which is usually used for path planning for mobile robots. It was tested on the Job Shop Scheduling Problem against a genetic algorithm's classic implementation. The acquired results of these experiments were compared by each algorithm's required time (to find the best solution) as well as makespan. The comparison of these results showed that the proposed algorithm exhibited a promising convergence rate toward an optimal solution. Job shop scheduling (or the job shop problem) is an optimization problem in informatics and operations research in which jobs are assigned to resources at particular times. The makespan is the total length of the schedule (when all jobs have finished processing). In most of the tested cases, our proposed algorithm managed to find a solution faster than the genetic algorithm; in five cases, the graph-based algorithm found a solution at the same time as the genetic algorithm. Our results also showed that the manner of priority calculation had a non-negligible impact on solutions, and that an appropriately chosen priority calculation could improve them. [ABSTRACT FROM AUTHOR]

Vehicle routing problem (VRP) is a highly investigated discrete optimization problem. The first paper was published in 1959, and later, many vehicle routing problem variants appeared to simulate real logistical systems. Since vehicle routing problem is an NP-difficult task, the problem can be solved by approximation algorithms. Metaheuristics give a "good" result within an "acceptable" time. When developing a new metaheuristic algorithm, researchers usually use only their intuition and test results to verify the efficiency of the algorithm, comparing it to the efficiency of other algorithms. However, it may also be necessary to analyze the search operators of the algorithms for deeper investigation. The fitness landscape is a tool for that purpose, describing the possible states of the search space, the neighborhood operator, and the fitness function. The goal of fitness landscape analysis is to measure the complexity and efficiency of the applicable operators. The paper aims to investigate the fitness landscape of a complex vehicle routing problem. The efficiency of the following operators is investigated: 2-opt, order crossover, partially matched crossover, cycle crossover. The results show that the most efficient one is the 2-opt operator. Based on the results of fitness landscape analysis, we propose a novel traveling salesman problem genetic algorithm optimization variant where the edges are the elementary units having a fitness value. The optimal route is constructed from the edges having good fitness value. The fitness value of an edge depends on the quality of the container routes. Based on the performed comparison tests, the proposed method significantly dominates many other optimization approaches. [ABSTRACT FROM AUTHOR]

In this paper, we examine routing protocols with the shortest path in sensor networks. In doing this, we propose a genetic algorithm (GA)-based Ad Hoc On-Demand Multipath Distance Vector routing protocol (GA-AOMDV). We utilize a fitness function that optimizes routes based on the energy consumption in their nodes. We compare this algorithm with other existing ad hoc routing protocols including LEACH-GA, GA-AODV, AODV, DSR, EPAR, EBAR_BFS. Results prove that our protocol enhances the network performance in terms of packet delivery ratio, throughput, round trip time and energy consumption. GA-AOMDV protocol achieves average gain that is 7 to 22% over other protocols. Therefore, our protocol extends the network lifetime for data communications. [ABSTRACT FROM AUTHOR]

This paper focusses on a hybrid approach based on genetic algorithm (GA) and an adaptive neuro fuzzy inference system (ANFIS) for modeling the correlation between plasma arc cutting (PAC) parameters and the response characteristics of machined Monel 400 alloy sheets. PAC experiments are performed based on box-behnken design methodology by considering cutting speed, gas pressure, arc current, and stand-off distance as input parameters, and surface roughness (Ra), kerf width (kw), and micro hardness (mh) as response characteristics. GA is efficaciously utilized as the training algorithm to optimize the ANFIS parameters. The training, testing errors, and statistical validation parameter results indicated that the ANFIS learned by GA outperforms in the forecasting of PAC responses compared with the results of multiple linear regression models. Besides that, to obtain the optimal combination PAC parameters, multi-response optimization was performed using a trained ANFIS network coupled with an artificial bee colony algorithm (ABC). The superlative responses, such as Ra of 1.5387 µm, kw of 1.2034 mm, and mh of 176.08, are used to forecast the optimum cutting conditions, such as a cutting speed of 2330.39 mm/min, gas pressure of 3.84 bar, arc current of 45 A, and stand-off distance of 2.01 mm, respectively. Furthermore, the ABC predicted results are validated by conducting confirmatory experiments, and it was found that the error between the predicted and the actual results are lower than 6.38%, indicating the adoptability of the proposed ABC in optimizing real-world complex machining processes. [ABSTRACT FROM AUTHOR]

Link prediction is a very important field in network science with various emerging algorithms, the goal of which is to estimate the presence or absence of an edge in the network. Depending on the type of network, different link prediction algorithms can be applied, being less or more effective in the relevant scenarios. In this work, we develop a novel framework that attempts to compose the best features of link prediction algorithms when applied to a network, in order to have even more reliable predictions, especially in topologies emerging in Industrial Internet of Things (IIoT) environments. According to the proposed framework, we first apply appropriate link prediction algorithms that we have chosen for an analyzed network (basic algorithms). Each basic algorithm gives us a numerical estimate for each missing edge in the network. We store the results of each basic algorithm in appropriate structures. Then we provide them as input to a developed genetic algorithm. The genetic algorithm evaluates the results of the basic algorithms for each missing edge of the network. At each missing edge of the network and from generation to generation, it composes the estimates of the basic algorithms regarding each edge and produces a new optimized estimate. This optimization results in a vector of weights where each weight corresponds to the effectiveness of the prediction for each of the basic algorithms we have employed. With these weights, we build a new enhanced predictor tool, which can obtain new optimized estimates for each missing edge in the network. The enhanced predictor tool applies to each missing edge the basic algorithms, normalizes the basic algorithms' estimates, and, using the weights of the estimates derived from the genetic algorithm, returns a new estimate of whether or not an edge will be added in the future. According to the results of our experiments on several types of networks with five well-known link prediction algorithms, we show that the new enhanced predictor tool yields in every case better predictions than each individual algorithm, therefore providing an accuracy-targeting alternative in the existing state of the art. [ABSTRACT FROM AUTHOR]

In photolithographic processes, nanometer-level-precision wavefront-aberration models enable the machine to be able to meet the overlay (OVL) drift and critical dimension (CD) specifications. Software control algorithms take as input these models and correct any expected wavefront imperfections before reaching the wafer. In such way, a near-optimal image is exposed on the wafer surface. Optimizing the parameters of these models, however, involves several time costly sensor measurements which reduce the throughput performance of the machine in terms of exposed wafers per hour. In that case, photolithography machines come across the trade-off between throughput and quality. Therefore, one of the most common optimal experimental design (OED) problems in photolithography machines (and not only) is how to choose the minimum amount of sensor measurements that will provide the maximum amount of information. Additionally, each sensor measurement corresponds to a point on the wafer surface and therefore we must measure uniformly around the wafer surface as well. In order to solve this problem, we propose a sensor mark selection algorithm which exploits genetic algorithms. The proposed solution first selects a pool of points that qualify as candidates to be selected in order to meet the uniformity constraint. Then, the point that provides the maximum amount of information, quantified by the Fisher-based criteria of G-, D-, and A-optimality, is selected and added to the measurement scheme. This process, however, is considered "greedy", and for this reason, genetic algorithms (GA) are exploited to further improve the solution. By repeating in parallel the "greedy" part several times, we obtain an initial population that will be the input to our GA. This meta-heuristic approach outperforms the "greedy" approach significantly. The proposed solution is applied in a real life semiconductors industry use case and achieves interesting industry as well as academical results. [ABSTRACT FROM AUTHOR]

There are increasing challenges for optimally distributing fresh products while adequately considering the uncertain demand of customers and maintaining the freshness of products. Taking the nature of fresh products and the characteristics of urban logistics systems into consideration, this paper proposes an improved genetic algorithm for effectively solving this problem in a computationally efficient manner. Such an algorithm can adequately account for the uncertain demand of customers to select the optimal distribution route to ensure the freshness of the product while minimizing the total distribution cost. Iterative optimization procedures are utilized for determining the optimal route by reducing the complexity of the computation in the search for an optimal solution. An illustrative example is presented that shows the improved algorithm is more effective with respect to the distribution cost, the distribution efficiency, and the distribution system's reliability in optimally distributing fresh products. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems. [ABSTRACT FROM AUTHOR]

This study investigates the ability of a new hybrid neuro-fuzzy model by combining the neuro-fuzzy (ANFIS) approach with the marine predators' algorithm (MPA) in predicting short-term (from 1 h ahead to 1 day ahead) significant wave heights. Data from two stations, Cairns and Palm Beach buoy, were used in assessing the considered methods. The ANFIS-MPA was compared with two other hybrid methods, ANFIS with genetic algorithm (ANFIS-GA) and ANFIS with particle swarm optimization (ANFIS-PSO), in predicting significant wave height for multiple lead times ranging from 1 h to 1 day. The multivariate adaptive regression spline was investigated in deciding the best input for prediction models. The ANFIS-MPA model generally offered better accuracy than the other hybrid models in predicting significant wave height in both stations. It improved the accuracy of ANFIS-PSO and ANFIS-GA by 8.3% and 11.2% in root mean square errors in predicting a 1 h lead time in the test period. [ABSTRACT FROM AUTHOR]

Load balancing is a very important concept in cloud computing. In this work, studies are conducted on workload traces at Los Alamos National Lab (LANL). The jobs in this trace are asymmetric in nature as most of them have small time limit. Two hybrid algorithms, a Genetic Algorithm combined with First Come First Serve (GA_FCFS) and Genetic Algorithm combined with Round Robin (GA_RR), are proposed here. The results obtained are compared with the existing First Come First Serve (FCFS), Round Robin (RR) and Genetic Algorithm (GA). Makespan and Resource Utilization are used for the comparison of results. In terms of Makespan, it is observed that GA_RR outperforms the other methods for all the batch sizes. Although the performance of GA_FCFS is much better than that of the other three well-established algorithms FCFS, RR and GA, it is still worse than that of the GA_RR algorithm for all the cases. GA_RR performs best in terms of Resource Utilization also and GA_FCFS is a close competitor. Overall, GA_RR outperforms all the other algorithms. [ABSTRACT FROM AUTHOR]

There are many algorithms used with different purposes in the area of cryptography. Amongst these, Genetic Algorithms have been used, particularly in the cryptanalysis of block ciphers. Interest in the use of and research on such algorithms has increased lately, with a special focus on the analysis and improvement of the properties and characteristics of these algorithms. In this way, the present work focuses on studying the fitness functions involved in Genetic Algorithms. First, a methodology was proposed to verify that the closeness to 1 of some fitness functions' values that use decimal distance implies decimal closeness to the key. On the other hand, the foundation of a theory is developed in order to characterize such fitness functions and determine, a priori, if one method is more effective than another in the attack to block ciphers using Genetic Algorithms. [ABSTRACT FROM AUTHOR]