Skip to main content

Research Repository

Advanced Search

All Outputs (87)

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.

A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections (2014)
Conference Proceeding
Ibrahim, O. A. S., & Landa-Silva, D. (2014). A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections.

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)
Conference Proceeding
Pinheiro, R. L., & Landa-Silva, D. (2014). A development and integration framework for optimisation-based enterprise solutions.

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)
Conference Proceeding
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2014). Computational study for workforce scheduling and routing problems.

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)
Conference Proceeding
Pinheiro, R. L., Constantino, A. A., de Mendonca, C. F. X., & Landa-Silva, D. (2014). An evolutionary algorithm for graph planarisation by vertex deletion.

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.

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems (2013)
Journal Article
Qu, R., Xu, Y., Castro-Gutierrez, J., & Landa-Silva, D. (2013). Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. Journal of Heuristics, 19(2), https://doi.org/10.1007/s10732-012-9198-2

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many ap... Read More about Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems.

Overview of telematics-based prognostics and health management systems for commercial vehicles (2013)
Journal Article
Mesgarpour, M., Landa-Silva, D., & Dickinson, I. (2013). Overview of telematics-based prognostics and health management systems for commercial vehicles. Communications in Computer and Information Science, 395, https://doi.org/10.1007/978-3-642-41647-7_16

Prognostics and Health Management/Monitoring (PHM) are methods to assess the health condition and reliability of systems for the purpose of maximising operational reliability and safety. Recently, PHM systems are emerging in the automotive industry.... Read More about Overview of telematics-based prognostics and health management systems for commercial vehicles.

An evolutionary non-Linear great deluge approach for solving course timetabling problems (2012)
Journal Article
Obit, J. H., Ouelhadj, D., Landa-Silva, D., & Alfred, R. (2012). An evolutionary non-Linear great deluge approach for solving course timetabling problems. International Journal of Computer Science Issues, 9(4),

The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variati... Read More about An evolutionary non-Linear great deluge approach for solving course timetabling problems.

Evolutionary local search for solving the office space allocation problem (2012)
Conference Proceeding
Ulker, O., & Landa-Silva, D. (2012). Evolutionary local search for solving the office space allocation problem.

Office Space Allocation (OSA) is the task of correctly allocating the spatial resources of an institution to a set of entities by minimising the wastage of space and the violation of additional constraints. In this paper, an evolutionary local search... Read More about Evolutionary local search for solving the office space allocation problem.

Designing a multi-agent approach system for distributed course timetabling (2011)
Conference Proceeding
Obit, J. H., Landa-Silva, D., Ouelhadj, D., Khan Vun, T., & Alfred, R. (2011). Designing a multi-agent approach system for distributed course timetabling.

This paper proposes tackling the difficult course timetabling problem using a multi-agent approach. The proposed design seeks to deal with the problem using a distributed solution environment in which a mediator agent coordinates various timetabling... Read More about Designing a multi-agent approach system for distributed course timetabling.

Nature of real-world multi-objective vehicle routing with evolutionary algorithms (2011)
Conference Proceeding
Castro-Gutierrez, J., Landa-Silva, D., & Moreno Perez, J. (2011). Nature of real-world multi-objective vehicle routing with evolutionary algorithms.

The Vehicle Routing Problem with Time Windows VRPTW) is an important logistics problem which in the realworld appears to be multi-objective. Most research in this area has been carried out using classic datasets designed for the single-objective case... Read More about Nature of real-world multi-objective vehicle routing with evolutionary algorithms.

Hybrid heuristic for multi-carrier transportation plans (2011)
Conference Proceeding
Landa-Silva, D., Wang, Y., Donovan, P., & Kendall, G. (2011). Hybrid heuristic for multi-carrier transportation plans.

This paper describes a hybrid heuristic approach to construct transportation plans for a singlecustomer multi-carrier scenario that arises at 3T Logistics Ltd, a UK company that provides outsourced transportation planning and management services. The... Read More about Hybrid heuristic for multi-carrier transportation plans.

Comparing hybrid constructive heuristics for university course timetabling (2011)
Conference Proceeding
Landa-Silva, D., & Obit, J. H. (2011). Comparing hybrid constructive heuristics for university course timetabling.

This extended abstract outlines four hybrid heuristics to generate initial solutions to the University course timetabling problem. These hybrid approaches combine graph colouring heuristics and local search in different ways. Results of experiments u... Read More about Comparing hybrid constructive heuristics for university course timetabling.

Designing difficult office space allocation problem instances with mathematical programming (2011)
Conference Proceeding
Ulker, O., & Landa-Silva, D. (2011). Designing difficult office space allocation problem instances with mathematical programming.

Office space allocation (OSA) refers to the assignment of room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional constraints. In this paper, a mathematic... Read More about Designing difficult office space allocation problem instances with mathematical programming.

A heuristic algorithm for nurse scheduling with balanced preference satisfaction (2011)
Conference Proceeding
Constantino, A. A., Landa-Silva, D., Luiz de Melo, E., & Romao, W. (2011). A heuristic algorithm for nurse scheduling with balanced preference satisfaction.

This paper tackles the nurse scheduling problem with balanced preference satisfaction which consists of generating an assignment of shifts to nurses over a given time horizon and ensuring that the satisfaction of nurses personal preferences for shift... Read More about A heuristic algorithm for nurse scheduling with balanced preference satisfaction.

Non-linear great deluge with reinforcement learning for university course timetabling (2011)
Book Chapter
Obit, J. H., Landa-Silva, D., Sevaux, M., & Ouelhadj, D. (2011). Non-linear great deluge with reinforcement learning for university course timetabling. In M. Caserta, & S. Voss (Eds.), Metaheuristics: intelligent decision making. Springer

This paper describes a non-linear great deluge hyper-heuristic incorporating a reinforcement learning mechanism for the selection of low-level heuristics and a non-linear great deluge acceptance criterion. The proposed hyper-heuristic deals with comp... Read More about Non-linear great deluge with reinforcement learning for university course timetabling.

An adaptive evolutionary multi-objective approach based on simulated annealing (2011)
Journal Article
Li, H., & Landa-Silva, D. (2011). An adaptive evolutionary multi-objective approach based on simulated annealing. Evolutionary Computation, 19(4), https://doi.org/10.1162/EVCO_a_00038

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA... Read More about An adaptive evolutionary multi-objective approach based on simulated annealing.