All Outputs (8)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem (2015)
Conference Proceeding
Laesanklang, W., Pinheiro, R. L., Algethami, H., & Landa-Silva, D. (2015). Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem. In D. D. Werra, G. H. Parlier, & B. Vitoriano (Eds.), Operations research and enterprise systems: 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015: revised selected papers (191–211). https://doi.org/10.1007/978-3-319-27680-9_12

© Springer International Publishing Switzerland 2015. We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that a... Read More about Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem.

A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction (2015)
Conference Proceeding
Constantino, A. A., Tozzo, E., Pinheiro, R. L., Landa-Silva, D., & Romão, W. (2015). A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction.

The nurse scheduling problem (NSP) is a combinatorial optimisation problem widely tackled in the literature. Recently, a new variant of this problem was proposed, called nurse scheduling problem with balanced preference satisfaction (NSPBPS). This pa... Read More about A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction.

A variable neighbourhood search for the workforce scheduling and routing problem (2015)
Conference Proceeding
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.

(1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval (2015)
Conference Proceeding
Ibrahim, O. A. S., & Landa-Silva, D. (2016). (1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval. In P. Angelov, A. Gegov, C. Jayne, & Q. Shen (Eds.), Advances in computational intelligence systems: contributions presented at the 16th UK Workshop on Computational Intelligence, September 7–9, 2016, Lancaster, UK (387–405). https://doi.org/10.1007/978-3-319-46562-3_25

In many contexts of Information Retrieval (IR), term weights play an important role in retrieving the relevant documents responding to users' queries. The term weight measures the importance or the information content of a keyword existing in the doc... Read More about (1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval.

Analysis of objectives relationships in multiobjective problems using trade-off region maps (2015)
Conference Proceeding
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. (2015). Analysis of objectives relationships in multiobjective problems using trade-off region maps.

Understanding the relationships between objectives in many-objective optimisation problems is desirable in order to develop more effective algorithms. We propose a techniquefor the analysis and visualisation of complex relationships between many (thr... Read More about Analysis of objectives relationships in multiobjective problems using trade-off region maps.

A study of genetic operators for the Workforce Scheduling and Routing Problem (2015)
Conference Proceeding
Algethami, H., & Landa-Silva, D. (2015). A study of genetic operators for the Workforce Scheduling and Routing Problem.

The Workforce Scheduling and Routing Problem (WSRP) is concerned with planning visits of qualified workers to different locations to perform a set of tasks, while satisfying each task time-window plus additional requirements such as customer/workers... Read More about A study of genetic operators for the Workforce Scheduling and Routing Problem.

A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints (2015)
Conference Proceeding
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2015). A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints.

We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These ty... Read More about A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints.

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem (2015)
Conference Proceeding
Laesanklang, W., Landa-Silva, D., & Castillo-Salazar, J. A. (2015). Mixed integer programming with decomposition to solve a workforce scheduling and routing problem.

We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations... Read More about Mixed integer programming with decomposition to solve a workforce scheduling and routing problem.