98 research outputs found
Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm
This paper combines the idea of a hierarchical distributed genetic algorithm
with different inter-agent partnering strategies. Cascading clusters of
sub-populations are built from bottom up, with higher-level sub-populations
optimising larger parts of the problem. Hence higher-level sub-populations
search a larger search space with a lower resolution whilst lower-level
sub-populations search a smaller search space with a higher resolution. The
effects of different partner selection schemes for (sub-)fitness evaluation
purposes are examined for two multiple-choice optimisation problems. It is
shown that random partnering strategies perform best by providing better
sampling and more diversity
Timetabling System for Medical Officer
The idea was proposed due to the issues that Medical Officer face which is
unorganized and unstructured duty roster management. Thus, inspired by Prototyping – based
methodology, Timetabling System for Medical officer was developed. This research studied
about the scheduling algorithm, tools and knowledge required for system development and the
development process involved. Feasibility study was carried out to ensure the timetabling
system can be develop within scope, time and constrains. Beside the main constrains, other
minor constrains such as cultural, technical and operational was included. Methodology
analysis is carried out in order to choose the suitable methodology to develop the system. The
prototype architecture is shown in the result and discussion. At the end of the report, few
recommendations were listed for the betterment of the system. Besides that, it also can be
used as the reference for the custodian to understand the current status of the project
Bus driver rostering by hybrid methods based on column generation
Tese de doutoramento, Informática (Engenharia Informática), Universidade de Lisboa, Faculdade de Ciências, 2018Rostering problems arise in a diversity of areas where, according to the business and labor rules, distinct variants of the problem are obtained with different constraints and objectives considered. The diversity of existing rostering problems, allied with their complexity, justifies the activity of the research community addressing them. The current research on rostering problems is mainly devoted to achieving near-optimal solutions since, most of the times, the time needed to obtain optimal solutions is very high. In this thesis, a Bus Driver Rostering Problem is addressed, to which an integer programming model is adapted from the literature, and a new decomposition model with three distinct subproblems representations is proposed. The main objective of this research is to develop and evaluate a new approach to obtain solutions to the problem in study. The new approach follows the concept of search based on column generation, which consists in using the column generation method to solve problems represented by decomposition models and, after, applying metaheuristics to search for the best combination of subproblem solutions that, when combined, result in a feasible integer solution to the complete problem. Besides the new decomposition models proposed for the Bus Driver Rostering Problem, this thesis proposes the extension of the concept of search by column generation to allow using population-based metaheuristics and presents the implementation of the first metaheuristic using populations, based on the extension, which is an evolutionary algorithm. There are two additional contributions of this thesis. The first is an heuristic allowing to obtain solutions for the subproblems in an individual or aggregated way and the second is a repair operator which can be used by the metaheuristics to repair infeasible solutions and, eventually, generate missing subproblem solutions needed. The thesis includes the description and results from an extensive set of computational tests. Multiple configurations of the column generation with three decomposition models are tested to assess the best configuration to use in the generation of the search space for the metaheuristic. Additional tests compare distinct single-solution metaheuristics and our basic evolutionary algorithm in the search for integer solutions in the search space obtained by the column generation. A final set of tests compares the results of our final algorithm (with the best column generation configuration and the evolutionary algorithm using the repair operator) and the solutions obtained by solving the problem represented by the integer programming model with a commercial solver.Programa de Apoio à Formação Avançada de Docentes do Ensino Superior Politécnico (PROTEC), SFRH/PROTEC/67405/201
Airline workforce scheduling based on multi-agent systems
El trabajo consiste en realizar una programación de horarios para los empleados del servicio al cliente de una aerolÃnea, junto con el transporte y ruteo de los mismos. Estos problemas son altamente complejos (NP-Hard), por consiguiente, se desarrolló un sistema basado en agentes que permitiera realizar la programación de horarios y simular escenarios inesperados para encontrar una solución eficaz y efectiva. Además, se busca comparar las soluciones de dos métodos diferentes, centralizado y distribuido, junto con la solución actual de la aerolÃnea, analizando el impacto que cada una de estas genera.This project focuses on the workforce scheduling for an airline's customer service employees, along with their transportation and routing. These problems are highly complex (NP-Hard), therefore, an agent-based system was developed that allowed scheduling and simulating unexpected scenarios to find an efficient and effective solution. In addition, it seeks to compare the solutions of two different methods, centralized and distributed, with the current solution of the airline, analyzing the impact that each of these generates.Ingeniero (a) IndustrialPregrad
'On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners'
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bottom up, with higher-level sub-populations optimising larger parts of the problem. Hence higher-level sub-populations potentially search a larger search space with a lower resolution whilst lower-level sub-populations search a smaller search space with a higher resolution. The effects of different partner selection schemes amongst the sub-populations on solution quality are examined for two constrained optimisation problems. We examine a number of recombination partnering strategies in the construction of higher-level individuals and a number of related schemes for evaluating sub-solutions. It is shown that partnering strategies that exploit problem-specific knowledge are superior and can counter inappropriate (sub-) fitness measurements
Decentralized and Dynamic Home Health Care Resource Scheduling Using an Agent-Based Model
The purpose of this thesis is to design an agent-based scheduling system, simulated in a dynamic environment that will reduce home healthcare service costs. The study focuses on situations where a health care agency needs to assign home visits among a group of independent healthcare practitioners. Each practitioner has different skill sets, time constraints, and cost structures, given the nature, time and location of each home visit. Each expects reasonable payment commensurate with their skill levels as well as the costs incurred. The healthcare agency in turn needs all planned visits performed by qualified practitioners while minimizing overall service costs. Decisions about scheduling are made both before and during the scheduling period, requiring the health care agency to respond to unexpected situations based on the latest scheduling information.
This problem is examined in a multi-agent system environment where practitioners are modeled as self-interested agents. The study first analyzes the problem for insights into the combinatorial nature of such a problem occurring in a centralized environment, then discusses the decentralized and dynamic challenges. An iterated bidding mechanism is designed as the negotiation protocol for the system. The effectiveness of this system is evaluated through a computational study, with results showing the proposed multi-agent scheduling system is able to compute high quality schedules in the decentralized home healthcare environment. Following this, the system is also implemented in a simulation model that can accommodate unexpected situations. We presents different simulation scenarios which illustrate the process of how the system dynamically schedules incoming visits, and cost reduction can be observed from the results
Novel heuristic and metaheuristic approaches to the automated scheduling of healthcare personnel
This thesis is concerned with automated personnel scheduling in healthcare organisations; in particular, nurse rostering. Over the past forty years the nurse rostering problem has received a large amount of research. This can be mostly attributed to its practical applications and the scientific challenges of solving such a complex problem. The benefits of automating the rostering process include reducing the planner’s workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare.
Basically stated, the nurse rostering problem requires the assignment of shifts to personnel to ensure that sufficient employees are present to perform the duties required. There are usually a number of constraints such as working regulations and legal requirements and a number of objectives such as maximising the nurses working preferences. When formulated mathematically this problem can be shown to belong to a class of problems which are considered intractable. The work presented in this thesis expands upon the research that has already been conducted to try and provide higher quality solutions to these challenging problems in shorter computation times.
The thesis is broadly structured into three sections. 1) An investigation into a nurse rostering problem provided by an industrial collaborator. 2) A framework to aid research in nurse rostering. 3) The development of a number of advanced algorithms for solving highly complex, real world problems
Solving Challenging Real-World Scheduling Problems
This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use.
The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems.
The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.Siirretty Doriast
Metaheuristic Design Patterns: New Perspectives for Larger-Scale Search Architectures
Design patterns capture the essentials of recurring best practice in an abstract form. Their merits are well established in domains as diverse as architecture and software development. They offer significant benefits, not least a common conceptual vocabulary for designers, enabling greater communication of high-level concerns and increased software reuse. Inspired by the success of software design patterns, this chapter seeks to promote the merits of a pattern-based method to the development of metaheuristic search software components. To achieve this, a catalog of patterns is presented, organized into the families of structural, behavioral, methodological and component-based patterns. As an alternative to the increasing specialization associated with individual metaheuristic search components, the authors encourage computer scientists to embrace the ‘cross cutting' benefits of a pattern-based perspective to optimization algorithms. Some ways in which the patterns might form the basis of further larger-scale metaheuristic component design automation are also discussed
Timetabling System for Medical Officer
The idea was proposed due to the issues that Medical Officer face which is
unorganized and unstructured duty roster management. Thus, inspired by Prototyping – based
methodology, Timetabling System for Medical officer was developed. This research studied
about the scheduling algorithm, tools and knowledge required for system development and the
development process involved. Feasibility study was carried out to ensure the timetabling
system can be develop within scope, time and constrains. Beside the main constrains, other
minor constrains such as cultural, technical and operational was included. Methodology
analysis is carried out in order to choose the suitable methodology to develop the system. The
prototype architecture is shown in the result and discussion. At the end of the report, few
recommendations were listed for the betterment of the system. Besides that, it also can be
used as the reference for the custodian to understand the current status of the project
- …