Abstract
This paper proposes an improved genetic algorithm (IGA) to provide feasible solutions to the technician routing and scheduling problem (TRSP). The TRSP covers the feasible team generation, the assignment of feasible teams to suitable tasks, the proficiency level of workers, routings considering the allowed days, and the skill desire of the task. The paper deals with a five-day multi-period planning horizon, and a task is performed in any one of 5 days. The IGA consists of crossover, mutation, and three neighborhood structures. Mutation and crossover largely try to avoid getting caught in the local solution trap. Three neighborhood structures improve genetic algorithm (GA) by searching for better solutions. Further, the performance of the proposed algorithm is experimentally compared with GA and improved particle swarm optimization (IPSO) algorithm by providing the TRSP solutions on the generated benchmark instances. The numerical results indicate that IGA offers fast and better solutions considering GA and IPSO algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data availability
Enquiries about data availability should be directed to the authors.
References
Abed-Alguni BH, Alawad NA (2021) Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments. Appl Soft Comput 102:107113
Alawad NA, Abed-alguni BH (2021) Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab J Sci Eng 46(4):3213–3233
Anoshkina Y, Meisel F (2019) Technician teaming and routing with service-, cost-and fairness-objectives. Comput Ind Eng. 135:868–880
Brucker P, Qu R, Burke E (2011) Personnel scheduling: models and complexity. Eur J Oper Res 210(3):467–473
Charris ELS, Montoya-Torres JR, Guerrero-Rueda W (2019) A decision support system for technician routing with time windows. Academia Revista Latinoamericana de Administración 32:138–158
Chen J, Shi J (2019) A multi-compartment vehicle routing problem with time windows for urban distribution—a comparison study on particle swarm optimization algorithms. Comput Ind Eng 133:95–106
Chen X, Thomas BW, Hewitt M (2016) The technician routing problem with experience-based service times. Omega 61:49–61
Damm RB, Resende MG, Ronconi DP (2016) A biased random key genetic algorithm for the field technician scheduling problem. Comput Oper Res 75:49–63
Damm RDB, Ronconi DP (2021) A multi-objective biased random-key genetic algorithm for service technician routing and scheduling problem. In: International conference on computational logistics. Springer, Cham, pp 471–486
Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153(1):3–27
Harkawat A, Kumari S, Pharkya P, Garg D (2017) Load balancing task scheduling based on variants of genetic algorithms. In: International conference on information, communication and computing technology. Springer, Singapore, pp 318–325
Khalfay A, Crispin A, Crockett K (2017) A review of technician and task scheduling problems, datasets and solution approaches. In: 2017 intelligent systems conference, pp 288–296
Kovacs AA, Parragh SN, Doerner KF, Hartl RF (2012) Adaptive large neighborhood search for service technician routing and scheduling problems. J Sched 15(5):579–600
Krishnamoorthy M, Ernst AT, Baatar D (2012) Algorithms for large scale shift minimization personnel task scheduling problems. Eur J Oper Res 219(1):34–48
Li Y, Lim MK, Tseng ML (2019) A green vehicle routing model based on modified particle swarm optimization for cold chain logistics. Ind Manag Data Syst 119(3):473–494
Marinakis Y, Marinaki M, Migdalas A (2019) A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows. Inf Sci 481:311–329
Mathlouthi I, Gendreau M, Potvin JY (2018) Mixed integer linear programming for a multi-attribute technician routing and scheduling problem. INFOR Inf Syst Oper Res 56(1):33–49
Pekel E (2020) Solving technician routing and scheduling problem using improved particle swarm optimization. Soft Comput 24(24):19007–19015
Pekel E, Kara SS (2019) Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search. Appl Soft Comput 83:105665
Pillac V, Gueret C, Medaglia AL (2013) A parallel matheuristic for the technician routing and scheduling problem. Optim Lett 7(7):1525–1535
Van den Bergh J, Beliën J, De Bruecker P, Demeulemeester E, De Boeck L (2013) Personnel scheduling: a literature review. Eur J Oper Res 226(3):367–385
Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65–85
Xu J, Chiu SY (2001) Effective heuristic procedures for a field technician scheduling problem. J Heuristics 7(5):495–509
Zamorano E, Stolletz R (2017) Branch-and-price approaches for the multiperiod technician routing and scheduling problem. Eur J Oper Res 257(1):55–68
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Author declares that I have no conflict of interest.
Human and animal rights
Author declares that the paper does not involve human participants and animals.
Informed consent
Author declares that there is no work to require informed consent.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pekel, E. A simple solution to technician routing and scheduling problem using improved genetic algorithm. Soft Comput 26, 6739–6748 (2022). https://doi.org/10.1007/s00500-022-07072-1
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-022-07072-1