Skip to main content

Research Repository

Advanced Search

Outputs (87)

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.

UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment (2023)
Conference Proceeding
Maaji, S. S., & Landa-Silva, D. (2023). UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment. In Computational Logistics. ICCL 2023 (467-481). https://doi.org/10.1007/978-3-031-43612-3_29

This paper proposes a model for unmanned aerial vehicles (UAV) grid-based coverage path planning, considering coverage completeness and energy consumption in complex environments with multiple obstacles. The work is inspired by the need for more effi... Read More about UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment.

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.

Evolving Deep CNN-LSTMs for Inventory Time Series Prediction (2019)
Conference Proceeding
Xue, N., Triguero, I., Figueredo, G. P., & Landa-Silva, D. (2019). Evolving Deep CNN-LSTMs for Inventory Time Series Prediction. . https://doi.org/10.1109/CEC.2019.8789957

Inventory forecasting is a key component of effective inventory management. In this work, we utilise hybrid deep learning models for inventory forecasting. According to the highly nonlinear and non-stationary characteristics of inventory data, the mo... Read More about Evolving Deep CNN-LSTMs for Inventory Time Series Prediction.

An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes (2019)
Book Chapter
Pinheiro, R. L., Landa-Silva, D., Laesanklang, W., & Constantino, A. A. (2019). An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes. In Operations Research and Enterprise Systems (134-152). Springer Verlag. https://doi.org/10.1007/978-3-030-16035-7_8

© 2019, Springer Nature Switzerland AG. Many real-world applications require decision-makers to assess the quality of solutions while considering multiple conflicting objectives. Obtaining good approximation sets for highly constrained many-objective... Read More about An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes.

A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food (2019)
Conference Proceeding
Xue, N., Landa-Silva, D., Figueredo, G. P., & 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). https://doi.org/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 about A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food.

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 about An agent based modelling approach for the office space allocation problem.

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 about Lookahead policy and genetic algorithm for solving nurse rostering problems.

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.

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 about A genetic algorithm with composite chromosome for shift assignment of part-time employees.

Fuzzy C-means-based scenario bundling for stochastic service network design (2018)
Conference Proceeding
Jiang, X., Bai, R., Landa-Silva, D., & Aickelin, U. (2018). Fuzzy C-means-based scenario bundling for stochastic service network design. In 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings (1-8). https://doi.org/10.1109/SSCI.2017.8280905

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 about Fuzzy C-means-based scenario bundling for stochastic service network design.

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 about Using goal programming on estimated Pareto fronts to solve multiobjective problems.

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.

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. In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems ICORES - Volume 1 (416-423)

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 about Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem.

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. In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems ICORES - Volume 1 (477-482)

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 about Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations.

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 about Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem.

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. In 2017 IEEE Congress on Evolutionary Computation (CEC 2017) - Proceedings (1771-1778). https://doi.org/10.1109/CEC.2017.7969516

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 about Diversity-based adaptive genetic algorithm for a Workforce Scheduling and Routing Problem.

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 Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences

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 about Multi-start methods for the capacitated clustering problem.

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.

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. In SAC '17: Proceedings of the Symposium on Applied Computing (944-950). https://doi.org/10.1145/3019612.3019696

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 about ES-Rank: evolution strategy learning to rank approach.

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.

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints (2017)
Conference Proceeding
Laesanklang, W., Landa-Silva, D., & Castillo-Salazar, J. A. (2017). An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints. In B. Vitoriano, & G. Parlier (Eds.), ICORES 2016: Operations research and enterprise systems (239-260). https://doi.org/10.1007/978-3-319-53982-9_14

This paper presents an investigation into the application of heuristic decomposition and mixed-integer programming to tackle workforce scheduling and routing problems (WSRP) that involve time dependent activities constraints. These constraints refer... Read More about An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints.

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.

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 about A Genetic Algorithm for a Workforce Scheduling and Routing Problem.

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). https://doi.org/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 about Towards an efficient API for optimisation problems data.

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.

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 about Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints.

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem (2015)
Conference Proceeding
Laesanklang, W., Pinheiro, R. L., Algethami, H., & Landa-Silva, D. (2015). Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem. In D. D. Werra, G. H. Parlier, & B. Vitoriano (Eds.), Operations research and enterprise systems: 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015: revised selected papers (191–211). https://doi.org/10.1007/978-3-319-27680-9_12

© 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)
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 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)
Conference Proceeding
Pinheiro, R. L., Landa-Silva, D., & Atkin, J. (2015). A variable neighbourhood search for the workforce scheduling and routing problem. In N. Pillay, A. P. Engelbrecht, A. Abraham, M. C. du Plessis, V. Snášel, & A. K. Muda (Eds.), Advances in nature and biologically inspired computing: proceedings of the 7th World Congress on Nature and Biologically Inspired Computing, NaBIC2015, in Pietermaritzburg, South Africa, held December 01-03, 2015 (247–259). https://doi.org/10.1007/978-3-319-27400-3_22

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)
Conference Proceeding
Ibrahim, O. A. S., & Landa-Silva, D. (2016). (1+1)-Evolutionary gradient strategy to evolve global term weights in information retrieval. In P. Angelov, A. Gegov, C. Jayne, & Q. Shen (Eds.), Advances in computational intelligence systems: contributions presented at the 16th UK Workshop on Computational Intelligence, September 7–9, 2016, Lancaster, UK (387–405). https://doi.org/10.1007/978-3-319-46562-3_25

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

An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem (2010)
Conference Proceeding
Li, H., & Landa-Silva, D. (2010). An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem. In Evolutionary Multi-Criterion Optimization: 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, (481-494). https://doi.org/10.1007/978-3-642-01020-0_38

We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objective quadratic assignment problem (mQAP). The proposed algorithm is char... Read More about An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem.

Towards an integrated workforce management system (2010)
Conference Proceeding
Landa-Silva, D., Castillo, A., Bowie, L., & Johnston, H. (2010). Towards an integrated workforce management system

We describe progress towards a workforce management system in which personnel scheduling is integrated with other important processes such as payroll processing, attendance and absence recording, staffing forecast and planning, etc. Our focus is on c... Read More about Towards an integrated workforce management system.

Improved dynamic lexicographic ordering for multi-objective optimisation (2010)
Conference Proceeding
Castro-Gutierrez, J., Landa-Silva, D., & Moreno-Perez, J. A. (2010). Improved dynamic lexicographic ordering for multi-objective optimisation.

There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. establishing weights in a weighted approach or setting the ordering in a lexicographi... Read More about Improved dynamic lexicographic ordering for multi-objective optimisation.

CODEA : an agent based multi-objective optimization framework (2010)
Conference Proceeding
Castro-Gutierrez, J., Landa-Silva, D., & Moreno-Perez, J. (2010). CODEA : an agent based multi-objective optimization framework.

This work presents CODEA, a COoperative DEcentralized Architecture for Multiobjective Optimization. CODEA is an objectoriented framework that aims at the creation of groups of agents to tackle complex problems by cooperative search. This cooperation... Read More about CODEA : an agent based multi-objective optimization framework.

Computational study of non-linear great deluge for university course timetabling (2010)
Book Chapter
Obit, J. H., & Landa-Silva, D. (2010). Computational study of non-linear great deluge for university course timetabling. In V. Sgurev, M. Hadjiski, & J. Kacprzyk (Eds.), Intelligent systems: from theory to practice. Springer

The great deluge algorithm explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original great deluge method, the water le... Read More about Computational study of non-linear great deluge for university course timetabling.

Iterated heuristic algorithms for the classroom assignment problem (2010)
Conference Proceeding
Constantino, A. A., Filho, W. M., & Landa-Silva, D. (2010). Iterated heuristic algorithms for the classroom assignment problem.

We tackle the classroom assignment problem in a large University with the objective of minimising the total distance between all classrooms assigned to teaching activities in the same course. Additional requirements that should be satisfied include:... Read More about Iterated heuristic algorithms for the classroom assignment problem.

A 0/1 integer programming model for the office space allocation problem (2010)
Journal Article
Ulker, O., & Landa-Silva, D. (2010). A 0/1 integer programming model for the office space allocation problem. Electronic Notes in Discrete Mathematics, 36, https://doi.org/10.1016/j.endm.2010.05.073

We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfyi... Read More about A 0/1 integer programming model for the office space allocation problem.

Towards an integrated workforce management system (2010)
Conference Proceeding
Landa-Silva, D., Castillo, A., Bowie, L., & Johnston, H. (2010). Towards an integrated workforce management system.

We describe progress towards a workforce management system in which personnel scheduling is integrated with other important processes such as payroll processing, attendance and absence recording, staffing forecast and planning, etc. Our focus is on c... Read More about Towards an integrated workforce management system.

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails (2010)
Conference Proceeding
Li, H., Landa-Silva, D., & Gandibleux, X. (2010). Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails.

Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic representation, called Q-bit, to encode individuals in population. Unlike standard... Read More about Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails.

Towards the design of heuristics by means of self-assembly (2010)
Conference Proceeding
Terrazas, G., Landa-Silva, D., & Krasnogor, N. (2010). Towards the design of heuristics by means of self-assembly.

The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to... Read More about Towards the design of heuristics by means of self-assembly.

Discovering beneficial cooperative structures for the automated construction of heuristics (2010)
Book Chapter
Terrazas, G., Landa-Silva, D., & Krasnogor, N. (2010). Discovering beneficial cooperative structures for the automated construction of heuristics. In Nature inspired cooperative strategies for optimization (NICSO 2010) (89-100). Springer Verlag. https://doi.org/10.1007/978-3-642-12538-6_8

The current research trends on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to... Read More about Discovering beneficial cooperative structures for the automated construction of heuristics.

An improved version of volume dominance for multi-objective optimisation (2009)
Book Chapter
Le, K., Landa-Silva, D., & Li, H. (2009). An improved version of volume dominance for multi-objective optimisation. In Evolutionary Multi-Criterion Optimization: 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, (231-245). Springer Verlag. https://doi.org/10.1007/978-3-642-01020-0_21

This paper proposes an improved version of volume dominance to assign fitness to solutions in Pareto-based multi-objective optimisation. The impact of this revised volume dominance on the performance of multi-objective evolutionary algorithms is inve... Read More about An improved version of volume dominance for multi-objective optimisation.

Heuristic approach for automated shelf space allocation (2009)
Conference Proceeding
Landa-Silva, D., Marikar, F., & Le, K. (2009). Heuristic approach for automated shelf space allocation. In SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing, (922-928). https://doi.org/10.1145/1529282.1529482

Shelf space allocation is the problem of efficiently arranging retail products on shelves in order to maximise profit, improve stock control, improve customer satisfaction, etc. Most work reported in the literature on this problem has focused on the... Read More about Heuristic approach for automated shelf space allocation.

Evolutionary non-linear great deluge for university course timetabling (2009)
Book Chapter
Landa-Silva, D., & Obit, J. H. (2009). Evolutionary non-linear great deluge for university course timetabling. In Hybrid Artificial Intelligence Systems: 4th International Conference, HAIS 2009, Salamanca, Spain, June 10-12, 2009. Proceedings, (269-276). Springer Verlag. https://doi.org/10.1007/978-3-642-02319-4_32

This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm in which evolutionary operators are incorporated. First, we generate a... Read More about Evolutionary non-linear great deluge for university course timetabling.

Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach (2009)
Book Chapter
Castro, J. P., Landa-Silva, D., & Moreno Pérez, J. A. (2009). Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach. In Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), (103-114). Springer Verlag. https://doi.org/10.1007/978-3-642-03211-0_9

This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW). The proposed algorithm incorporates some p... Read More about Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach.

Great deluge with non-linear decay rate for solving course timetabling problems (2008)
Conference Proceeding
Landa-Silva, D., & Obit, J. H. (2008). Great deluge with non-linear decay rate for solving course timetabling problems. https://doi.org/10.1109/IS.2008.4670447

Course timetabling is the process of allocating, subject to constraints, limited rooms and timeslots for a set of courses to take place. Usually, in addition to constructing a feasible timetable (all constraints satisfied), there are desirable goals... Read More about Great deluge with non-linear decay rate for solving course timetabling problems.

Evolutionary multi-objective simulated annealing with adaptive and competitive search direction (2008)
Conference Proceeding
Li, H., & Landa-Silva, D. (2008). Evolutionary multi-objective simulated annealing with adaptive and competitive search direction. https://doi.org/10.1109/CEC.2008.4631246

In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature. The proposed algorithm is called Evolutionary Multiobjective Simulated An... Read More about Evolutionary multi-objective simulated annealing with adaptive and competitive search direction.

A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling (2008)
Book Chapter
Landa-Silva, D., & Le, K. N. (2008). A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling. In Adaptive and Multilevel Metaheuristics, (133-155). Springer Verlag. https://doi.org/10.1007/978-3-540-79438-7_7

We present a multi-objective approach to tackle a real-world nurse scheduling problem using an evolutionary algorithm. The aim is to generate a few good quality non-dominated schedules so that the decision-maker can select the most appropriate one. O... Read More about A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling.

Adaptive and assortative mating scheme for evolutionary multi-objective algorithms (2008)
Book Chapter
Le, K., & Landa-Silva, D. (2008). Adaptive and assortative mating scheme for evolutionary multi-objective algorithms. In Artificial Evolution: 8th International Conference, Evolution Artificielle, EA 2007, Tours, France, October 29-31, 2007, Revised Selected Papers, (172-183). Springer Verlag. https://doi.org/10.1007/978-3-540-79305-2_15

We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating scheme that uses similarity in the decision space (genotypic assortative ma... Read More about Adaptive and assortative mating scheme for evolutionary multi-objective algorithms.

Towards improving the utilization of university teaching space (2007)
Journal Article
Beyrouthy, C., Burke, E. K., Landa-Silva, D., McCollum, B., McMullan, P., & Parkes, A. J. (2009). Towards improving the utilization of university teaching space. Journal of the Operational Research Society, 60(1), 130-143. https://doi.org/10.1057/palgrave.jors.2602523

There is a perception that teaching space in universities is a rather scarce resource. However, some studies have revealed that in many institutions it is actually chronically under-used. Often, rooms are occupied only half the time, and even when in... Read More about Towards improving the utilization of university teaching space.

Obtaining better non-dominated sets using volume dominance (2007)
Conference Proceeding
Le, K., & Landa-Silva, D. (2007). Obtaining better non-dominated sets using volume dominance. In 2007 IEEE Congress on Evolutionary Computation, (3119-3126). https://doi.org/10.1109/CEC.2007.4424870

An important goal in multiobjective optimisation is to And a good set of non-dominated solutions that is both well-distributed and well-converged. Most multiobjective optimisation algorithms use the conventional Pareto dominance relationship. Over re... Read More about Obtaining better non-dominated sets using volume dominance.

Asynchronous cooperative local search for the office-space-allocation problem (2007)
Journal Article
Landa-Silva, D., & Burke, D. K. (2007). Asynchronous cooperative local search for the office-space-allocation problem. INFORMS Journal on Computing, 19(4), 575-587. https://doi.org/10.1287/ijoc.1060.0200

We investigate cooperative local search to improve upon known results of the office-space-allocation problem in universities and other organizations. A number of entities (e.g., research students, staff, etc.) must be allocated into a set of rooms so... Read More about Asynchronous cooperative local search for the office-space-allocation problem.

The teaching space allocation problem with splitting (2006)
Book Chapter
Beyrouthy, C., Burke, E. K., Landa-Silva, D., Mccollum, B., Mcmullan, P., & Parkes, A. J. (2006). The teaching space allocation problem with splitting. In Practice and Theory of Automated Timetabling: VI 6th International Conference, PATAT 2006 Brno, Czech Republic, August 30–September 1, 2006 Revised Selected Papers, (228-247). Springer Verlag. https://doi.org/10.1007/978-3-540-77345-0_15

A standard problem within universities is that of teaching space allocation which can be thought of as the assignment of rooms and times to various teaching activities. The focus is usually on courses that are expected to fit into one room. However,... Read More about The teaching space allocation problem with splitting.

The influence of the fitness evaluation method on the performance of multiobjective search algorithms (2006)
Journal Article
Burke, E. K., & Landa Silva, J. D. (2006). The influence of the fitness evaluation method on the performance of multiobjective search algorithms. European Journal of Operational Research, 169(3), 875-897. https://doi.org/10.1016/j.ejor.2004.08.028

In this paper we are concerned with finding the Pareto optimal front or a good approximation to it. Since non-dominated solutions represent the goal in multiobjective optimisation, the dominance relation is frequently used to establish preference bet... Read More about The influence of the fitness evaluation method on the performance of multiobjective search algorithms.

Multi-objective hyper-heuristic approaches for space allocation and timetabling (2005)
Book Chapter
Burke, E. K., Landa Silva, D. J., & Soubeiga, E. (2005). Multi-objective hyper-heuristic approaches for space allocation and timetabling. In Meta-heuristics: Progress as Real Problem Solvers, (129-158). Springer Verlag. https://doi.org/10.1007/0-387-25383-1_6

An important issue in multi-objective optimisation is how to ensure that the obtained non-dominated set covers the Pareto front as widely as possible. A number of techniques (e.g. weight vectors, niching, clustering, cellular structures, etc.) have b... Read More about Multi-objective hyper-heuristic approaches for space allocation and timetabling.

Hybrid population-based metaheuristic approaches for the space allocation problem (2001)
Conference Proceeding
Burke, E. K., Cowling, P., & Landa Silva, J. D. (2001). Hybrid population-based metaheuristic approaches for the space allocation problem. In Proceedings of the 2001 Congress on Evolutionary Computation, (232-239). https://doi.org/10.1109/CEC.2001.934394

A hybrid population-based metaheuristic for the space allocation problem in academic institutions is presented that is based upon previous experiments using a range of techniques including hill-climbing, simulated annealing, tabu search and genetic a... Read More about Hybrid population-based metaheuristic approaches for the space allocation problem.

Three methods to automate the space allocation process in UK universities (2001)
Book Chapter
Burke, E. K., Cowling, P., Landa Silva, J. D., & McCollum, B. (2001). Three methods to automate the space allocation process in UK universities. In Evolutionary Multi-Criterion Optimization: 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, (254-273). Springer Verlag. https://doi.org/10.1007/978-3-642-01020-0_38

The space allocation problem within UK universities is highly constrained, has multiple objectives, varies greatly among different institutions, requires frequent modifications and has a direct impact on the functionality of the university. As in eve... Read More about Three methods to automate the space allocation process in UK universities.