Addressing the facilities layout design problem through constraint logic programming

One of the most difficult problems that face researchers experimenting with complex systems in real world applications is the Facility Layout Design Problem. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities. In this work it is intended to address this problem through the use of Constraint Logic Programming (CLP) technology. The use of Genetic Algorithms (GA) as optimisation technique in CLP environment is also an issue addressed. The approach aims the implementation of genetic algorithm operators following the CLP paradigm.

Scheduling maintenance activities of electric power transmission networks using an hybrid constraint method

In this paper we present a Constraint Logic Programming (CLP) based model, and hybrid solving method for the Scheduling of Maintenance Activities in the Power Transmission Network. The model distinguishes from others not only because of its completeness but also by the way it models and solves the Electric Constraints. Specifically we present a efficient filtering algorithm for the Electrical Constraints. Furthermore, the solving method improves the pure CLP methods efficiency by integrating a type of Local Search technique with CLP. To test the approach we compare the method results with another method using a 24 bus network, which considerers 42 tasks and 24 maintenance periods.

A user-centered interface for scheduling problem definition

In this paper we present a user-centered interface for a scheduling system. The purpose of this interface is to provide graphical and interactive ways of defining a scheduling problem. To create such user interface an evaluation-centered user interaction development method was adopted: the star life cycle. The created prototype comprises the Task Module and the Scheduling Problem Module. The first one allows users to define a sequence of operations, i.e., a task. The second one enables a scheduling problem definition, which consists in a set of tasks. Both modules are equipped with a set of real time validations to assure the correct definition of the necessary data input for the scheduling module of the system. The usability evaluation allowed us to measure the ease of interaction and observe the different forms of interaction provided by each participant, namely the reactions to the real time validation mechanism.

An optimal scheduling problem in distribution networks considering V2G

This paper addresses the problem of energy resource scheduling. An aggregator will manage all distributed resources connected to its distribution network, including distributed generation based on renewable energy resources, demand response, storage systems, and electrical gridable vehicles. The use of gridable vehicles will have a significant impact on power systems management, especially in distribution networks. Therefore, the inclusion of vehicles in the optimal scheduling problem will be very important in future network management. The proposed particle swarm optimization approach is compared with a reference methodology based on mixed integer non-linear programming, implemented in GAMS, to evaluate the effectiveness of the proposed methodology. The paper includes a case study that consider a 32 bus distribution network with 66 distributed generators, 32 loads and 50 electric vehicles.

Ant colony search algorithm for the optimal power flow problem

To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature.

Problem-Based Learning e suas implicações: breve revisão teórica

A ESTSP-IPP implementou em 2008-2009 um novo modelo pedagógico, o PBL, em três licenciaturas. Este modelo tem sido considerado capaz de promover a aquisição de conhecimentos mas também o desenvolvimento de competências transversais valorizadas no mercado de trabalho; orienta-se em torno de problemas significativos da realidade profissional, trabalhados segundo a metodologia dos sete passos, destacando-se a aprendizagem através de pesquisa individual e trabalho de grupo; e visa ainda desenvolver processos cognitivos e metacognitivos como levantar hipóteses, comparar, analisar, interpretar e avaliar. Neste artigo, caracterizamos brevemente o modelo e respectivas implicações, justificando o interesse em investigar as repercussões da sua implementação.

Ant colony system based approach to single machine scheduling problems: weighted tardiness scheduling problem

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

Solving MPCC problem with the hyperbolic penalty function

The main goal of this work is to solve mathematical program with complementarity constraints (MPCC) using nonlinear programming techniques (NLP). An hyperbolic penalty function is used to solve MPCC problems by including the complementarity constraints in the penalty term. This penalty function [1] is twice continuously differentiable and combines features of both exterior and interior penalty methods. A set of AMPL problems from MacMPEC [2] are tested and a comparative study is performed.

Solving a signalized traffic intersection problem with an hyperbolic penalty function

Mathematical Program with Complementarity Constraints (MPCC) finds many applications in fields such as engineering design, economic equilibrium and mathematical programming theory itself. A queueing system model resulting from a single signalized intersection regulated by pre-timed control in traffic network is considered. The model is formulated as an MPCC problem. A MATLAB implementation based on an hyperbolic penalty function is used to solve this practical problem, computing the total average waiting time of the vehicles in all queues and the green split allocation. The problem was codified in AMPL.

Motivations which influence volunteers' satisfaction

In this paper we attempt to find out which motivations influence volunteers satisfaction. So, in a first moment, we categorize satisfaction through a factor analysis and then use linear regression models to find out the relations previously mentioned. Furthermore we analyse the existence of correlations between some demographic attributes and the other variables. In this research the population under study includes volunteers that work in the health area, more precisely volunteers that work in hospital and have direct contact with patients and their families. We obtained a total of 327 questionnaires and after excluding incomplete answers we get 304 questionnaires which embody a response rate of 36%. The outcomes of our analysis reveal that we can categorize satisfaction into intrinsic and extrinsic categories and show that motivations related to belonging and protection and career recognition are the ones influencing extrinsic satisfaction; motivations associated to development and learning and altruism are the ones with higher effect in intrinsic satisfaction. There are some negative correlations between age and extrinsic satisfaction, between years of participation and extrinsic satisfaction, between education and the motivation related to belonging and protection and between age and the motivation related to career recognition. There is only one positive correlation between hours per week and intrinsic satisfaction. The results offer new insights for research about volunteers’ motivations, motive fulfillment and volunteer satisfaction. Furthermore the outcomes advocate that to ensure satisfied volunteers, their motivations must be identified in a timely and appropriate moment, meaning that should happened as early as possible.

Organisational influence on volunteer satisfaction and attitudes towards HRM practices: the case of hospital volunteers

We examine volunteer satisfaction with HRM practices, namely recruitment, training and reward in NPOs and attitudes regarding the appropriateness of these practices. The participants in this study are 76 volunteers affiliated with four different NPOs, who work in hospitals and have direct contact with patients and their families. Analysing aggregate results we show that volunteers are more satisfied with training, and consider the training strategies to be very appropriate. After identifying differences between organisations we discover that in some organisations volunteers are satisfied with rewards but they have negative attitudes regarding the appropriateness of the recognition strategies. We also identify the volunteers who are the most and the least satisfied.

Inexact restoration approaches to solve mathematical program with complementarity constraints

Mathematical Program with Complementarity Constraints (MPCC) finds applica- tion in many fields. As the complementarity constraints fail the standard Linear In- dependence Constraint Qualification (LICQ) or the Mangasarian-Fromovitz constraint qualification (MFCQ), at any feasible point, the nonlinear programming theory may not be directly applied to MPCC. However, the MPCC can be reformulated as NLP problem and solved by nonlinear programming techniques. One of them, the Inexact Restoration (IR) approach, performs two independent phases in each iteration - the feasibility and the optimality phases. This work presents two versions of an IR algorithm to solve MPCC. In the feasibility phase two strategies were implemented, depending on the constraints features. One gives more importance to the complementarity constraints, while the other considers the priority of equality and inequality constraints neglecting the complementarity ones. The optimality phase uses the same approach for both algorithm versions. The algorithms were implemented in MATLAB and the test problems are from MACMPEC collection.

Eficácia do Constraint-Induced Movement Therapy, em utentes com sequelas de Acidente Vascular Encefálico, até 9 meses

O Acidente Vascular Encefálico é uma das principais causas de morte, tornando-se cada vez mais iminente processos de reabilitação que minimizem as sequelas, nomeadamente as limitações do membro superior que dificultam o envolvimento em atividades da vida diária. O Constraint-Induced Movement Therapy, surge como uma abordagem que incrementa o uso do membro superior mais afetado. A presente investigação trata-se de um estudo de casos múltiplos. Pretende-se verificar se existem melhorias na funcionalidade do membro superior mais afetado, analisar em que atividades da vida diária são visíveis melhorias funcionais e compreender se o maior envolvimento nas atividades diárias está diretamente relacionado com a melhoria na capacidade funcional. Pretende-se ainda que os valores obtidos no Wolf Motor Function Test sejam um contributo para a sua validação para a população portuguesa. Utilizou-se um questionário para recolha de dados pessoais e clínicos (amplitudes de movimento, dor e espasticidade); o Wolf Motor Function Test e o Action Research Arm Test para verificar a funcionalidade do membro superior mais afetado; e a Motor Activity Log que avalia o envolvimento em atividades da vida diária. O grupo é constituído por 3 utentes que sofreram um primeiro Acidente Vascular Encefálico até 9 meses de evolução, internados na Santa Casa da Misericórdia de Monção e que cumpriam os critérios de inclusão. O programa foi implementado três horas/dia, durante 10 dias, mantendo a restrição no membro superior menos afetado durante 90% do dia acordado. Como se trata de um estudo de casos múltiplos, analisou-se cada participante individualmente e verificou-se a diferença entre os resultados finais e iniciais para cada uma das variáveis. Os resultados obtidos revelam ganhos na amplitude de movimento, velocidade de execução e capacidade funcional do membro superior mais afetado, nomeadamente nas funções de preensão e pinça da mão, bem como se testemunhou minimização do fenómeno learned nonuse. Verificaram-se ganhos funcionais em todos os participantes nas atividades da vida diária apesar de serem diferentes de participante para participante. Dois participantes afirmaram que voltariam a participar no programa.Conclui-se, assim que a técnica resulta em ganhos funcionais nestes utentes, indicando um caminho alternativo a outras abordagens de reabilitação.