Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state will generate only one in next state that will make the search slower and the drawback is that the search may fall in local minimum which represents the best solution in only part of the solution space. In order to enhance its performance and alleviate the deficiencies in the problem solving, a modified (MD) is proposed. We attempt to augment the search space by starting with solutions, instead of one solution. To analyses and investigate the operations of the MSA with the standard and harmony search (HS), the real performance of an industrial company and simulation are made for evaluation. The results show that, compared to and , offers better quality solutions with regard to convergence and accuracy.
In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot. Simulation results, whi
... Show MoreThe research presents a case study of collecting materials and raw materials in a visual space that allows them to form a perception and meanings that inform the recipient by reconstructing them and inserting them into the surface of the artistic work and in such a way that the aesthetic act consists of a variety of media, touches and surfaces. The overlap of races within an environment characterized by unity. That is why the researcher in chapter one presented the problem of research, and the focus was on studying the multiplicity of materials and their aesthetic and functional role in the structure of creative work. The aim of the research is enhanced to identify the aesthetic performance function of the multiplicity of ores in the col
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreABSTRUCT
This research aims at examining the expected gap between the fact of planning and controlling process of production at the State Company for Electric Industries and implementation of material requirements planning system in fuzzy environment. Developing solutions to bridge the gap is required to provide specific mechanisms subject to the logic of fuzzy rules that will keep pace with demand for increased accuracy and reduced waiting times depending on demand forecast, investment in inventory to reduce costs to a minimum.
The proposed solutions for overcoming the research problem has required some questions reflecting the problem with its multiple dimensions, which ar
... Show MoreThe aim of this paper, is to design multilayer Feed Forward Neural Network(FFNN)to find the approximate solution of the second order linear Volterraintegro-differential equations with boundary conditions. The designer utilized to reduce the computation of solution, computationally attractive, and the applications are demonstrated through illustrative examples.
In this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.
This study presents the execution of an iterative technique suggested by Temimi and Ansari (TA) method to approximate solutions to a boundary value problem of a 4th-order nonlinear integro-differential equation (4th-ONIDE) of the type Kirchhoff which appears in the study of transverse vibration of hinged shafts. This problem is difficult to solve because there is a non-linear term under the integral sign, however, a number of authors have suggested iterative methods for solving this type of equation. The solution is obtained as a series that merges with the exact solution. Two examples are solved by TA method, the results showed that the proposed technique was effective, accurate, and reliable. Also, for greater reliability, the approxim
... Show MoreThis paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP). The given BVP is written in its discrete (DI) weak form (WEF), and is proved that it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system (GNAS). In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results
... Show More