References(42)
[1]
A. Turky, N. R. Sabar, S. Dunstall, and A. Song, Hyper-heuristic local search for combinatorial optimisation problems, Knowl.-Based Syst., vol. 205, p. 106264, 2020.
[2]
X. Y. Cai, M. Hu, D. W. Gong, Y. N. Guo, Y. Zhang, Z. Fan, and Y. H. Huang, A decomposition-based coevolutionary multiobjective local search for combinatorial multiobjective optimization, Swarm Evol. Comput., vol. 49, pp. 178-193, 2019.
[3]
J. A. Castellanos-Garzon, E. Costa, S. J. L. Jaimes, and J. M. Corchado, An evolutionary framework for machine learning applied to medical data, Knowl.-Based Syst., vol. 185, p. 104982, 2019.
[4]
X. W. Cai, H. B. Qiu, L. Gao, C. Jiang, and X. Y. Shao, An efficient surrogate-assisted particle swarm optimization algorithm for high-dimensional expensive problems, Knowl.-Based Syst., vol. 184, p. 104901, 2019.
[5]
R. Olivares, F. Muñoz, and F. Riquelme, A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods, Knowl.-Based Syst., vol. 212, p. 106623, 2021.
[6]
J. P. Huang, Q. K. Pan, and L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., vol. 59, p. 100742, 2020.
[7]
H. Park, D. Son, B. Koo, and B. Jeong, Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm, Expert Syst. Appl., vol. 165, p. 113959, 2021.
[8]
G. D’Angelo and F. Palmieri, GGA: A modified genetic algorithm with gradient-based local search for solving constrained optimization problems, Inf. Sci. (Ny)., vol. 547, pp. 136-162, 2021.
[9]
Y. Hu, Y. Zhang, and D. W. Gong, Multiobjective particle swarm optimization for feature selection with fuzzy cost, IEEE Trans. Cybern., vol. 51, no. 2, pp. 874-888, 2021.
[10]
S. C. Gao, Y. R. Wang, J. J. Cheng, Y. Inazumi, and Z. Tang, Ant colony optimization with clustering for solving the dynamic location routing problem, Appl. Math. Comput., vol. 285, pp. 149-173, 2016.
[11]
F. Q. Zhao, L. X. Zhang, Y. Zhang, W. M. Ma, C. Zhang, and H. B. Song, A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion, Expert Syst. Appl., vol. 146, p. 113166, 2020.
[12]
F. Q. Zhao, X. He, and L. Wang, A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem, IEEE Trans. Cybern., .
[13]
F. Q. Zhao, L. X. Zhao, L. Wang, and H. B. Song, An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion, Expert Syst. Appl., vol. 160, p. 113678, 2020.
[14]
Z. S. Shao, D. C. Pi, and W. S. Shao, A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., vol. 40, pp. 53-75, 2018.
[15]
Z. S. Shao, D. C. Pi, and W. S. Shao, Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment, Expert Syst. Appl., vol. 145, p. 113147, 2020.
[16]
Z. S. Shao, D. C. Pi, and W. S. Shao, A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem, Expert Syst. Appl., vol. 113, pp. 77-99, 2018.
[17]
Y. W. Zhong, L. J. Wang, M. Lin, and H. Zhang, Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem, Swarm Evol. Comput., vol. 48, pp. 134-144, 2019.
[18]
G. Y. Zhu, C. Ding, and W. B. Zhang, Optimal foraging algorithm that incorporates fuzzy relative entropy for solving many-objective permutation flow shop scheduling problems, IEEE Trans. Fuzzy Syst., vol. 28, no. 11, pp. 2738-2746, 2020.
[19]
J. M. Chen, B. Dan, and J. Shi, A variable neighborhood search approach for the multi-compartment vehicle routing problem with time windows considering carbon emission, J. Clean. Prod., vol. 277, p. 123932, 2020.
[20]
J. Q. Li, Y.Q. Han, P. Y. Duan, Y. Y. Han, B. Niu, C. D. Li, Z. X. Zheng, and Y. P. Liu, Meta-heuristic algorithm for solving vehicle routing problems with time windows and synchronized visit constraints in prefabricated systems, J. Clean. Prod., vol. 250, p. 119464, 2020.
[21]
G. Mweshi and N. Pillay, An improved grammatical evolution approach for generating perturbative heuristics to solve combinatorial optimization problems, Expert Syst. Appl., vol. 165, p. 113853, 2021.
[22]
J. Lin, Z. J. Wang, and X. Li, A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem, Swarm Evol. Comput., vol. 36, pp. 124-135, 2017.
[23]
S. Y. Zhang, Z. L. Ren, C. X. Li, and J. F. Xuan, A perturbation adaptive pursuit strategy based hyper-heuristic for multi-objective optimization problems, Swarm Evol. Comput., vol. 54, p. 100647, 2020.
[24]
L. Ahmed, C. Mumford, and A. Kheiri, Solving urban transit route design problem using selection hyper-heuristics, Eur. J. Oper. Res., vol. 274, no. 2, pp. 545-559, 2019.
[25]
E. Kieffer, G. Danoy, M. R. Brust, P. Bouvry, and A. Nagih, Tackling large-scale and combinatorial bi-level problems with a genetic programming hyper-heuristic, IEEE Trans. Evol. Comput., vol. 24, no. 1, pp. 44-56, 2020.
[26]
A. Aslan, I. Bakir, and I. F. A. Vis, A dynamic thompson sampling hyper-heuristic framework for learning activity planning in personalized learning, Eur. J. Oper. Res., vol. 286, no. 2, pp. 673-688, 2020.
[27]
S. N. Chaurasia and J. H. Kim, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Inf. Sci. (Ny)., vol. 505, pp. 1-31, 2019.
[28]
N. R. Sabar and G. Kendall, Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems, Inf. Sci. (Ny)., vol. 314, pp. 225-239, 2015.
[29]
N. R. Sabar, M. Ayob, G. Kendall, and R. Qu, Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems, IEEE Trans. Evol. Comput., vol. 19, no. 3, pp. 309-325, 2015.
[30]
A. Kheiri and E. Özcan, An iterated multi-stage selection hyper-heuristic, Eur. J. Oper. Res., vol. 250, no. 1, pp. 77-90, 2016.
[31]
V. A. de S. Júnior, E. Özcan, and V. R. de Carvalho, Hyper-heuristics based on reinforcement learning, balanced heuristic selection and group decision acceptance, Appl. Soft Comput., vol. 97, p. 106760, 2020.
[32]
J. H. Drake, A. Kheiri, E. Özcan, and E. K. Burke, Recent advances in selection hyper-heuristics, Eur. J. Oper. Res., vol. 285, no. 2. pp. 405-428, 2020.
[33]
M. M. Ferdaus, F. Zaman, and R. K. Chakrabortty, Performance improvement of a parsimonious learning machine using metaheuristic approaches, IEEE Trans. Cybern., .
[34]
W. B. Yates and E. C. Keedwell, Offline learning with a selection hyper-heuristic: An application to water distribution network optimisation, Evol. Comput., vol. 29, no. 2, pp. 187-210, 2021.
[35]
S. W. Cai and Z. D. Lei, Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability, Artif. Intell., vol. 287, p. 103354, 2020.
[36]
W. H. El-Ashmawi and D. S. Abd Elminaam, A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem, Appl. Soft Comput., vol. 82, p. 105565, 2019.
[37]
G. C. Wang, L. Gao, X. Y. Li, P. G. Li, and M. F. Tasgetiren, Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm, Swarm Evol. Comput., vol. 57, p. 100716, 2020.
[38]
J. Y. Shiau, M. K. Huang, and C. Y. Huang, A hybrid personnel scheduling model for staff rostering problems, Mathematics, vol. 8, no. 10, p. 1702, 2020.
[39]
A. Gharehgozli, C. Xu, and W. D. Zhang, High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system, Eur. J. Oper. Res., vol. 289, no. 2, pp. 495-507, 2021.
[40]
B. B. Pan, Z. Z. Zhang, and A. Lim, Multi-trip time- dependent vehicle routing problem with time windows, Eur. J. Oper. Res., vol. 291, no. 1, pp. 218-231, 2021.
[41]
C. P. Almeida, R. A. Goncalves, S. Venske, R. Lüders, and M. Delgado, Hyper-heuristics using multi-armed bandit models for multi-objective optimization, Appl. Soft Comput., vol. 95, p. 106520, 2020.
[42]
J. Y. Xu, L. J. Chen, and O. Tang, An online algorithm for the risk-aware restless bandit, Eur. J. Oper. Res., vol. 290, no. 2, pp. 622-639, 2021.