Adaptive multiple crossover genetic algorithm to solve Workforce Scheduling and Routing Problem

Algethami, Haneen and Martinez-Gavara, Anna and Landa-Silva, Dario (2018) Adaptive multiple crossover genetic algorithm to solve Workforce Scheduling and Routing Problem. Journal of Heuristics . ISSN 1381-1231 (In Press)

[img] PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (915kB)

Abstract

The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits, across various geographical locations. Solving this problem demands tackling numerous scheduling and routing constraints while aiming to minimise the operational cost. One of the main obstacles in designing a genetic algorithm for this problem is selecting the best set of operators that enable better performance in a Genetic Algorithm (GA). This paper presents an adaptive multiple crossover genetic algorithm to tackle the combined setting of scheduling and routing problems. A mix of problem-specific and traditional crossovers are evaluated by using an online learning process to measure the operator's effectiveness. Best performing operators are given high application rates and low rates are given to the worse performing ones. Application rates are dynamically adjusted according to the learning outcomes in a non-stationary environment. Experimental results show that the combined performances of all the operators works better than using one operator in isolation. This study makes a contribution to advance our understanding of how to make effective use of crossover operators on this highly-constrained optimisation problem.

Item Type: Article
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Landa-Silva, Dario
Date Deposited: 20 Jul 2018 10:11
Last Modified: 07 May 2020 18:30
URI: http://eprints.nottingham.ac.uk/id/eprint/53048

Actions (Archive Staff Only)

Edit View Edit View