Professor DARIO LANDA SILVA's Outputs (10)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem (2015)
Presentation / Conference Contribution
Laesanklang, W., Pinheiro, R. L., Algethami, H., & Landa-Silva, D. (2015, January). Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem. Presented at 4th International Conference, ICORES 2015, Lisbon, Portugal

© 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)
Presentation / Conference Contribution
Constantino, A. A., Tozzo, E., Pinheiro, R. L., Landa-Silva, D., & Romão, W. A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction. Presented at 17th International Conference on Enterprise Information Systems (ICEIS 2015)

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.

Term frequency with average term occurrences for textual information retrieval (2015)
Journal Article
Ibrahim, O., & Landa-Silva, D. (2016). Term frequency with average term occurrences for textual information retrieval. Soft Computing, 20(8), 3045-3061. https://doi.org/10.1007/s00500-015-1935-7

In the context of Information Retrieval (IR) from text documents, the term-weighting scheme (TWS) is a key component of the matching mechanism when using the vector space model (VSM). In this paper we propose a new TWS that is based on computing the... Read More about Term frequency with average term occurrences for textual information retrieval.

A variable neighbourhood search for the workforce scheduling and routing problem (2015)
Presentation / Conference Contribution
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. (2015, December). A variable neighbourhood search for the workforce scheduling and routing problem. Presented at 7th World Congress on Nature and Biologically Inspired Computing (NaBIC2015), Pietermaritzburg, South Africa

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.

A hybrid GRASP-VNS for Ship Routing and Scheduling Problem with Discretized Time Windows (2015)
Journal Article
Armas, J. D., Lalla-Ruiz, E., Expósito-Izquierdo, C., Landa-Silva, D., & Melián-Batista, B. (2015). A hybrid GRASP-VNS for Ship Routing and Scheduling Problem with Discretized Time Windows. Engineering Applications of Artificial Intelligence, 45, https://doi.org/10.1016/j.engappai.2015.07.013

This paper addresses the Ship Routing and Scheduling Problem with Discretized Time Windows. Being one of the most relevant and challenging problems faced by decision makers from shipping companies, this tramp shipping problem lies in determining the... Read More about A hybrid GRASP-VNS for Ship Routing and Scheduling Problem with Discretized Time Windows.

(1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval (2015)
Presentation / Conference Contribution
Ibrahim, O. A. S., & Landa-Silva, D. (2016, October). (1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval. Presented at 16th Annual UK Workshop on Computational Intelligence (UKCI 2016), Lancaster, UK

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)
Presentation / Conference Contribution
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. Analysis of objectives relationships in multiobjective problems using trade-off region maps. Presented at Proceedings of the 2015 Genetic and Evolutionary Computation Conference (GECCO 2015)

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)
Presentation / Conference Contribution
Algethami, H., & Landa-Silva, D. A study of genetic operators for the Workforce Scheduling and Routing Problem. Presented at 11th Metaheuristics International Conference (MIC 2015)

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)
Presentation / Conference Contribution
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints. Presented at International Conference on Operations Research and Enterprise Systems (ICORES 2015)

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)
Presentation / Conference Contribution
Laesanklang, W., Landa-Silva, D., & Castillo-Salazar, J. A. Mixed integer programming with decomposition to solve a workforce scheduling and routing problem. Presented at International Conference on Operations Research and Enterprise Systems (ICORES 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 are distributed across different geographical locations... Read More about Mixed integer programming with decomposition to solve a workforce scheduling and routing problem.