Skip to main content

Research Repository

Advanced Search

All Outputs (24)

Local-global methods for generalised solar irradiance forecasting (2024)
Journal Article
Cargan, T. R., Landa-Silva, D., & Triguero, I. (2024). Local-global methods for generalised solar irradiance forecasting. Applied Intelligence, 54(2), 2225-2247. https://doi.org/10.1007/s10489-024-05273-9

For efficient operation, solar power operators often require generation forecasts for multiple sites with varying data availability. Many proposed methods for forecasting solar irradiance / solar power production formulate the problem as a time-serie... Read More about Local-global methods for generalised solar irradiance forecasting.

EUSC: A clustering-based surrogate model to accelerate evolutionary undersampling in imbalanced classification (2020)
Journal Article
Le, H. L., Landa-Silva, D., Galar, M., Garcia, S., & Triguero, I. (2021). EUSC: A clustering-based surrogate model to accelerate evolutionary undersampling in imbalanced classification. Applied Soft Computing, 101, https://doi.org/10.1016/j.asoc.2020.107033

© 2020 Learning from imbalanced datasets is highly demanded in real-world applications and a challenge for standard classifiers that tend to be biased towards the classes with the majority of the examples. Undersampling approaches reduce the size of... Read More about EUSC: A clustering-based surrogate model to accelerate evolutionary undersampling in imbalanced classification.

Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem (2018)
Journal Article
Martínez-Gavara, A., Algethami, H., & Landa-Silva, D. (2018). Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem. Journal of Heuristics, 25(4-5), 753-792. https://doi.org/10.1007/s10732-018-9385-x

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 the operat... Read More about Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem.

Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows (2018)
Journal Article
Curtois, T., Landa-Silva, D., Qu, Y., & Laesanklang, W. (2018). Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. Euro Journal of Transportation and Logistics, 7(2), 151-192. https://doi.org/10.1007/s13676-017-0115-6

© 2018, The Author(s). An effective and fast hybrid metaheuristic is proposed for solving the pickup and delivery problem with time windows. The proposed approach combines local search, large neighbourhood search and guided ejection search in a novel... Read More about Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows.

An evolutionary strategy with machine learning for learning to rank in information retrieval (2018)
Journal Article
Ibrahim, O. A. S., & Landa-Silva, D. (2018). An evolutionary strategy with machine learning for learning to rank in information retrieval. Soft Computing, 22(10), 3171-3185. https://doi.org/10.1007/s00500-017-2988-6

© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. Learning to rank (LTR) is one of the problems attracting researchers in information retrieval (IR). The LTR problem refers to ranking the retrieved documents for users in search engines,... Read More about An evolutionary strategy with machine learning for learning to rank in information retrieval.

Randomized heuristics for the Capacitated Clustering Problem (2017)
Journal Article
Martinez-Gavara, A., Landa-Silva, D., Campos, V., & Marti, R. (2017). Randomized heuristics for the Capacitated Clustering Problem. Information Sciences, 417, https://doi.org/10.1016/j.ins.2017.06.041

In this paper, 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 random... Read More about Randomized heuristics for the Capacitated Clustering Problem.

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm (2017)
Journal Article
Constantino, A. A., de Mendonca, C. F., de Araujo, S. A., Landa-Silva, D., Calvi, R., & dos Santos, A. F. (2017). Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. Journal of Universal Computer Science, 23(5),

The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristi... Read More about Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm.

A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems (2017)
Journal Article
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. (2017). A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems. Journal of Multi-Criteria Decision Analysis, 24(1-2), 37-56. https://doi.org/10.1002/mcda.1604

Understanding the relationships between objectives in a multiobjective optimisation problem is important for developing tailored and efficient solving techniques. In particular, when tackling combinatorial optimisation problems with many objectives t... Read More about A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems.

Dynamic programming with approximation function for nurse scheduling (2016)
Journal Article
Shi, P., & Landa-Silva, D. (2016). Dynamic programming with approximation function for nurse scheduling. Lecture Notes in Artificial Intelligence, 10122, 269-280. https://doi.org/10.1007/978-3-319-51469-7_23

Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature h... Read More about Dynamic programming with approximation function for nurse scheduling.

An application programming interface with increased performance for optimisation problems data (2016)
Journal Article
Pinheiro, R. L., Landa-Silva, D., Qu, R., Constantino, A. A., & Yanaga, E. (in press). An application programming interface with increased performance for optimisation problems data. Journal of Management Analytics, 3(4), https://doi.org/10.1080/23270012.2016.1233514

An optimisation problem can have many forms and variants. It may consider different objectives, constraints, and variables. For that reason, providing a general application programming interface (API) to handle the problem data efficiently in all sce... Read More about An application programming interface with increased performance for optimisation problems data.

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (2016)
Journal Article
Laesanklang, W., & Landa-Silva, D. (2017). Decomposition techniques with mixed integer programming and heuristics for home healthcare planning. Annals of Operations Research, 256(1), 93-127. https://doi.org/10.1007/s10479-016-2352-8

We tackle home healthcare planning scenarios in the UK using decomposition methods that incorporate mixed integer programming solvers and heuristics. Home healthcare planning is a difficult problem that integrates aspects from scheduling and routing.... Read More about Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.

Hyper-volume evolutionary algorithm (2016)
Journal Article
Le, K. N., & Landa-Silva, D. (2016). Hyper-volume evolutionary algorithm

We propose a multi-objective evolutionary algorithm (MOEA), named the Hyper-volume Evolutionary Algorithm (HVEA). The algorithm is characterised by three components. First, individual fitness evaluation depends on the current Pareto front, specifical... Read More about Hyper-volume evolutionary algorithm.

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 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.

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.

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.

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.