A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)

References

• Afshar-Nadjafi, B. 2014. “An Iterated Local Search Algorithm for Estimating the Parameters of the Gamma/Gompertz Distribution.” Modelling and Simulation in Engineering 2014 (1): 1–7. doi:10.1155/2014/629693.
   Google Scholar
• Akram, K., K. Kamal, and A. Zeb. 2016. “Fast Simulated Annealing Hybridized with Quenching for Solving Job Shop Scheduling Problem.” Applied Soft Computing 49: 510–523. doi:10.1016/j.asoc.2016.08.037.
   Web of Science ®Google Scholar
• Auger, A., and N. Hansen. 2005. “A Restart CMA Evolution Strategy with Increasing Population Size.” In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, 1769–1776. Piscataway, NJ: IEEE Press.
   Google Scholar
• Avci, M., and S. Topaloglu. 2017. “A Multi-start Iterated Local Search Algorithm for the Generalized Quadratic Multiple Knapsack Problem.” Computers & Operations Research 83: 54–65. doi:10.1016/j.cor.2017.02.004.
   Web of Science ®Google Scholar
• Awad, N. H., M. Z. Ali, J. J. Liang, B. Y. Qu, and P. N. Suganthan. 2016. “Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization.” Technical Report, Nanyang Technological University, Singapore.
   Google Scholar
• Badem, H., A. Basturk, A. Caliskan, and M. E. Yuksel. 2017. “A New Efficient Training Strategy for Deep Neural Networks by Hybridization of Artificial Bee Colony and Limited–Memory BFGS Optimization Algorithms.” Neurocomputing 266: 506–526. doi:10.1016/j.neucom.2017.05.061.
   Web of Science ®Google Scholar
• Ballestin, F., and N. Trautmann. 2008. “An Iterated-Local-Search Heuristic for the Resource-Constrained Weighted Earliness-Tardiness Project Scheduling Problem.” International Journal of Production Research 46 (22): 6231–6249. doi:10.1080/00207540701420560.
   Web of Science ®Google Scholar
• Biedrzycki, R. 2017. “ A Version of IPOP-CMA-ES Algorithm with Midpoint for CEC 2017 Single Objective Bound Constrained Problems.” In Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 1489–1494. Piscataway, NJ: IEEE.
   Google Scholar
• Biglari, F. 2015. “Dynamic Scaling on the Limited Memory BFGS Method.” European Journal of Operational Research 243 (3): 697–702. doi:10.1016/j.ejor.2014.12.050.
   Web of Science ®Google Scholar
• Brest, J., M. S. Maučec, and B. Bošković. 2016. “iL-SHADE: Improved L-SHADE Algorithm for Single Objective Real-Parameter Optimization.” In Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), 1188–1195. Piscataway, NJ: IEEE.
   Google Scholar
• Brest, J., M. S. Maučec, and B. Bošković. 2017. “ Single Objective Real-Parameter Optimization: Algorithm jSO.” In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), 1311–1318. Piscataway, NJ: IEEE.
   Google Scholar
• Chen, S.-M., A. Sarosh, and Y.-F. Dong. 2012. “Simulated Annealing Based Artificial Bee Colony Algorithm for Global Numerical Optimization.” Applied Mathematics and Computation 219 (8): 3575–3589. doi:10.1016/j.amc.2012.09.052.
   Web of Science ®Google Scholar
• Cui, L. Z., G. H. Li, Q. Z. Lin, J. Y. Chen, and N. Lu. 2016. “Adaptive Differential Evolution Algorithm with Novel Mutation Strategies in Multiple Sub-populations.” Computers & Operations Research 67: 155–173. doi:10.1016/j.cor.2015.09.006.
   Web of Science ®Google Scholar
• Cui, L. Z., G. H. Li, Q. Z. Lin, Z. H. Du, W. F. Gao, J. Y. Chen, and N. Lu. 2016. “A Novel Artificial Bee Colony Algorithm with Depth-First Search Framework and Elite-Guided Search Equation.” Information Sciences 367–368: 1012–1044. doi:10.1016/j.ins.2016.07.022.
   Web of Science ®Google Scholar
• Cui, L. Z., G. H. Li, X. Z. Wang, Q. Z. Lin, J. Y. Chen, N. Lu, and J. Lu. 2017. “A Ranking-Based Adaptive Artificial Bee Colony Algorithm for Global Numerical Optimization.” Information Sciences 417: 169–185. doi:10.1016/j.ins.2017.07.011.
   Web of Science ®Google Scholar
• Dong, X. Y., P. Chen, H. K. Huang, and M. Nowak. 2013. “A Multi-restart Iterated Local Search Algorithm for the Permutation Flow Shop Problem Minimizing Total Flow Time.” Computers & Operations Research 40 (2): 627–632. doi:10.1016/j.cor.2012.08.021.
   Web of Science ®Google Scholar
• Dong, X. Y., H. K. Huang, and P. Chen. 2009. “An Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime Criterion.” Computers & Operations Research 36 (5): 1664–1669. doi:10.1016/j.cor.2008.04.001.
   Web of Science ®Google Scholar
• Essafi, I., Y. Mati, and S. Dauzere-Peres. 2008. “A Genetic Local Search Algorithm for Minimizing Total Weighted Tardiness in the Job-Shop Scheduling Problem.” Computers & Operations Research 35 (8): 2599–2616. doi:10.1016/j.cor.2006.12.019.
   Web of Science ®Google Scholar
• Ezugwu, A. E.-S., A. O. Adewumi, and M. E. Frîncu. 2017. “Simulated Annealing Based Symbiotic Organisms Search Optimization Algorithm for Traveling Salesman Problem.” Expert Systems with Applications 77: 189–210. doi:10.1016/j.eswa.2017.01.053.
   Web of Science ®Google Scholar
• Garcia, S., D. Molina, M. Lozano, and F. Herrera. 2009. “A Study on the Use of Non-Parametric Tests for Analyzing the Evolutionary Algorithms’ Behaviour: A Case Study on the CEC’2005 Special Session on Real Parameter Optimization.” Journal of Heuristics 15 (6): 617–644. doi:10.1007/s10732-008-9080-4.
   Web of Science ®Google Scholar
• Gunawan, A., K. M. Ng, G. Kendall, and J. H. Lai. 2018. “An Iterated Local Search Algorithm for the Team Orienteering Problem with Variable Profits.” Engineering Optimization 50 (7): 1148–1163. doi:10.1080/0305215x.2017.1417398.
   Web of Science ®Google Scholar
• Holland, J. H. 1992. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Cambridge, MA: MIT Press.
   Google Scholar
• Javidrad, F., and M. Nazari. 2017. “A New Hybrid Particle Swarm and Simulated Annealing Stochastic Optimization Method.” Applied Soft Computing 60: 634–654. doi:10.1016/j.asoc.2017.07.023.
   Web of Science ®Google Scholar
• Kennedy, J., and R. Eberhart. 1995. “Particle Swarm Optimization.” Proceedings of ICNN’95 - international conference on neural networks, November 27–December 1.
   Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680. doi:10.1126/science.220.4598.671.
   PubMed Web of Science ®Google Scholar
• Kramer, O. 2010. “Iterated Local Search with Powell’s Method: A Memetic Algorithm for Continuous Global Optimization.” Memetic Computing 2 (1): 69–83. doi:10.1007/s12293-010-0032-9.
   Google Scholar
• Kumar, A., R. K. Misra, and D. Singh. 2017. “Improving the Local Search Capability of Effective Butterfly Optimizer using Covariance Matrix Adapted Retreat Phase.” In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), 1835–1842. Piscataway, NJ: IEEE.
   Google Scholar
• Li, G. H., Q. Z. Lin, L. Z. Cui, Z. H. Du, Z. P. Liang, J. Y. Chen, N. Lu, and Z. Ming. 2016. “A Novel Hybrid Differential Evolution Algorithm with Modified CoDE and JADE.” Applied Soft Computing 47: 577–599. doi:10.1016/j.asoc.2016.06.011.
   Web of Science ®Google Scholar
• Li, J., P. M. Pardalos, H. Sun, J. Pei, and Y. Zhang. 2015. “Iterated Local Search Embedded Adaptive Neighborhood Selection Approach for the Multi-depot Vehicle Routing Problem with Simultaneous Deliveries and Pickups.” Expert Systems with Applications 42 (7): 3551–3561. doi:10.1016/j.eswa.2014.12.004.
   Web of Science ®Google Scholar
• Lourenço, H. R., O. C. Martin, and T. Stützle. 2010. “Iterated Local Search: Framework and Applications.” In Handbook of Metaheuristics, 363–397. Boston, MA: Springer.
   Google Scholar
• Lozano, M., and C. Garcia-Martinez. 2008. “An Evolutionary ILS-Perturbation Technique.” Paper presented at the 5th International Workshop on Hybrid Metaheuristics, HM 2008, Malaga, Spain, October 8–9.
   Google Scholar
• Martins, I. C., R. G. S. Pinheiro, F. Protti, and L. S. Ochi. 2015. “A Hybrid Iterated Local Search and Variable Neighborhood Descent Heuristic Applied to the Cell Formation Problem.” Expert Systems with Applications 42 (22): 8947–8955. doi:10.1016/j.eswa.2015.07.050.
   Web of Science ®Google Scholar
• Michiels, W., E. Aarts, and J. Korst. 2007. Theoretical Aspects of Local Search. Berlin Heidelberg: Springer Science & Business Media.
   Google Scholar
• Mohamed, A. W., A. A. Hadi, A. M. Fattouh, and K. M. Jambi. 2017. “LSHADE with Semi-Parameter Adaptation Hybrid with CMA-ES for Solving CEC 2017 Benchmark Problems.” In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), 145–152. Piscataway, NJ: IEEE.
   Google Scholar
• Molina, D., A. Latorre, and F. Herrera. 2018. “SHADE with Iterative Local Search for Large-Scale Global Optimization.” In 2018 IEEE Congress on Evolutionary Computation (CEC), 1–8. Piscataway, NJ: IEEE.
   Google Scholar
• Nguyen, T. T., and X. Yao. 2008. “An Experimental Study of Hybridizing Cultural Algorithms and Local Search.” International Journal of Neural Systems 18 (1): 1–17. doi:10.1142/S0129065708001397.
   PubMed Web of Science ®Google Scholar
• Nguyen, S., M. J. Zhang, M. Johnston, and K. C. Tan. 2015. “Automatic Programming via Iterated Local Search for Dynamic Job Shop Scheduling.” IEEE Transactions on Cybernetics 45 (1): 1–14. doi:10.1109/TCYB.2014.2317488.
   PubMed Web of Science ®Google Scholar
• Nobile, M. S., A. Tangherloni, D. Besozzi, and P. Cazzaniga. 2016. “GPU-Powered and Settings-Free Parameter Estimation of Biochemical Systems.” In Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), 32–39. Piscataway, NJ: IEEE.
   Google Scholar
• Nocedal, J., and S. J. Wright. 1999. Numerical Optimization. Berlin and New York: Springer-Verlag.
   Google Scholar
• Qin, T., B. Peng, U. Benlic, T. C. E. Cheng, Y. Wang, and Z. P. Lü. 2015. “Iterated Local Search Based on Multi-type Perturbation for Single-Machine Earliness/Tardiness Scheduling.” Computers & Operations Research 61: 81–88. doi:10.1016/j.cor.2015.03.005.
   Web of Science ®Google Scholar
• Shao, W. S., S. Li, M. Li, Z. S. Shao, and X. F. Ying. 2014. “Hybrid Differential Evolution/Estimation of Distribution Algorithm Based on Adaptive Incremental Learning.” Journal of Computational Information Systems 10 (12): 5355–5364. doi:10.12733/jcis10739.
   Google Scholar
• Shao, W. S., and D. C. Pi. 2016. “A Self-Guided Differential Evolution with Neighborhood Search for Permutation Flow Shop Scheduling.” Expert Systems with Applications 51: 161–176. doi:10.1016/j.eswa.2015.12.001.
   Web of Science ®Google Scholar
• Shao, Z. S., D. C. Pi, and W. S. Shao. 2017. “An Extended Continuous Estimation of Distribution Algorithm for Solving the Permutation Flow-Shop Scheduling Problem.” Engineering Optimization 49 (11): 1868–1889. doi:10.1080/0305215x.2016.1275605.
   Web of Science ®Google Scholar
• Shi, Z. W., G. Y. Yang, and Y. H. Xiao. 2016. “A Limited Memory BFGS Algorithm for Non-Convex Minimization with Applications in Matrix Largest Eigenvalue Problem.” Mathematical Methods of Operations Research 83 (2): 243–264. doi:10.1007/s00186-015-0527-8.
   Web of Science ®Google Scholar
• Soria-Alcaraz, J. A., E. Özcan, J. Swan, G. Kendall, and M. Carpio. 2016. “Iterated Local Search Using an Add and Delete Hyper-heuristic for University Course Timetabling.” Applied Soft Computing 40: 581–593. doi:10.1016/j.asoc.2015.11.043.
   Web of Science ®Google Scholar
• Spolaor, S., A. Tangherloni, L. Rundo, M. S. Nobile, and P. Cazzaniga. 2017. “Reboot Strategies in Particle Swarm Optimization and their Impact on Parameter Estimation of Biochemical Systems.” In Proceedings of the 2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 1–8. Piscataway, NJ: IEEE.
   Google Scholar
• Storn, R., and K. Price. 1997. “Differential Evolution – A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces.” Journal of Global Optimization 11 (4): 341–359. doi:10.1023/a:1008202821328.
   Web of Science ®Google Scholar
• Stutzle, T. 2006. “Iterated Local Search for the Quadratic Assignment Problem.” European Journal of Operational Research 174 (3): 1519–1539. doi:10.1016/j.ejor.2005.01.066.
   Web of Science ®Google Scholar
• Tanabe, R., and A. Fukunaga. 2013. “Success-History Based Parameter Adaptation for Differential Evolution.” In Proceedings of the 2013 IEEE Congress on Evolutionary Computation, 71–78. Piscataway, NJ: IEEE.
   Google Scholar
• Tangherloni, A., L. Rundo, and M. S. Nobile. 2017. “Proactive Particles in Swarm Optimization: A Settings-Free Algorithm for Real-Parameter Single Objective Optimization Problems.” In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), 1940–1947. Piscataway, NJ: IEEE.
   Google Scholar
• Tangherloni, A., L. Rundo, S. Spolaor, P. Cazzaniga, and M. S. Nobile. 2018. “GPU-Powered Multi-swarm Parameter Estimation of Biological Systems: A Master-Slave Approach.” In Proceedings of the 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 698–705. Piscataway, NJ: IEEE.
   Google Scholar
• Wei, L. J., Z. Z. Zhang, D. F. Zhang, and S. C. H. Leung. 2018. “A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints.” European Journal of Operational Research 265 (3): 843–859. doi:10.1016/j.ejor.2017.08.035.
   Web of Science ®Google Scholar
• Wu, G. H., D. Qiu, Y. Yu, W. Pedrycz, M. H. Ma, and H. F. Li. 2014. “Superior Solution Guided Particle Swarm Optimization Combined with Local Search Techniques.” Expert Systems with Applications 41 (16): 7536–7548. doi:10.1016/j.eswa.2014.06.005.
   Web of Science ®Google Scholar
• Xiao, Y. H., Z. X. Wei, and Z. G. Wang. 2008. “A Limited Memory BFGS-Type Method for Large-Scale Unconstrained Optimization.” Computers & Mathematics with Applications 56 (4): 1001–1009. doi:10.1016/j.camwa.2008.01.028.
   Web of Science ®Google Scholar
• Xu, J. Y., C.-C. Wu, Y. Q. Yin, and W.-C. Lin. 2017. “An Iterated Local Search for the Multi-objective Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” Applied Soft Computing 52: 39–47. doi:10.1016/j.asoc.2016.11.031.
   Web of Science ®Google Scholar
• Zar, J. H. 1999. Biostatistical Analysis. 4th ed. New Delhi: Pearson Education India.
   Google Scholar
• Zhang, Q. F., and J. Y. Sun. 2006. “Iterated Local Search with Guided Mutation.” In Proceedings of the 2006 IEEE International Conference on Evolutionary Computation, 924–929. Piscataway, NJ: IEEE.
   Google Scholar
• Zhao, F. Q., Y. Liu, Y. Zhang, W. M. Ma, and C. Zhang. 2017. “A Hybrid Harmony Search Algorithm with Efficient Job Sequence Scheme and Variable Neighborhood Search for the Permutation Flow Shop Scheduling Problems.” Engineering Applications of Artificial Intelligence 65: 178–199. doi:10.1016/j.engappai.2017.07.023.
   Web of Science ®Google Scholar
• Zhao, F. Q., H. Liu, Y. Zhang, W. M. Ma, and C. Zhang. 2018. “A Discrete Water Wave Optimization Algorithm for No-Wait Flow Shop Scheduling Problem.” Expert Systems with Applications 91: 347–363. doi:10.1016/j.eswa.2017.09.028.
   Web of Science ®Google Scholar
• Zhao, F. Q., Y. Liu, C. Zhang, and J. B. Wang. 2015. “A Self-Adaptive Harmony PSO Search Algorithm and its Performance Analysis.” Expert Systems with Applications 42 (21): 7436–7455. doi:10.1016/j.eswa.2015.05.035.
   Web of Science ®Google Scholar
• Zhou, Y. M., and J.-K. Hao. 2017. “An Iterated Local Search Algorithm for the Minimum Differential Dispersion Problem.” Knowledge-Based Systems 125: 26–38. doi:10.1016/j.knosys.2017.03.028.
   Web of Science ®Google Scholar