In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.
Abstract
In this work, two algorithms of Metaheuristic algorithms were hybridized. The first is Invasive Weed Optimization algorithm (IWO) it is a numerical stochastic optimization algorithm and the second is Whale Optimization Algorithm (WOA) it is an algorithm based on the intelligence of swarms and community intelligence. Invasive Weed Optimization Algorithm (IWO) is an algorithm inspired by nature and specifically from the colonizing weeds behavior of weeds, first proposed in 2006 by Mehrabian and Lucas. Due to their strength and adaptability, weeds pose a serious threat to cultivated plants, making them a threat to the cultivation process. The behavior of these weeds has been simulated and used in Invas
... Show MoreOptimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol
This paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.
In this paper, we consider inequalities in which the function is an element of n-th partially order space. Local and Global uniqueness theorem of solutions of the n-the order Partial differential equation Obtained which are applications of Gronwall's inequalities.