•  
  •  
 

Al-Bahir Journal for Engineering and Pure Sciences

Abstract

This research applies the Cuckoo Search Algorithm, specifically the Original Cuckoo Search(CS), Improved Cuckoo Search(ICS), and Global Feedback cuckoo search(GFCS) with different values of parameters instead of using a fixed value of probability a banda (Pa) which equal to 0.25 by another researcher to solve the problem of Job Shop Scheduling. The goal is to modify the method to improve its effectiveness and total completion time (Makespan) using benchmark datasets for basic scheduling problems, and suggest using the Cauchy distribution, with its ability to generate random numbers from distant points, and the stronger perturbation ability of Cauchy variation compared to Gaussian variation, along with Levy flight, effectively prevent the cuckoo algorithm from falling into local optima. Notably, when the step size is 0.1 and Pa is 0.1, with a population of 10 and 100 iterations, GFCS obtains the ideal Makespan of 140 when applied to the (20x20) set. Also, the Cauchy distribution for the CS produces the best results compared levy distribution that increases the variety of the nests, enabling escape from regional extreme values and fostering global search.

References

[1] Wong WK, Ming CI. A review on metaheuristic algorithms: recent trends, benchmarking and applications. In2019 7th International Conference on Smart Computing & Communications (ICSCC) 2019 Jun 28 (pp. 1-5). IEEE, http://dx.doi.org/10.1109/ICSCC.2019.8843624 .

[2] Talbi EG. Metaheuristics: from design to implementation. John Wiley & Sons; 2009 May 27, http://dx.doi.org/10.1002/9780470496916 .

[3] Zhang D, You X, Liu S, Pan H. Dynamic multi-role adaptive collaborative ant colony optimization for robot path planning. IEEE Access. 2020 Jul 15;8:129958-74, http://dx.doi.org/10.1109/ACCESS.2020.3009399 .

[4] Joshi AS, Kulkarni O, Kakandikar GM, Nandedkar VM. Cuckoo search optimization-a review. Materials Today: Proceedings. 2017 Jan 1;4(8):7262-9, http://dx.doi.org/10.1016/j.matpr.2017.07.055 .

[5] Yang XS, editor. Cuckoo search and firefly algorithm: theory and applications. Springer; 2013 Oct 31, http://dx.doi.org/10.1007/978-3-319-02141-6 .

[6] Rakhshani H, Rahati A. Snap-drift cuckoo search: A novel cuckoo search optimization algorithm. Applied Soft Computing. 2017 Mar 1;52:771-94, http://dx.doi.org/10.1016/j.asoc.2016.09.048 .

[7] Arisha A, Young P, El Baradie M. Job shop scheduling problem: an overview, https://doi.org/10.21427/D7WN5Q .

[8] Brucker P, Burke EK, Groenemeyer S. A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers & Operations Research. 2012 Dec 1;39(12):3200-14, https://doi.org/10.21427/D7WN5Q .

[9] Ouaarab, A., Ahiod, B., & Yang, X. S. (2014). Discrete cuckoo search applied to job shop scheduling problem. In Recent advances in swarm intelligence and evolutionary computation (pp. 121-137). Cham: Springer International Publishing, http://dx.doi.org/10.1007/978-3-319-13826-8_7 .

[10] Zheng, H., & Zhou, Y. (2013). A cooperative coevolutionary cuckoo search algorithm for optimization problem. Journal of Applied Mathematics, 2013, https://doi.org/10.1155/2013/912056 .

[11] Al Daoud E. A hybrid algorithm using a genetic algorithm and cuckoo search algorithm to solve the traveling salesman problem and its application to multiple sequence alignment. International Journal of Advanced Science and Technology. 2013 Dec;61:29-38, http://dx.doi.org/10.14257/ijast.2013.61.04 .

[12] Ong, P. (2014). Adaptive cuckoo search algorithm for unconstrained optimization. The Scientific World Journal, 2014.

[13] Fateen, S. E. K., & Bonilla-Petriciolet, A. (2014). Gradient-based cuckoo search for global optimization. Mathematical Problems in Engineering, https://doi.org/10.1155/2014/943403 .

[14] Kamoona, A. M., Patra, J. C., & Stojcevski, A. (2018, July). An enhanced cuckoo search algorithm for solving optimization problems. In 2018 IEEE Congress on Evolutionary Computation (CEC) (pp. 1-6), http://dx.doi.org/10.1109/CEC.2018.8477784 .

[15] Taillard, E. (1993). Benchmarks for basic scheduling problems. European journal of operational research, 64(2), pp.278-285, https://doi.org/10.1016/0377-2217(93)90182-M .

[17] Fateen SE, Bonilla-Petriciolet A. Gradient-based cuckoo search for global optimization. Mathematical Problems in Engineering. 2014 Jan 1;2014, http://dx.doi.org/10.1155/2014/493740 .

Download

Share

COinS