{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:11:44Z","timestamp":1774685504500,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["22\/05803-3"],"award-info":[{"award-number":["22\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/15417-8"],"award-info":[{"award-number":["2018\/15417-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["22\/06747-0"],"award-info":[{"award-number":["22\/06747-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["311536\/2020-4"],"award-info":[{"award-number":["311536\/2020-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312747\/2021-7"],"award-info":[{"award-number":["312747\/2021-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10479-024-06325-6","type":"journal-article","created":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T21:01:43Z","timestamp":1728853303000},"page":"945-980","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm"],"prefix":"10.1007","volume":"346","author":[{"given":"R. B.","family":"Damm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Chaves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Riveaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7647-2328","authenticated-orcid":false,"given":"D. P.","family":"Ronconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,13]]},"reference":[{"issue":"1","key":"6325_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2021","unstructured":"Andrade, C. E., Toso, R. F., Gon\u00e7alves, J. F., & Resende, M. G. (2021). The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. European Journal of Operational Research, 289(1), 17\u201330.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6325_CR2","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"JEC Arroyo","year":"2005","unstructured":"Arroyo, J. E. C., & Armentano, V. A. (2005). Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research, 167(3), 717\u2013738. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6325_CR3","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"key":"6325_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.cor.2018.07.004","volume":"100","author":"M Cabo","year":"2018","unstructured":"Cabo, M., Gonz\u00e1lez-Velarde, J. L., Possani, E., & Sol\u00eds, Y. \u00c1. R. (2018). Bi-objective scheduling on a restricted batching machine. Computers & Operations Research, 100, 201\u2013210.","journal-title":"Computers & Operations Research"},{"key":"6325_CR5","doi-asserted-by":"publisher","first-page":"104908","DOI":"10.1016\/j.cor.2020.104908","volume":"118","author":"S \u00c7ak\u0131rgil","year":"2020","unstructured":"\u00c7ak\u0131rgil, S., Y\u00fccel, E., & Kuyzu, G. (2020). An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems. Computers & Operations Research, 118, 104908.","journal-title":"Computers & Operations Research"},{"key":"6325_CR6","doi-asserted-by":"crossref","unstructured":"Chaves, A. A., & Lorena, L. H. N. (2021). An adaptive and near parameter-free BRKGA using $$Q$$-learning method. In 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 2331\u20132338","DOI":"10.1109\/CEC45853.2021.9504766"},{"key":"6325_CR7","doi-asserted-by":"publisher","first-page":"121735","DOI":"10.1016\/j.eswa.2023.121735","volume":"238","author":"AA Chaves","year":"2024","unstructured":"Chaves, A. A., Vianna, B. L., da Silva, T. T., & Schenekemberg, C. M. (2024). A parallel branch-and-cut and an adaptive metaheuristic to solve the family traveling salesman problem. Expert Systems with Applications, 238, 121735. https:\/\/doi.org\/10.1016\/j.eswa.2023.121735","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"6325_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"J-F Cordeau","year":"2010","unstructured":"Cordeau, J.-F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4), 393\u2013409.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"6325_CR9","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.ejor.2014.03.006","volume":"238","author":"CE Cort\u00e9s","year":"2014","unstructured":"Cort\u00e9s, C. E., Gendreau, M., Rousseau, L. M., Souyris, S., & Weintraub, A. (2014). Branch-and-price and constraint programming for solving a real-life technician dispatching problem. European Journal of Operational Research, 238(1), 300\u2013312.","journal-title":"European Journal of Operational Research"},{"key":"6325_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-87672-2_31","volume-title":"Computational Logistics","author":"RB Damm","year":"2021","unstructured":"Damm, R. B., & Ronconi, D. P. (2021). A multi-objective biased random-key genetic algorithm for service technician routing and scheduling problem. In M. Mes, E. Lalla-Ruiz, & S. Vo\u00df (Eds.), Computational Logistics (pp. 471\u2013486). Cham: Springer International Publishing."},{"key":"6325_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cor.2016.05.003","volume":"75","author":"RB Damm","year":"2016","unstructured":"Damm, R. B., Resende, M. G. C., & Ronconi, D. P. (2016). A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research, 75, 49\u201363.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"6325_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"6325_CR13","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2013.08.002","volume":"232","author":"E Demir","year":"2014","unstructured":"Demir, E., Bekta\u015f, T., & Laporte, G. (2014). The bi-objective pollution-routing problem. European Journal of Operational Research, 232(3), 464\u2013478.","journal-title":"European Journal of Operational Research"},{"key":"6325_CR14","doi-asserted-by":"publisher","first-page":"105088","DOI":"10.1016\/j.cor.2020.105088","volume":"125","author":"J Ding","year":"2021","unstructured":"Ding, J., Schulz, S., Shen, L., Buscher, U., & L\u00fc, Z. (2021). Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Computers & Operations Research, 125, 105088.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6325_CR15","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn, A., Kolind, E., & Clausen, J. (2009). The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research, 36(4), 1145\u20131157.","journal-title":"Computers & Operations Research"},{"key":"6325_CR16","doi-asserted-by":"crossref","unstructured":"Gamst, M., & Pisinger, D. (2022). Decision support for the technician routing and scheduling problem. arXiv preprint arXiv:2211.16968","DOI":"10.1002\/net.22188"},{"issue":"4","key":"6325_CR17","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., & Ghannadpour, S. F. (2010). Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing, 10(4), 1096\u20131107. https:\/\/doi.org\/10.1016\/j.asoc.2010.04.001","journal-title":"Applied Soft Computing"},{"key":"6325_CR18","unstructured":"Goldberg, D.E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In J. J. Grefenstette (Ed.), Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp. 41\u201349. Hillsdale"},{"issue":"5","key":"6325_CR19","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J. F., & Resende, M. G. C. (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(5), 487\u2013525.","journal-title":"Journal of Heuristics"},{"key":"6325_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1590\/0101-7438.2014.034.02.0143","volume":"34","author":"JF Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves, J. F., Resende, M. G. C., & Toso, R. F. (2014). An experimental comparison of biased and unbiased random-key genetic algorithms. Pesquisa Operacional, 34, 143\u2013164.","journal-title":"Pesquisa Operacional"},{"key":"6325_CR21","doi-asserted-by":"crossref","unstructured":"Grunert\u00a0da Fonseca, V., Fonseca, C. M., & Hall, A.O. (2001). Inferential performance assessment of stochastic optimisers and the attainment function. In E. Zitzler, L. Thiele, K. Deb, C. A. Coello\u00a0Coello, and D. Corne (Eds.), Evolutionary Multi-criterion Optimization, volume 1993 of Lecture Notes in Computer Science, pp. 213\u2013225, Berlin, Heidelberg.","DOI":"10.1007\/3-540-44719-9_15"},{"key":"6325_CR22","doi-asserted-by":"publisher","first-page":"125533","DOI":"10.1016\/j.amc.2020.125533","volume":"386","author":"A Hasani","year":"2020","unstructured":"Hasani, A., & Hosseini, S. M. H. (2020). A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: Trade-off between production costs and energy consumption. Applied Mathematics and Computation, 386, 125533.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"6325_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","volume":"183","author":"H Hashimoto","year":"2011","unstructured":"Hashimoto, H., Boussier, S., Vasquez, M., & Wilbaut, C. (2011). A GRASP-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research, 183(1), 143\u2013161.","journal-title":"Annals of Operations Research"},{"key":"6325_CR24","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2022.2136543","author":"CA Irawan","year":"2022","unstructured":"Irawan, C. A., Ouelhadj, D., Bakken Sperstad, I., & Jones, D. (2022). A combined tactical and operational framework for maintenance scheduling and routing in offshore wind farms. Journal of the Operational Research Society. https:\/\/doi.org\/10.1080\/01605682.2022.2136543","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"6325_CR25","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A. A., Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15(5), 579\u2013600.","journal-title":"Journal of Scheduling"},{"key":"6325_CR26","doi-asserted-by":"publisher","first-page":"121718","DOI":"10.1016\/j.eswa.2023.121718","volume":"237","author":"Z Liu","year":"2024","unstructured":"Liu, Z., Zhao, P., Cao, J., Zhang, J., & Chen, Z. (2024). A constrained multi-objective evolutionary algorithm with pareto estimation via neural network. Expert Systems with Applications, 237, 121718. https:\/\/doi.org\/10.1016\/j.eswa.2023.121718","journal-title":"Expert Systems with Applications"},{"key":"6325_CR27","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-02538-9_9","volume-title":"Experimental methods for the analysis of optimization algorithms","author":"M L\u00f3pez-Ib\u00e1nez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Paquete, L., & St\u00fctzle, T. (2010). Exploratory analysis of stochastic local search algorithms in biobjective optimization. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, & M. Preuss (Eds.), Experimental methods for the analysis of optimization algorithms (pp. 209\u2013222). Berlin, Heidelberg: Springer."},{"key":"6325_CR28","unstructured":"Loshchilov, I., & Hutter, F. (2017). Sgdr: Stochastic gradient descent with warm restarts. In Proceedings of the international conference on learning representations (ICLR). Preprint arXiv:1608.03983"},{"issue":"4","key":"6325_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TEVC.2003.812220","volume":"7","author":"H Lu","year":"2003","unstructured":"Lu, H., & Yen, G. G. (2003). Rank-density-based multiobjective genetic algorithm and benchmark test function study. IEEE Transactions on Evolutionary Computation, 7(4), 325\u2013343.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6325_CR30","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-031-26504-4_42","volume-title":"Metaheuristics","author":"L Mendes","year":"2023","unstructured":"Mendes, L., Usberti, F., & San Felice, M. (2023). An evolutionary algorithm applied to the bi-objective travelling salesman problem. In L. Di Gaspero, P. Festa, A. Nakib, & M. Pavone (Eds.), Metaheuristics (pp. 519\u2013524). Cham: Springer International Publishing."},{"issue":"1","key":"6325_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1111\/itor.12026","volume":"21","author":"LF Mor\u00e1n-Mirabal","year":"2014","unstructured":"Mor\u00e1n-Mirabal, L. F., Gonz\u00e1lez-Velarde, J. L., & Resende, M. G. C. (2014). Randomized heuristics for the family traveling salesperson problem. International Transactions in Operational Research, 21(1), 41\u201357.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"6325_CR32","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2014.10.044","volume":"243","author":"RL Moritz","year":"2015","unstructured":"Moritz, R. L., Reich, E., Schwarz, M., Bernt, M., & Middendorf, M. (2015). Refined ranking relations for selection of solutions in multi objective metaheuristics. European Journal of Operational Research, 243(2), 454\u2013464. https:\/\/doi.org\/10.1016\/j.ejor.2014.10.044","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6325_CR33","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-010-9608-7","volume":"50","author":"TF Noronha","year":"2011","unstructured":"Noronha, T. F., Resende, M. G. C., & Ribeiro, C. C. (2011). A biased random-key genetic algorithm for routing and wavelength assignment. Journal of Global Optimization, 50(3), 503\u2013518.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"6325_CR34","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.omega.2008.05.003","volume":"37","author":"DL Overholts II","year":"2009","unstructured":"Overholts, D. L., II., Bell, J. E., & Arostegui, M. A. (2009). A location analysis approach for military maintenance scheduling with geographically dispersed service areas. Omega, 37(4), 838\u2013852.","journal-title":"Omega"},{"issue":"3","key":"6325_CR35","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2017.05.035","volume":"263","author":"DC Paraskevopoulos","year":"2017","unstructured":"Paraskevopoulos, D. C., Laporte, G., Repoussis, P. P., & Tarantilis, C. D. (2017). Resource constrained routing and scheduling: Review and research prospects. European Journal of Operational Research, 263(3), 737\u2013754.","journal-title":"European Journal of Operational Research"},{"key":"6325_CR36","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s11518-018-5361-0","volume":"27","author":"F Pargar","year":"2018","unstructured":"Pargar, F., Zandieh, M., Kauppila, O., & Kujala, J. (2018). The effect of worker learning on scheduling jobs in a hybrid flow shop: A bi-objective approach. Journal of Systems Science and Systems Engineering, 27, 265\u2013291.","journal-title":"Journal of Systems Science and Systems Engineering"},{"key":"6325_CR37","doi-asserted-by":"publisher","first-page":"104930","DOI":"10.1016\/j.cor.2020.104930","volume":"118","author":"DL Pereira","year":"2020","unstructured":"Pereira, D. L., Alves, J. C., & de Oliveira Moreira, M. C. (2020). A multiperiod workforce scheduling and routing problem with dependent tasks. Computers & Operations Research, 118, 104930.","journal-title":"Computers & Operations Research"},{"issue":"15","key":"6325_CR38","doi-asserted-by":"publisher","first-page":"45291","DOI":"10.1007\/s11042-023-17217-5","volume":"83","author":"D Phamtoan","year":"2023","unstructured":"Phamtoan, D., & Vovan, T. (2023). Improving fuzzy clustering model for probability density functions using the two-objective genetic algorithm. Multimedia Tools and Applications, 83(15), 45291\u201345314. https:\/\/doi.org\/10.1007\/s11042-023-17217-5","journal-title":"Multimedia Tools and Applications"},{"issue":"7","key":"6325_CR39","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","volume":"7","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gueret, C., & Medaglia, A. L. (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 7(7), 1525\u20131535.","journal-title":"Optimization Letters"},{"issue":"1","key":"6325_CR40","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10479-022-04658-8","volume":"315","author":"E Pourjavad","year":"2022","unstructured":"Pourjavad, E., & Almehdawe, E. (2022). Optimization of the technician routing and scheduling problem for a telecommunication industry. Annals of Operations Research, 315(1), 371\u2013395.","journal-title":"Annals of Operations Research"},{"issue":"5\u20138","key":"6325_CR41","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00170-012-4051-1","volume":"64","author":"SHA Rahmati","year":"2013","unstructured":"Rahmati, S. H. A., Zandieh, M., & Yazdani, M. (2013). Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 64(5\u20138), 915\u2013932. https:\/\/doi.org\/10.1007\/s00170-012-4051-1","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"6325_CR42","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.cie.2008.01.005","volume":"55","author":"F Samanlioglu","year":"2008","unstructured":"Samanlioglu, F., Ferrell, W. G., & Kurz, M. E. (2008). A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem. Computers & Industrial Engineering, 55(2), 439\u2013449. https:\/\/doi.org\/10.1016\/j.cie.2008.01.005","journal-title":"Computers & Industrial Engineering"},{"issue":"9","key":"6325_CR43","doi-asserted-by":"publisher","first-page":"5147","DOI":"10.1007\/s00521-019-04008-z","volume":"32","author":"H Samma","year":"2020","unstructured":"Samma, H., Mohamad-Saleh, J., Suandi, S. A., & Lahasan, B. (2020). Q-learning-based simulated annealing algorithm for constrained engineering design problems. Neural Computing and Applications, 32(9), 5147\u20135161.","journal-title":"Neural Computing and Applications"},{"key":"6325_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2022.105933","volume":"147","author":"CM Schenekemberg","year":"2022","unstructured":"Schenekemberg, C. M., Chaves, A. A., Coelho, L. C., Guimar\u00e3es, T. A., & Avelino, G. G. (2022). The dial-a-ride problem with private fleet and common carrier. Computers & Operations Research, 147, 1\u201314.","journal-title":"Computers & Operations Research"},{"key":"6325_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-024-06136-9","author":"CM Schenekemberg","year":"2024","unstructured":"Schenekemberg, C. M., Chaves, A. A., Guimar\u00e3es, T. A., & Coelho, L. C. (2024). Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-024-06136-9","journal-title":"Annals of Operations Research"},{"key":"6325_CR46","doi-asserted-by":"publisher","first-page":"054045","DOI":"10.1103\/PhysRevApplied.18.054045","volume":"18","author":"MJ Schuetz","year":"2022","unstructured":"Schuetz, M. J., Brubaker, J. K., Montagu, H., van Dijk, Y., Klepsch, J., Ross, P., Luckow, A., Resende, M. G., & Katzgraber, H. G. (2022). Optimization of robot-trajectory planning with nature-inspired and hybrid quantum algorithms. Physical Review Applied, 18, 054045.","journal-title":"Physical Review Applied"},{"issue":"2","key":"6325_CR47","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265.","journal-title":"Operations Research"},{"issue":"7","key":"6325_CR48","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1007\/s11590-012-0557-6","volume":"7","author":"S Souyris","year":"2013","unstructured":"Souyris, S., Cort\u00e9s, C. E., Ord\u00f3\u00f1ez, F., & Weintraub, A. (2013). A robust optimization approach to dispatching technicians under stochastic service times. Optimization Letters, 7(7), 1549\u20131568.","journal-title":"Optimization Letters"},{"issue":"1\u20132","key":"6325_CR49","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-015-1800-1","volume":"249","author":"F Stefanello","year":"2017","unstructured":"Stefanello, F., Buriol, L. S., Hirsch, M. J., Pardalos, P. M., Querido, T., Resende, M. G. C., & Ritt, M. (2017). On the minimization of traffic congestion in road networks with tolls. Annals of Operations Research, 249(1\u20132), 119\u2013139.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6325_CR50","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6325_CR51","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2006.03.004","volume":"43","author":"H Tang","year":"2007","unstructured":"Tang, H., Miller-Hooks, E., & Tomastik, R. (2007). Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E: Logistics and Transportation Review, 43(5), 591\u2013609.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"6325_CR52","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-12631-9_9","volume-title":"Recent Advances in Computational Optimization","author":"P Tangpattanakul","year":"2015","unstructured":"Tangpattanakul, P., Jozefowiez, N., & Lopez, P. (2015). Biased random key genetic algorithm for multi-user Earth observation scheduling. Studies in Computational IntelligenceIn S. Fidanova (Ed.), Recent Advances in Computational Optimization (Vol. 580, pp. 143\u2013160). Cham: Springer."},{"key":"6325_CR53","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V Tkindt","year":"2006","unstructured":"Tkindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: Theory, models and algorithms. Berlin, Heidelberg: Springer-Verlag."},{"issue":"3","key":"6325_CR54","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang, E., & Voudouris, C. (1997). Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Operations Research Letters, 20(3), 119\u2013127.","journal-title":"Operations Research Letters"},{"issue":"4","key":"6325_CR55","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","volume":"8","author":"EL Ulungu","year":"1999","unstructured":"Ulungu, E. L., Teghem, J., Fortemps, P. H., & Tuyttens, D. (1999). MOSA method: A tool for solving multiobjective combinatorial optimization problems. Journal of Multicriteria Decision Analysis, 8(4), 221\u2013236.","journal-title":"Journal of Multicriteria Decision Analysis"},{"key":"6325_CR56","unstructured":"Watkins, C. J. C. H. (1989). Learning from delayed rewards. PhD thesis, King\u2019s College, University of Cambridge"},{"issue":"1","key":"6325_CR57","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2015.10.059","volume":"251","author":"J Xiao","year":"2016","unstructured":"Xiao, J., Wu, Z., Hong, X.-X., Tang, J.-C., & Tang, Y. (2016). Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP. European Journal of Operational Research, 251(1), 22\u201335.","journal-title":"European Journal of Operational Research"},{"key":"6325_CR58","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10732-017-9347-8","volume":"23","author":"F Xie","year":"2017","unstructured":"Xie, F., Potts, C. N., & Bekta\u015f, T. (2017). Iterated local search for workforce scheduling and routing problems. Journal of Heuristics, 23, 471\u2013500.","journal-title":"Journal of Heuristics"},{"issue":"5","key":"6325_CR59","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J Xu","year":"2001","unstructured":"Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7(5), 495\u2013509.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"6325_CR60","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1080\/00207543.2014.955923","volume":"53","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Ming, X., Zheng, M., Li, M., He, L., & Song, W. (2015). Cross-trained workers scheduling for field service using improved NSGA-II. International Journal of Production Research, 53(4), 1255\u20131272.","journal-title":"International Journal of Production Research"},{"issue":"12","key":"6325_CR61","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1080\/01605682.2017.1415645","volume":"69","author":"L Zhen","year":"2018","unstructured":"Zhen, L., Hao, H., Shi, X., Huang, L., & Hu, Y. (2018). Task assignment and sequencing decision model under uncertain available time of service providers. Journal of the Operational Research Society, 69(12), 1935\u20131946.","journal-title":"Journal of the Operational Research Society"},{"key":"6325_CR62","doi-asserted-by":"crossref","unstructured":"Zitzler, E., & K\u00fcnzli, S. (2004). Indicator-based selection in multiobjective search. In International conference on parallel problem solving from nature, pp. 832\u2013842. Springer","DOI":"10.1007\/978-3-540-30217-9_84"},{"issue":"4","key":"6325_CR63","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"6325_CR64","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Da Fonseca, V. G. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06325-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06325-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06325-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:09:24Z","timestamp":1743394164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06325-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,13]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["6325"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06325-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,13]]},"assertion":[{"value":"25 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}