Multi-objective optimization of job shops with automated guided vehicles: A non-dominated sorting cuckoo search algorithm

Author(s):  
Behzad Karimi ◽  
Seyed Taghi Akhavan Niaki ◽  
Amir Hossein Niknamfar ◽  
Mahsa Gareh Hassanlu

The reliability of machinery and automated guided vehicle has been one of the most important challenges to enhance production efficiency in several manufacturing systems. Reliability improvement would result in a simultaneous reduction of both production times and transportation costs of the materials, especially in automated guided vehicles. This article aims to conduct a practical multi-objective reliability optimization model for both automated guided vehicles and the machinery involved in a job-shop manufacturing system, where different machines and the storage area through some parallel automated guided vehicles handle materials, parts, and other production needs. While similar machines in each shop are limited to failures based on either an Exponential or a Weibull distribution via a constant rate, the machines in different shops fail based on different failure rates. Meanwhile, as the model does not contain any closed-form equation to measure the machine reliability in the case of Weibull failure, a simulation approach is employed to estimate the shop reliability to be further maximized using the proposed model. Besides, the automated guided vehicles are restricted to failures according to an Exponential distribution. Furthermore, choosing the best locations of the shops is proposed among some potential places. The proposed NP-Hard problem is then solved by designing a novel non-dominated sorting cuckoo search algorithm. Furthermore, a multi-objective teaching-learning-based optimization, as well as a multi-objective invasive weed optimization are designed to validate the results obtained. Ultimately, a novel AHP-TOPSIS method is carried out to rank the algorithms in terms of six performance metrics.

Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.


2018 ◽  
Vol 189 ◽  
pp. 06001 ◽  
Author(s):  
Fathy Elkazzaz ◽  
Abdelmageed Mahmoud ◽  
Ali Maher

A meta-heuristic algorithm called, the cuckoo search algorithm is proposed in dealing with the multi-objective supply chain model to find the optimum configuration of a given supply chain problem which minimizes the total cost and the total lead-time. The supply chain problem utilized in this study is taken from literature to show the performance of the proposed model; in addition, the results have been compared to those achieved by the bee colony optimization algorithm and genetic algorithm. Those obtained results indicate that the proposed cuckoo search algorithm is able to get better Pareto solutions (non-dominated set) for the supply chain problem.


2020 ◽  
Vol 51 (1) ◽  
pp. 143-160
Author(s):  
Liang Chen ◽  
Wenyan Gan ◽  
Hongwei Li ◽  
Kai Cheng ◽  
Darong Pan ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document