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.

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.

Feedback regarding students initial pharmaceutical internship from the University of Medicine and Pharmacy, Cluj-Napoca

Introduction/Aims: The purpose of the study is to evaluate the perception of the organization, the development and the evaluation of the initial stage in the internship of students, in order to improve these activities and to establish the adequate objectives in accordance with the changes concerning the concept of modern pharmacy. Materials and methods: An online survey was made using Google Docs ® -Create Form extension. All results were accumulated and computed using Microsoft Excel ®. The questionnaire consisted of 11 questions, structured on several levels: the objectives and how they can be achieved, internship organization, the internship training (effective participation in specific activities and integration in the pharmaceutical activity), the assessment, the profile of tutor / pharmacy. The questionnaire was completed by students from the Faculty of Pharmacy, University of Medicine and Pharmacy "Iuliu Haţieganu" Cluj Napoca, Romania. Results and discussions. The study was conducted on 308 students (60% of all students from the study years II-IV. 90% of the respondents had actually participated in the internship, whilst 10% only formally participated in this activity. The main responsibilities of the students were: storage and reception of pharmaceutical products (94%, respectively 79%) and working with the receipts (57%). Most of the students appreciate that they were integrated into the work in the pharmacy, this being due largely pharmacist tutor, who expressed interest and ability in mentoring activities. They appreciated that the role of tutor requires 3-5 years of professional experience. In terms of the internship objectives, these should aim at applying the knowledge gained until the graduation year, but also familiarization with activities which might turn into applications for the coming years. 43% of students believe that only 25% of the theoretical knowledge was useful during the internship. 90 % of the total questioned considered useful to develop a practice guideline adapted to the year of study. Conclusions. The professional training of the future pharmacist’s students depends largely on experience gained by students during the internship activity. Feed-back from the students’ shows that they are aware of the usefulness of the internship, but believe the objectives must be updated and a better correlation between work in pharmacy and theoretical knowledge has to be made. A first step is to develop a practical guide adapted to each year of study. The involvement of the tutor pharmacist is also essential to the success of this activity

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.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Creating shared value – a nova abordagem estratégica de Responsabilidade social empresarial

Dissertação de Mestrado apresentada ao Instituto Supeior de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Marketing Digital, sob a orientação da Doutora Sandrina Francisca Teixeira

Group decision making and Quality-of-information in e-Health systems

Knowledge is central to the modern economy and society. Indeed, the knowledge society has transformed the concept of knowledge and is more and more aware of the need to overcome the lack of knowledge when has to make options or address its problems and dilemmas. One’s knowledge is less based on exact facts and more on hypotheses, perceptions or indications. Even when we use new computational artefacts and novel methodologies for problem solving, like the use of Group Decision Support Systems (GDSSs), the question of incomplete information is in most of the situations marginalized. On the other hand, common sense tells us that when a decision is made it is impossible to have a perception of all the information involved and the nature of its intrinsic quality. Therefore, something has to be made in terms of the information available and the process of its evaluation. It is under this framework that a Multi-valued Extended Logic Programming language will be used for knowledge representation and reasoning, leading to a model that embodies the Quality-of-Information (QoI) and its quantification, along the several stages of the decision-making process. In this way, it is possible to provide a measure of the value of the QoI that supports the decision itself. This model will be here presented in the context of a GDSS for VirtualECare, a system aimed at sustaining online healthcare services.

Empreendedorismo Social, o papel das IPSS: estudo de caso

O empreendedorismo social tem vindo, nas últimas décadas, a ser denominado como um novo paradigma determinante para o funcionamento da economia, em grande parte, porque a economia social tornou-se basilar na sociedade, por um lado, pelo crescimento exponencial da exclusão social, elevado desemprego e envelhecimento da população e, por outro, devido às dificuldades orçamentais dos governos. O empreendedorismo social, utilizado por Instituições Particulares de Solidariedade Social sem fins lucrativos, procura resolver problemas sociais de forma inovadora e sustentável, com a finalidade de dar resposta aos grandes desafios sociais da atualidade, através da ação social na prevenção e no apoio nas diversas situações de fragilidade, exclusão ou carência humana, promovendo a inclusão, a integração social e o desenvolvimento local. O objetivo fundamental do presente trabalho, pretende verificar até que ponto as IPSS podem ser definidas como empreendedores sociais, através da prestação de serviços, nas variadas áreas à população local, de forma a alcançar o valor social. Neste estudo enveredou-se pela metodologia qualitativa, utilizando o método do estudo de caso único, recorrendo ao questionário como instrumento de recolha de dados numa instituição particular de solidariedade social do concelho da Maia. Deste estudo foi possível concluir a IPSS tem uma proximidade às populações, através das diversas valências vocacionadas para a resolução de problemas sociais emergentes, promovendo a inclusão a integração social, e alcançar o valor social. Assim, consideramos a IPSS estudada como sendo parte integrante e promotora do empreendedorismo social.

Produção de biodiesel via catálise heterogénea básica

Mestrado em Engenharia Química. Ramo Tecnologias de Protecção Ambiental.