All Outputs (51)

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.

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

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem (2015)
Conference Proceeding

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

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.

A development and integration framework for optimisation-based enterprise solutions (2014)
Conference Proceeding

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

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

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.

A survey of workforce scheduling and routing (2012)
Conference Proceeding

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 A survey of workforce scheduling and routing.

Evolutionary local search for solving the office space allocation problem (2012)
Conference Proceeding

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

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

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

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.

Designing difficult office space allocation problem instances with mathematical programming (2011)
Conference Proceeding

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.

Comparing hybrid constructive heuristics for university course timetabling (2011)
Conference Proceeding

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.

A heuristic algorithm for nurse scheduling with balanced preference satisfaction (2011)
Conference Proceeding

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.

Towards an integrated workforce management system (2010)
Conference Proceeding

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.

An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem (2010)
Conference Proceeding

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.