Skip to main content

Research Repository

Advanced Search

Professor DARIO LANDA SILVA's Outputs (6)

A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections (2014)
Presentation / Conference Contribution
Ibrahim, O. A. S., & Landa-Silva, D. A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections. Presented at 14th UK Workshop on Computational Intelligence (UKCI2014)

This paper introduces a new weighting scheme in information retrieval. It also proposes using the document centroid as a threshold for normalizing documents in a document collection. Document centroid normalization helps to achieve more effective inf... Read More about A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections.

Workforce scheduling and routing problems: literature survey and computational study (2014)
Journal Article
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39-67. https://doi.org/10.1007/s10479-014-1687-2

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home,... Read More about Workforce scheduling and routing problems: literature survey and computational study.

A heuristic algorithm based on multiassignment procedures for nurse scheduling (2014)
Journal Article
Constantino, A. A., Landa-Silva, D., de Melo, E. L., de Mendonza, C. F. X., Rizzato, D. B., & Romao, W. (2014). A heuristic algorithm based on multiassignment procedures for nurse scheduling. Annals of Operations Research, 218(1), https://doi.org/10.1007/s10479-013-1357-9

This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses? preferences and m... Read More about A heuristic algorithm based on multiassignment procedures for nurse scheduling.

A development and integration framework for optimisation-based enterprise solutions (2014)
Presentation / Conference Contribution
Pinheiro, R. L., & Landa-Silva, D. A development and integration framework for optimisation-based enterprise solutions. Presented at Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems (ICORES 2014)

The operations research literature includes some papers describing collaborative work between researchers and industry. However, not much literature exists that outlines methodologies to guide the development of a decision support module and its inte... Read More about A development and integration framework for optimisation-based enterprise solutions.

Computational study for workforce scheduling and routing problems (2014)
Presentation / Conference Contribution
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. Computational study for workforce scheduling and routing problems. Presented at 3rd International Conference on Operations Research and Enterprise Systems (ICORES 2014)

We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity,... Read More about Computational study for workforce scheduling and routing problems.

An evolutionary algorithm for graph planarisation by vertex deletion (2014)
Presentation / Conference Contribution
Pinheiro, R. L., Constantino, A. A., de Mendonca, C. F. X., & Landa-Silva, D. An evolutionary algorithm for graph planarisation by vertex deletion. Presented at 16th International Conference on Enterprise Information Systems (ICEIS 2014)

A non-planar graph can only be planarised if it is structurally modified. This work presents a new heuristic algorithm that uses vertices deletion to modify a non-planar graph in order to obtain a planar subgraph. The proposed algorithm aims to delet... Read More about An evolutionary algorithm for graph planarisation by vertex deletion.