All Outputs (87)

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm (2017)
Journal Article

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

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

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

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

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

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

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

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.

Hyper-volume evolutionary algorithm (2016)
Journal Article

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

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.

Term frequency with average term occurrences for textual information retrieval (2015)
Journal Article

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

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

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

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

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

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

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.