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.
In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of
... Show MoreSensibly highlighting the hidden structures of many real-world networks has attracted growing interest and triggered a vast array of techniques on what is called nowadays community detection (CD) problem. Non-deterministic metaheuristics are proved to competitively transcending the limits of the counterpart deterministic heuristics in solving community detection problem. Despite the increasing interest, most of the existing metaheuristic based community detection (MCD) algorithms reflect one traditional language. Generally, they tend to explicitly project some features of real communities into different definitions of single or multi-objective optimization functions. The design of other operators, however, remains canonical lacking any inte
... Show MoreThis study revolves around the rapid changes of science and a comparison of the formal and practical aspects and the reason behind summoning the changes and their types, which are subject to the influence of the recipient. This transformation represents formal and intellectual production cycles and formal functional generation that is subject to the goals of the system of multiple differences at the level of time and place. It meets the needs and the request for change, but access to it comes through multiple systems and portals that are different from the normal and the usual, so this study was called (meta and its dimensions in the designed biological formation (virtual reality environment - a model). The research seeks to find solutio
... Show MoreMaximizing the net present value (NPV) of oil field development is heavily dependent on optimizing well placement. The traditional approach entails the use of expert intuition to design well configurations and locations, followed by economic analysis and reservoir simulation to determine the most effective plan. However, this approach often proves inadequate due to the complexity and nonlinearity of reservoirs. In recent years, computational techniques have been developed to optimize well placement by defining decision variables (such as well coordinates), objective functions (such as NPV or cumulative oil production), and constraints. This paper presents a study on the use of genetic algorithms for well placement optimization, a ty
... Show MoreDylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism.
Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and
... Show MoreDylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism. Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and the emotional involvement in the dynamics of life. In "Light Breaks
... Show More