Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem
| Autor: | Anna Martínez-Gavara, Haneen Algethami, Dario Landa-Silva |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Workforce scheduling
Mathematical optimization 021103 operations research Control and Optimization Computer Networks and Communications Computer science Online learning Crossover 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Scheduling (computing) Operator (computer programming) Artificial Intelligence 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Operational costs Software Information Systems |
| Zdroj: | Journal of Heuristics. 25:753-792 |
| ISSN: | 1572-9397 1381-1231 |
| DOI: | 10.1007/s10732-018-9385-x |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink