All Outputs (51)

UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment (2023)
Conference Proceeding

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.

Evolving Deep CNN-LSTMs for Inventory Time Series Prediction (2019)
Conference Proceeding

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.

A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food (2019)
Conference Proceeding

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

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

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.

A genetic algorithm with composite chromosome for shift assignment of part-time employees (2018)
Conference Proceeding

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

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

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.

Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem (2017)
Conference Proceeding

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

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

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

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

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.

ES-Rank: evolution strategy learning to rank approach (2017)
Conference Proceeding

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.

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints (2017)
Conference Proceeding

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.

A Genetic Algorithm for a Workforce Scheduling and Routing Problem (2016)
Conference Proceeding

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

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.

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints (2016)
Conference Proceeding

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

© 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

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.