Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best solution. When it is the better one, it replaces with the artificial fish swarm solution from which this solution was improvised. Meanwhile the best improvised solutions are carried over to the Harmony Memory. The objective is to minimize a total completion time (makespan) and to make the proposed approach as a portion of the expert and the intelligent scheduling system for remanufacturing decision support. Harmony search algorithm has demonstrated to be efficient, simple and strong optimization algorithm. The ability of exploration in any optimization algorithm is one of the key points. The obtained optimization results show that the proposed algorithm provides better exploitation ability and enjoys fast convergence to the optimum solution. As well, comparisons with the original artificial fish swarm algorithm demonstrate improved efficiency.
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
... Show MoreFinding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)
... Show MoreThis paper presents a robust algorithm for the assessment of risk priority for medical equipment based on the calculation of static and dynamic risk factors and Kohnen Self Organization Maps (SOM). Four risk parameters have been calculated for 345 medical devices in two general hospitals in Baghdad. Static risk factor components (equipment function and physical risk) and dynamics risk components (maintenance requirements and risk points) have been calculated. These risk components are used as an input to the unsupervised Kohonen self organization maps. The accuracy of the network was found to be equal to 98% for the proposed system. We conclude that the proposed model gives fast and accurate assessment for risk priority and it works as p
... Show MoreA model using the artificial neural networks and genetic algorithm technique is developed for obtaining optimum dimensions of the foundation length and protections of small hydraulic structures. The procedure involves optimizing an objective function comprising a weighted summation of the state variables. The decision variables considered in the optimization are the upstream and downstream cutoffs lengths and their angles of inclination, the foundation length, and the length of the downstream soil protection. These were obtained for a given maximum difference in head, depth of impervious layer and degree of anisotropy. The optimization carried out is subjected to constraints that ensure a safe structure aga
... Show MoreThe cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but in this paper, the researcher proposed five pile types, one of them is not a traditional, and developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with t
... Show More