A hybrid intelligent algorithm for multiple capacitated vehicle routing problem

This paper investigates the use of a Hybrid Energy Storage System (HESS) that contains a battery and fuel cell system with a microgrid (MG) to perform multiple functions such as supply-demand matching and energy arbitrage. The main objective of the proposed study is to obtain the optimal size of the MG system which minimizes the total costs and the total emissions. The problem is formulated as a nonlinear optimization problem with different constraints and solved using Hybrid Firefly and Particle Swarm Optimization (HFPSO) algorithm. To validate the effectiveness of the HFPSO, the HFPSO is compared with the Particle Swarm Optimization (PSO) algorithm and the Firefly algorithm (FA). The result of the comparison proves the effectiveness of the HFPSO, and this is considered the main reason for using the HFPSO to solve the proposed difficult optimization problem. The problem is implemented using MATLAB software. The policy of the MG system is illustrated, and the results and the curves are discussed to validate this policy.

A good exploration ability can ensure that the method jumps out of local optimum in multimodal problems and a good exploitation can ensure an algorithm converge faster to global optimum values. So, this paper proposes a new hybrid sperm swarm optimization and genetic algorithm to obtain global optimal solutions termed HSSOGA which is developed based on the concept of balancing the exploration and exploitation capability by merging Sperm Swarm Optimization (SSO), which has a fast convergence rate, and a Genetic Algorithm (GA) that can explore a search domain efficiently. To ensure that the proposed method delivers good performance, it is evaluated with 11 standard test function problems consisting of 5 unimodal and 6 multimodal functions. The proposed HSSOGA set is compared with conventional GA and SSO methods, as well as with several hybrid methods such as Hybrid Firefly and Particle Swarm Optimization (HFPSO), hybrid Simulated Annealing and Genetic Algorithm (SAGA), Hybrid Particle Swarm Optimization and Genetic Algorithm (HFPSO), hybrid Particle Swarm Optimization and Grey Wolf Optimization (PSOGWO), and closely related Hybrid Sperm Swarm Optimization and Gravitational Search Algorithm (HSSOGSA). The results are evaluated in terms of each method’s best fitness, mean, standard deviation, and convergence rates. The numerical experiment results show that HSSOGA has better convergence towards the true global optimum values as compared to the conventional and existing hybrid methods in most unimodal and multimodal test function problems.

In this paper, a multi-objective hybrid firefly and particle swarm optimization (MOHFPSO) was proposed for different multi-objective optimal power flow (MOOPF) problems. Optimal power flow (OPF) was formulated as a non-linear problem with various objectives and constraints. Pareto optimal front was obtained by using non-dominated sorting and crowding distance methods. Finally, an optimal compromised solution was selected from the Pareto optimal set by applying an ideal distance minimization method. The efficiency of the proposed MOHFPSO technique was tested on standard IEEE 30-bus and IEEE 57-bus test systems with various conflicting objectives. Simulation results were also compared with non-dominated sorting based multi-objective particle swarm optimization (MOPSO) and different optimization algorithms reported in the current literature. The achieved results revealed the potential of the proposed algorithm for MOOPF problems.

In this study, a nonlinear Archimedes wave swing (AWS) energy conversion system was employed to enable the use of irregular sea waves to provide useful electricity. Instead of the conventional PI controllers used in prior research, this study employed fractional-order PID (FOPID) controllers to control the back-to-back configuration of AWS. The aim was to maximize the energy yield from waves and maintain the grid voltage and the capacitor DC link voltage at predetermined values. In this study, six FOPID controllers were used to accomplish the control goals, leading to an array of thirty parameters required to be fine-tuned. In this regard, a hybrid jellyfish search optimizer and particle swarm optimization (HJSPSO) algorithm was adopted to select the optimal control gains. Verification of the performance of the proposed FOPID control system was achieved by comparing the system results to two conventional PID controllers and one FOPID controller. The conventional PID controllers were tuned using a recently presented metaheuristic algorithm called the Coot optimization algorithm (COOT) and the classical particle swarm optimization algorithm (PSO). Moreover, the FOPID was also tuned using the well-known genetic algorithm (GA). The system investigated in this study was subjected to various unsymmetrical and symmetrical fault disturbances. When compared with the standard COOT-PID, PSO-PID, and GA-FOPID controllers, the HJSPSO-FOPID results show a significant improvement in terms of performance and preserving control goals during system instability

In this paper, we present a Hybrid Particle Swarm Optimization (HPSO) algorithm that combines the Particle Swarm Optimization (PSO) algorithm with the Genetic Algorithm (GA) method. The algorithm is used for investigating the plastic deformation behavior of titanium alloy (Ti-6Al-4V) in a multi-hole extrusion process. The simulation used rigid-plastic finite element (FE) DEFORMTM-3D software to obtain the minimum mandrel bias angle and exit tube bending angle. Results of the simulation indicate that these two angles were significantly less than 0.3 degrees, suggesting that metaheuristic algorithms based on HPSO and FE analysis could be used for general multi-hole extrusion processes.KeywordsMulti-hole extrusionParticle Swarm OptimizationFinite elementGenetic Algorithm

This article proposes the hybrid Nelder–Mead (NM)–Particle Swarm Optimization (PSO) algorithm based on the NM simplex search method and PSO for the optimization of multimodal functions. The hybrid NM–PSO algorithm is very easy to implement, in practice, since it does not require gradient computation. This hybrid procedure performed the exploration with PSO and the exploitation with the NM simplex search method. In a suite of 17 multi-optima test functions taken from the literature, the computational results via various experimental studies showed that the hybrid NM–PSO approach is superior to the two original search techniques (i.e. NM and PSO) in terms of solution quality and convergence rate. In addition, the presented algorithm is also compared with eight other published methods, such as hybrid genetic algorithm (GA), continuous GA, simulated annealing (SA), and tabu search (TS) by means of a smaller set of test functions. On the whole, the new algorithm is demonstrated to be extremely effective and efficient at locating best-practice optimal solutions for multimodal functions.

This paper introduces a new algorithmic nature inspired approach that uses a hybridized Particle Swarm Optimization algorithm with a new neighborhood topology for successfully solving the Feature Selection Problem (FSP). The Feature Selection Problem is an interesting and important topic which is relevant for a variety of database applications. The proposed algorithm for the solution of the FSP, the Particle Swarm Optimization with Expanding Neighborhood Topology (PSOENT), combines a Particle Swarm Optimization (PSO) algorithm and the Variable Neighborhood Search (VNS) strategy. As, in general, the structure of the social network affects strongly a PSO algorithm, the proposed method by using an expanding neighborhood topology manages to increase the performance of the algorithm. As the algorithm starts from a small size neighborhood and by increasing (expanding) the size of the neighborhood, it ends to a neighborhood that includes all the swarm, it manages to take advantage of the exploration capabilities of a global neighborhood structure and of the exploitation abilities of a local neighborhood structure. In order to test the effectiveness and the efficiency of the proposed method we use data sets of different sizes and compare the proposed method with a number of other PSO algorithms and other algorithms from the literature.

Novel Artificial Human Optimization Field Algorithms - The Beginning

This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.

Production scheduling optimization in foundry using hybrid Particle Swarm Optimization algorithm

A multi-compartment vehicle routing problem with time windows for urban distribution – A comparison study on particle swarm optimization algorithms

Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a novel hybrid PSO – evolutionary algorithm for solving the well known geometrical place problems. Finding the geometrical place could be sometimes a hard task. In almost all situations the geometrical place consists more than one single point. The performance of the newly proposed PSO algorithm is compared with evolutionary algorithms. The main advantage of the PSO technique is its speed of convergence. Also, we propose a hybrid algorithm, combining PSO and evolutionary algorithms. The hybrid combination is able to detect the geometrical place very fast for which the evolutionary algorithms required more time and the conventional PSO approach even failed to find the real geometrical place.

A new hybrid Particle Swarm Optimization (PSO) algorithm is proposed in this paper based on the Nonlinear Simplex Search (NSS) method for multimodal function optimizing tasks. At late stage of PSO process, when the most promising regions of solutions are fixed, the algorithm isolates particles that fly very close to the extrema and applies the NSS method to them to enhance local exploitation searching. Explicit experimental results on famous benchmark functions indicate that this approach is reliable and efficient, especially on multimodal function optimizations. It yields better solution qualities and success rates compared to other three published methods.KeywordsParticle Swarm OptimizationParticle Swarm Optimization AlgorithmSwarm IntelligenceBenchmark FunctionMultimodal FunctionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

COVID-19, one of the most dangerous pandemics, is currently affecting humanity. COVID-19 is spreading rapidly due to its high reliability transmissibility. Patients who test positive more often have mild to severe symptoms such as a cough, fever, raw throat, and muscle aches. Diseased people experience severe symptoms in more severe cases. such as shortness of breath, which can lead to respiratory failure and death. Machine learning techniques for detection and classification are commonly used in current medical diagnoses. However, for treatment using neural networks based on improved Particle Swarm Optimization (PSO), known as PSONN, the accuracy and performance of current models must be improved. This hybridization implements Particle Swarm Optimization and a neural network to improve results while slowing convergence and improving efficiency. The purpose of this study is to contribute to resolving this issue by presenting the implementation and assessment of Machine Learning models. Using Neural Networks and Particle Swarm Optimization to help in the detection of COVID-19 in its early stages. To begin, we preprocessed data from a Brazilian dataset consisted primarily of early-stage symptoms. Following that, we implemented Neural Network and Particle Swarm Optimization algorithms. We used precision, accuracy score, recall, and F-Measure tests to evaluate the Neural Network with Particle Swarm Optimization algorithms. Based on the comparison, this paper grouped the top seven ML models such as Neural Networks, Logistic Regression, Nave Bayes Classifier, Multilayer Perceptron, Support Vector Machine, BF Tree, Bayesian Networks algorithms and measured feature importance, and other, to justify the differences between classification models. Particle Swarm Optimization with Neural Network is being deployed to improve the efficiency of the detection method by more accurately predicting COVID-19 detection. Preprocessed datasets with important features are then fed into the testing and training phases as inputs. Particle Swarm Optimization was used for the training phase of a neural net to identify the best weights and biases. On training data, the highest rate of accuracy gained is 0.98.738 and on testing data, it is 98.689.

In our previous research applied to the job shop scheduling problem (JSSP) for machine tool production, the multi-objective optimisation model based on the particle swarm optimization (PSO) research had an imbalance performance between the convergence rate and the convergence precision. In this article, a new hybrid algorithm using PSO and generic algorithm (GA) is proposed to solve this particular problem. In this new algorithm, named hybrid PSO-GA algorithm (HPGA), the PSO algorithm is redefined and modified by introducing genetic operators, i.e. the crossover operator and the mutation operator, to update the particles in the population. The HPGA is then applied in heavy machinery company with minimising machines’ makespan and minimising jobs’ tardiness as the two optimal objectives. The comparisons with actual application report have illustrated that the proposed HPGA can obtain higher quality of schedule solution for machine tool production. Furthermore, with solution quality and convergence rate as the two estimation measurements metrics, some comparisons are performed in order to illustrate that the HPGA has superiority over the PSO, GA and simulated annealing algorithm (SA). Results have indicated that, with the combination of the merits of PSO and GA, the proposed HPGA approach can achieve not only better solution quality but also faster convergence rate than the PSO, GA and SA, within a reasonable computation time for high dimensions JSSP.