The operation of production planning is a difficult operation and it's required High effect and large time especially it is dynamic activity which it's basic variables change in continuous with the time, for this reason it needs using one of the operation research manner (Dynamic programming) which has a force in the decision making process in the planning and control on the production and its direct affect on the cost of production operation and control on the inventory.

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

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

This 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

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

In contemporary cities, the expansion of the use of vehicles has led to the deterioration of the urban environment. To counter this, many concepts and strategies emerged that attempted to regulate mobility in cities and limit its effects. The concept of a "complete street" is one of the modern trends concerned with diversifying means of transportation and reducing the disadvantages of mechanical transportation methods This paper discusses the role that complete streets can play in developing the urban environment in the Alyarmok District of Baghdad, which suffers from traffic congestion and its associated problems.In this study, 104 people were surveyed in the Alyarmok region, and the linear regression method was used to analyze their op

The study of fixed points on the  maps fulfilling certain contraction requirements has several applications and has been the focus of numerous research endeavors. On the other hand, as an extension of the idea of the best approximation, the best proximity point (ƁƤƤ) emerges. The best approximation theorem ensures the existence of an approximate solution; the best proximity point theorem is considered for addressing the problem in order to arrive at an optimum approximate solution. This paper introduces a new kind of proximal contraction mapping and establishes the best proximity point theorem for such mapping in fuzzy normed space ( space). In the beginning, the concept of the best proximity point was introduced. The concept of prox

Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .