A variable neighbourhood search for the workforce scheduling and routing problem
(2015)
Presentation / Conference Contribution
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. (2015). A variable neighbourhood search for the workforce scheduling and routing problem. In N. Pillay, A. P. Engelbrecht, A. Abraham, M. C. du Plessis, V. Snášel, & A. K. Muda (Eds.), Advances in nature and biologically inspired computing: proceedings of the 7th World Congress on Nature and Biologically Inspired Computing, NaBIC2015, in Pietermaritzburg, South Africa, held December 01-03, 2015 (247–259). https://doi.org/10.1007/978-3-319-27400-3_22
The workforce scheduling and routing problem (WSRP) is a combinatorial optimisation problem where a set of workers must perform visits to geographically scattered locations. We present a Variable Neighbourhood Search (VNS) metaheuristic algorithm to... Read More about A variable neighbourhood search for the workforce scheduling and routing problem.