A Hybrid Particle Swarm Optimization Algorithm Enhanced with Nonlinear Inertial Weight and Gaussian Mutation for Job Shop Scheduling Problems

Abstract

Job shop scheduling problem (JSSP) has high theoretical and practical significance in academia and manufacturing respectively. Therefore, scholars in many different fields have been attracted to study this problem, and many meta-heuristic algorithms have been proposed to solve this problem. As a meta-heuristic algorithm, particle swarm optimization (PSO) has been used to optimize many practical problems in industrial manufacturing. This paper proposes a hybrid PSO enhanced with nonlinear inertia weight and and Gaussian mutation (NGPSO) to solve JSSP. Nonlinear inertia weight improves local search capabilities of PSO, while Gaussian mutation strategy improves the global search ability of NGPSO, which is beneficial to the population to maintain diversity and reduce probability of the algorithm falling into the local optimal solution. The proposed NGPSO algorithm is implemented to solve 62 benchmark instances of JSSP, and the experimental results are compared with other algorithms. The results obtained by analyzing the experimental data show that the algorithm is better than other comparison algorithms in solving JSSP.

A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem

“…The considered instances were FT [45], LA [46], ORB [56] and ABZ [57]. GIFA results were compared with other approaches in related works: mXLSGA [13], NGPSO [44], SSS [43], GA-CPG-GT [32], DWPA [58], GWO [59], IPB-GA [31], aLSGA [20], among others.…”

“…Several meta-heuristics have been proposed in the literature to treat the JSSP, such as GA [11,13,15,20,[29][30][31][32][33][34][35]; Simulated Annealing [36,37]; Hybrid social spider optimization [38]; Harris hawk optimizer [39]; Grey Wolf Optimization [40]; Bat Algorithm [41]; Chicken Swarm Optimization [42], Single seekers society: [43] and Particle Swarm Optimization: [44]. However, GAs remain one of the most common approaches used in resolving JSSPs.…”

“…Yu et al [44] proposed an improved hybrid PSO with non-linear inertia weight and Gaussian mutation (NGPSO) to solve the JSSP. The nonlinear inertia weight was added to the method in order to improve the local search capability and the Gaussian mutation was added in order to improve the global search capability.…”

“…In detail, in this second situation, we consider relevant and recent methods which deal with the JSSP with the same specific instances and, when existing, presented in papers published in the last three years. In all, we consider for comparison the following methods: mXLSGA [13], NGPSO [44], SSS [43], GA-CPG-GT [32], DWPA [58], MeCSO [42], GWO [59], IPB-GA [31], NIMGA [60], aLSGA [20], PaGA [61]. The proposed algorithm is coded in MATLAB and we performed the evaluations on a computer with 2.4GHz Intel(R) Core i7 CPU and 16GB of RAM.…”

H-PSO Routing Optimization Model for Zoomlion Ghana Limited

“…The current state of waste management leaves much to be desired. Less than 40% of urban residents are served with solid waste collection services and less than 30% by an acceptable household toilet facility [16]. The traditionally applied methods of dealing with wastes have been unsuccessful, and the resulting contamination of water and land has led to growing concern over the absence of an integrated approach to waste management in the country [14].…”