Abstract-The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling scheduling and routing constraints while aiming to minimise the total operational cost. This paper presents a Genetic Algorithm (GA) tailored to tackle a set of real-world instances of this problem. The proposed GA uses a customised chromosome representation to maintain the feasibility of solutions. The performance of several genetic operators is investigated in relation to the tailored chromosome representation. This paper also presents a study of parameter settings for the proposed GA in relation to the various problem instances considered. Results show that the proposed GA, which incorporates tailored components, performs very well and is an effective baseline evolutionary algorithm for this difficult problem.
A more efficient genetic algorithm with tuned parameters and using a customised solution representation to maintain feasibility of solutions was proposed in REF .
A genetic algorithm for a workforce scheduling and routing problem
2016 IEEE Congress on Evolutionary Computation (CEC)
2016 IEEE Congress on Evolutionary Computation (CEC)
Computer Science