Abstract
The automatic generation of dispatching rules (DRs) for various scheduling problems using genetic programming (GP) has become an increasingly researched topic in recent years. Creating DRs in this way relieves domain experts of the tedious task of manually designing new rules, but also often leads to the discovery of better rules than those already available. However, developing new DRs is a computationally intensive process that takes time to converge to good solutions. One possible way to improve the convergence of evolutionary algorithms is to use a more sophisticated method to generate the initial population of individuals. In this paper, we propose a simple method for initialising individuals that uses probabilistic information from previously evolved DRs. The method extracts the information on how many times each node occurs at each level of the tree and in each context. This information is then used to introduce bias in the selection of the node to be selected at a particular position during the construction of the expression tree. The experiments show that with the proposed method it is possible to improve the convergence of GP when generating new DRs, so that GP can obtain high-quality DRs in a much shorter time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Branke, J., Nguyen, S., Pickardt, C.W., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110–124 (2016). https://doi.org/10.1109/TEVC.2015.2429314
Gil-Gala, F.J., Sierra, M.R., Mencía, C., Varela, R.: Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity. Swarm Evol. Comput. 66, 100944 (2021). https://doi.org/10.1016/j.swevo.2021.100944
Kazimipour, B., Li, X., Qin, A.K.: A review of population initialization techniques for evolutionary algorithms. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2585–2592 (2014). https://doi.org/10.1109/CEC.2014.6900618
Kim, K., Shan, Y., Nguyen, X.H., McKay, R.I.: Probabilistic model building in genetic programming: a critical review. Genet. Program Evolvable Mach. 15(2), 115–167 (2013). https://doi.org/10.1007/s10710-013-9205-x
Mei, Y., Nguyen, S., Xue, B., Zhang, M.: An efficient feature selection algorithm for evolving job shop scheduling rules with genetic programming. IEEE Trans. Emerg. Top. Comput. Intell 1(5), 339–353 (2017). https://doi.org/10.1109/TETCI.2017.2743758
Nguyen, S., Mei, Y., Zhang, M.: Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3(1), 41–66 (2017). https://doi.org/10.1007/s40747-017-0036-x
Nguyen, S., Zhang, M., Tan, K.C.: Surrogate-assisted genetic programming with simplified models for automated design of dispatching rules. IEEE Trans. Cybern. 47(9), 2951–2965 (2017). https://doi.org/10.1109/TCYB.2016.2562674
Pinedo, M.L.: Scheduling. Springer, USA (2012). https://doi.org/10.1007/978-1-4614-2361-4
Planinić, L., Đurasević, M., Jakobović, D.: On the application of \(\epsilon \)-lexicase selection in the generation of dispatching rules. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 2125–2132 (2021). https://doi.org/10.1109/CEC45853.2021.9504982
Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises Ltd., UK (2008)
Đurasević, M., Jakobović, D.: Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genet. Program Evolvable Mach. 19(1), 53–92 (2017). https://doi.org/10.1007/s10710-017-9302-3
Đurasević, M., Jakobović, D.: A survey of dispatching rules for the dynamic unrelated machines environment. Expert Syst. Appl. 113, 555–569 (2018). https://doi.org/10.1016/j.eswa.2018.06.053
Đurasević, M., Jakobović, D.: Creating dispatching rules by simple ensemble combination. J. Heuristics 25(6), 959–1013 (2019). https://doi.org/10.1007/s10732-019-09416-x
Đurasević, M., Jakobović, D.: Comparison of schedule generation schemes for designing dispatching rules with genetic programming in the unrelated machines environment. Appl. Soft Comput. 96, 106637 (2020). https://doi.org/10.1016/j.asoc.2020.106637
Đurasević, M., Jakobović, D.: Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artif. Intell. Rev. (2022). https://doi.org/10.1007/s10462-022-10247-9
Đurasević, M., Jakobović, D., Knežević, K.: Adaptive scheduling on unrelated machines with genetic programming. Appl. Soft Comput. 48, 419–430 (2016). https://doi.org/10.1016/j.asoc.2016.07.025
Vlašić, I., Đurasević, M., Jakobović, D.: Improving genetic algorithm performance by population initialisation with dispatching rules. Comput. Ind. Eng. 137, 106030 (2019). https://doi.org/10.1016/j.cie.2019.106030
Wu, L., Wang, S.: Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. Int. J. Prod. Econ. 201, 26–40 (2018). https://doi.org/10.1016/j.ijpe.2018.04.013
Yu, L., Shih, H.M., Pfund, M., Carlyle, W.M., Fowler, J.W.: IIE Trans. 34(11), 921–931 (2002). https://doi.org/10.1023/a:1016185412209
Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Guided subtree selection for genetic operators in genetic programming for dynamic flexible job shop scheduling. In: Hu, T., Lourenço, N., Medvet, E., Divina, F. (eds.) EuroGP 2020. LNCS, vol. 12101, pp. 262–278. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-44094-7_17
Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Correlation coefficient-based recombinative guidance for genetic programming hyperheuristics in dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 25(3), 552–566 (2021). https://doi.org/10.1109/TEVC.2021.3056143
Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Trans. Cybern. 51(4), 1797–1811 (2021). https://doi.org/10.1109/TCYB.2020.3024849
Zhang, F., Mei, Y., Zhang, M.: Surrogate-assisted genetic programming for dynamic flexible job shop scheduling. In: Mitrovic, T., Xue, B., Li, X. (eds.) AI 2018. LNCS (LNAI), vol. 11320, pp. 766–772. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03991-2_69
Acknowledgements
This research has been supported by the Croatian Science Foundation under the project IP-2019-04-4333 and by the Spanish State Agency for Research (AEI) under research project PID2019-106263RB-I00.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Đurasević, M., Gil-Gala, F.J., Jakobović, D. (2023). To Bias or Not to Bias: Probabilistic Initialisation for Evolving Dispatching Rules. In: Pappa, G., Giacobini, M., Vasicek, Z. (eds) Genetic Programming. EuroGP 2023. Lecture Notes in Computer Science, vol 13986. Springer, Cham. https://doi.org/10.1007/978-3-031-29573-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-031-29573-7_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29572-0
Online ISBN: 978-3-031-29573-7
eBook Packages: Computer ScienceComputer Science (R0)