Skip to main content

Research Repository

See what's under the surface


A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food (2019)
Conference Proceeding
Xue, N., Landa-Silva, D., Figueredo, G., & Triguero, I. (2019). A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, 406-413. doi:10.5220/0007401304060413

The taste and freshness of perishable foods decrease dramatically with time. Effective inventory management requires understanding of market demand as well as balancing customers needs and references with products’ shelf life. The objective is to av... Read More

An agent based modelling approach for the office space allocation problem (2018)
Conference Proceeding
Dediu, A., Landa-Silva, D., & Siebers, P. (2018). An agent based modelling approach for the office space allocation problem

This paper describes an agent based simulation model to create solutions for the office space allocation (OSA) problem. OSA is a combinatorial optimization problem concerned with the allocation of available office space to a set of entities such as p... Read More

Lookahead policy and genetic algorithm for solving nurse rostering problems (2018)
Conference Proceeding
Peng, S., & Dario, L. (2018). Lookahead policy and genetic algorithm for solving nurse rostering problems. In n/a

Previous research has shown that value function approximation in dynamic programming does not perform too well when tackling difficult combinatorial optimisation problem such as multi-stage nurse rostering. This is because the large action space that... Read More

A genetic algorithm with composite chromosome for shift assignment of part-time employees (2018)
Conference Proceeding
Xue, N., Landa-Silva, D., Triguero, I., & Figueredo, G. P. (2018). A genetic algorithm with composite chromosome for shift assignment of part-time employees

Personnel scheduling problems involve multiple tasks, including assigning shifts to workers. The purpose is usually to satisfy objectives and constraints arising from management, labour unions and employee preferences. The shift assignment problem is... Read More

Using goal programming on estimated Pareto fronts to solve multiobjective problems (2018)
Conference Proceeding
Pinheiro, R. L., Landa-Silva, D., Laesanklang, W., & Constantino, A. A. (2018). Using goal programming on estimated Pareto fronts to solve multiobjective problems

Modern multiobjective algorithms can be computationally inefficient in producing good approximation sets for highly constrained many-objective problems. Such problems are common in real-world applications where decision-makers need to assess multiple... Read More

Fuzzy C-means-based scenario bundling for stochastic service network design (2017)
Conference Proceeding
Jiang, X., Bai, R., Landa-Silva, D., & Aickelin, U. (2017). Fuzzy C-means-based scenario bundling for stochastic service network design

Stochastic service network designs with uncertain demand represented by a set of scenarios can be modelled as a large-scale two-stage stochastic mixed-integer program (SMIP). The progressive hedging algorithm (PHA) is a decomposition method for solvi... Read More

Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem (2017)
Conference Proceeding
Shi, P., & Landa-Silva, D. (2017). Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem

An approximate dynamic programming that incorporates a combined policy, value function approximation and lookahead policy, is proposed. The algorithm is validated by applying it to solve a set of instances of the nurse rostering problem tackled as a... Read More

Multi-start methods for the capacitated clustering problem (2017)
Conference Proceeding
Martinez-Gavara, A., Campos, V., Landa-Silva, D., & Marti, R. (2017). Multi-start methods for the capacitated clustering problem

In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomi... Read More

Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem (2017)
Conference Proceeding
Algethami, H., & Landa-Silva, D. (2017). Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem

The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling numerous scheduling and routing constraints while aiming to minimise total opera... Read More

ES-Rank: evolution strategy learning to rank approach (2017)
Conference Proceeding
Ibrahim, O. A. S., & Landa-Silva, D. (2017). ES-Rank: evolution strategy learning to rank approach

Learning to Rank (LTR) is one of the current problems in Information Retrieval (IR) that attracts the attention from researchers. The LTR problem is mainly about ranking the retrieved documents for users in search engines, question answering and prod... Read More

Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem (2017)
Conference Proceeding
Algethami, H., Landa-Silva, D., & Martinez-Gavara, A. (2017). Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem

The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including cust... Read More

Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations (2017)
Conference Proceeding
Curtois, T., Laesanklang, W., Landa-Silva, D., Mesgarpour, M., & Qu, Y. (2017). Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations

This paper gives an overview of research work in progress within the COSLE (Collaborative Optimisation in a Shared Logistics Environment) project between the University of Nottingham and Microlise Ltd. This is an R&D project that seeks to develop opt... Read More

A Genetic Algorithm for a Workforce Scheduling and Routing Problem (2016)
Conference Proceeding
Algethami, H., Pinheiro, R. L., & Landa-Silva, D. (2016). A Genetic Algorithm for a Workforce Scheduling and Routing Problem

The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling scheduling and routing constraints while aiming to minimise the total operationa... Read More

Towards an efficient API for optimisation problems data (2016)
Conference Proceeding
Pinheiro, R. L., Landa-Silva, D., Qu, R., Yanaga, E., & Constantino, A. A. (2016). Towards an efficient API for optimisation problems data. In . S. Hammoudi, . L. Maciaszek, . M. M. Missikoff, O. Camp, & . J. Cordeiro (Eds.), Proceedings of the 18th International Conference on Enterprise Information Systems . Volume 2: ICEIS, 89-98. doi:10.5220/0005915800890098

The literature presents many application programming interfaces (APIs) and frameworks that provide state of the art algorithms and techniques for solving optimisation problems. The same cannot be said about APIs and frameworks focused on the problem... Read More

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints (2016)
Conference Proceeding
Laesanklang, W., Landa-Silva, D., & Castillo-Salazar, J. A. (2016). Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints

We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RD... Read More

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

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

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

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

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