oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

4 ( 1 )

3 ( 1 )

2019 ( 89 )

2018 ( 141 )

Custom range...

Search Results: 1 - 10 of 72315 matches for " Maria Teresinha Arns Steiner "
All listed articles are free for downloading (OA Articles)
Page 1 /72315
Display every page Item
Proposal for a strategic planning for the replacement of products in stores based on sales forecast
Scarpin, Cassius Tadeu;Steiner, Maria Teresinha Arns;
Pesquisa Operacional , 2011, DOI: 10.1590/S0101-74382011000200008
Abstract: this paper presents a proposal for strategic planning for the replacement of products in stores of a supermarket network. a quantitative method for forecasting time series is used for this, the artificial radial basis neural networks (rbfs), and also a qualitative method to interpret the forecasting results and establish limits for each product stock for each store in the network. the purpose with this strategic planning is to reduce the levels of out-of-stock products (lack of products on the shelves), as well as not to produce overstocking, in addition to increase the level of logistics service to customers. the results were highly satisfactory reducing the distribution center (dc) to shop out-of-stock levels, in average, from 12% to about 0.7% in hypermarkets and from 15% to about 1.7% in supermarkets, thereby generating numerous competitive advantages for the company. the use of rbfs for forecasting proved to be efficient when used in conjunction with the replacement strategy proposed in this work, making effective the operational processes.
Performance analysis of a proposed ant-based clustering algorithm
Maria Teresinha Arns Steiner,Rosangela Villwock
Iberoamericana de Engenharia Industrial , 2011,
Abstract: In the Ant-Based Clustering Algorithm, patterns are spread throughout a grid and each ant is assigned a pattern. The ants are responsible for picking, transporting and dropping patterns on the grid. After the clustering algorithm converges, cluster recovery is done by using the positions of patterns on the grid. The purpose with this study was to evaluate the performance of the Ant-based Clustering Algorithm Proposed (ACAP) compared to the Ant-based Clustering Algorithm – Modified version (ACAM). The major changes were: replacement of the pattern carried by an ant in case it was not dropped within 100 consecutive iterations, comparing the probability of dropping a pattern at a random position with the probability of dropping this pattern at its current position; evaluate the probability of dropping a pattern at a new position, if the pattern is not dropped at a random position, but at a neighboring position. To assess the performance of the algorithm thus proposed, two real examples were used: íRIS and WINE. The results show that the ACAP in this study was better than the ACAM for the two examples.
Optimizing routes for the collection of urban solid waste: a case study for the city of Joinville, state of Santa Catarina
Thober Coradi Detofeno,Maria Teresinha Arns Steiner
Iberoamericana de Engenharia Industrial , 2010,
Abstract: This paper introduces a methodology to obtain optimal routes for the collection of urban waste. The problem is characterized as arcs coverage and for its development a combination of techniques in the Operational Research area was used. Firstly, the Teitz and Bart heuristic was used to obtain p-medians; from the definition of latter were defined groups (clusters) of demand points by designating these to the medians, by means of the Gillett and Johnson algorithm, adapted. Finally, from the definition of the groups of points, the Chinese Postman Algorithm was used, resulting in the routing (sequencing the demand points to be served) in each of the service groups. The results obtained are presented for a case study of the city of Joinville, State of Santa Catarina.
Otimiza??o no servi?o de saúde no estado do Paraná: fluxo de pacientes e novas configura??es hierárquicas
Scarpin, Cassius Tadeu;Steiner, Maria Teresinha Arns;Dias, Gláucio José Cardozo;Steiner Neto, Pedro José;
Gest?o & Produ??o , 2008, DOI: 10.1590/S0104-530X2008000200006
Abstract: neste trabalho é apresentada uma proposta para a otimiza??o no servi?o de saúde no estado do paraná com rela??o ao fluxo de pacientes dentro do estado e a regionaliza??o (divis?o) do estado, obtendo novas configura??es hierárquicas para o mesmo. quanto à regionaliza??o, a proposta consiste em dividir o estado em regi?es menores, formadas por várias cidades, vinculadas a uma cidade sede, principal responsável pelo atendimento no seu nível de resolutividade. com rela??o ao fluxo de pacientes, é proposto um algoritmo que, ao mesmo tempo em que organiza as informa??es, otimiza o fluxo. já para a regionaliza??o, fez-se uso do algoritmo branch and price, que utiliza o algoritmo de gera??o de colunas em cada nó de uma árvore branch and bound. a técnica proposta apresentada para otimizar o fluxo de pacientes mostrou-se eficaz e útil, pois além de fazer o controle dos procedimentos médicos realizados em cada cidade, também define para qual cidade o paciente deve ser encaminhado, respeitando a divis?o hierárquica do estado. já o algoritmo branch and price, utilizado para a otimiza??o na regionaliza??o do estado, é bastante interessante, pois tenta melhorar a referida divis?o hierárquica do estado, levando em considera??o o número de habitantes e o número de procedimentos médicos de cada município do estado. os resultados obtidos têm atendido às expectativas da sesa-pr.
Operations research techniques applied to service center logistics in power distribution users
Maria Teresinha Arns Steiner,Clarice Einhardt da Silva Costa,Deise Maria Berthodi Costa,élsio Andretta Filho
Sistemas & Gest?o , 2006,
Abstract: This paper deals with the optimization for the logistics regarding services demanded byusers of power distribution lines, served by the Port o office, located in Curitiba, PR, Brazil,and operated by COPEL (Paranaense Power Company). Through the use of OperationsResearch techniques, an Integer Programming Mathematical model and Floyd Algorithm, amethod was defined to determine in an optimized way, the number of teams needed by theselected office, as well as, the optimized assignment for the teams to the sites in need, inorder to offer efficient services to the users and, besides that, the immediate execution onemergencies and, as to the other services, accordingly to parameters set by the NationalPower Agency together with COPEL. The methodology hereby presented is generic, so thatit could be applied to any power network (or any of its lines), and it has presented verysatisfactory results to the case in analysis.
Otimiza o na programa o de horários de professores/turmas: Modelo Matemático, Abordagem Heurística e Método Misto
Anderson Roges Teixeira Góes,Deise Maria Bertholdi Costa,Maria Teresinha Arns Steiner
Sistemas & Gest?o , 2010,
Abstract: No início do período letivo, em qualquer institui o de ensino, há sempre a preocupa o com a distribui o de dias e horários de aulas para cada um de seus professores. Apesar de todo o avan o computacional, a maioria das escolas ainda realiza a constru o da grade horária escolar de forma manual, tornando esta tarefa bastante demorada e ineficiente. O objetivo deste trabalho é apresentar três técnicas (modelo matemático, abordagem heurística e método misto) que encontrem uma solu o que satisfa a as exigências pedagógicas e operacionais das institui es, assim
Técnicas da pesquisa operacional aplicadas à logística de atendimento aos usuários de uma rede de distribui o de energia elétrica
Maria Teresinha Arns Steiner,Clarice Einhardt da Silva Costa,Deise Maria Berthodi Costa,élsio Andretta Filho
Sistemas & Gest?o , 2009,
Abstract: O presente trabalho trata da otimiza o da logística de atendimento aos usuários de uma rede de distribui o de energia elétrica, aplicada à agência do Port o, localizada em Curitiba, PR, Brasil, de responsabilidade da Companhia Paranaense de Energia Elétrica (COPEL). Através de técnicas da área de Pesquisa Operacional, um modelo Matemático de Programa o Inteira e o algoritmo de Floyd, definiu-se uma metodologia que permite determinar de forma otimizada o dimensionamento de equipes de atendimento para a referida agência e o despacho otimizado das mesmas aos locais das ocorrências, visando um atendimento satisfatório aos usuários, e, além disso, a execu o dos servi os emergenciais, de imediato, e dos comerciais, de acordo com as metas estipuladas pela Agência Nacional de Energia Elétrica (ANEEL) juntamente com a COPEL. A metodologia aqui apresentada é genérica, podendo ser aplicada a qualquer rede (ou parte dela) de distribui o elétrica, sendo que a mesma apresentou resultados bastante satisfatórios para o caso aqui abordado.
Ant Colony Optimisation for Backward Production Scheduling
Leandro Pereira dos Santos,Guilherme Ernani Vieira,Higor Vinicius dos R. Leite,Maria Teresinha Arns Steiner
Advances in Artificial Intelligence , 2012, DOI: 10.1155/2012/312132
Abstract: The main objective of a production scheduling system is to assign tasks (orders or jobs) to resources and sequence them as efficiently and economically (optimised) as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO) in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster. 1. Production Scheduling Still a Differential for Competitiveness The globalised world economic scenario makes entrepreneurial competitiveness unavoidable and being competitive has become an indispensable prerequisite to organisations that strive for success. Within this context, manufacturing activities become especially important for they decisively influence performance, directly affecting (and being affected by) forecast, planning, and scheduling decisions. Shop-floor production scheduling, which within the hierarchical production planning covers disaggregate and detailed decisions in short time frame, consists in allocating activities (production orders or jobs) to resources, by obeying sequencing and setup restrictions, with focus on getting the best possible results from limited available resources, and, at the same time, aiming at reducing production costs and meeting service levels as fast and efficiently as possible. To make all this happen in cases where production and financial resources are limited and restrictions are many, adequate algorithms techniques and intelligence are necessary. Almost four decades ago, Garey et al. [1] classified production scheduling problems as being NP-hard, which in practical ways means that it is very difficult for one to obtain an optimal solution through exact algorithms and also demand unacceptable execution (computer or effort) time. The
Uma proposta de solu??o para o problema da constru??o de escalas de motoristas e cobradores de ?nibus por meio do algoritmo do matching de peso máximo
Siqueira, Paulo Henrique;Carnieri, Celso;Steiner, Maria Teresinha Arns;Barboza, ?ngela Olandoski;
Gest?o & Produ??o , 2004, DOI: 10.1590/S0104-530X2004000200005
Abstract: the purpose of this paper is to discuss how the maximum weight matching algorithm can be applied to schedule the workdays of bus drivers and bus fare collectors. this scheduling should be based on the best possible use of timetables in order to minimize the number of employees, overtime and idle hours, thereby minimizing the operational costs of public transportation companies. in the first phase of this study, assuming that the timetables are already divided into long and short duration schedules, the short schedules can be combined to make up an employee's workday. this combination is done by the maximum weight matching algorithm, in which the scales are represented by vertices on a graph and the maximum weight is attributed to combinations of scales that do not lead to overtime or idle hours. in the second phase, a weekend schedule is assigned for every weekly work schedule. based on these two phases, the weekly work schedules of bus drivers and bus fare collectors can be arranged at a minimal cost. the third and final phase of this study consisted of assigning a weekly work schedule to each bus driver and collector, considering his/her preferences. the maximum weight matching algorithm was also used in this phase. this method was applied in three public transportation companies in curitiba, state of paraná, which had until then used old heuristic algorithms based solely on managerial experience.
Métodos estatísticos multivariados aplicados à engenharia de avalia??es
Steiner, Maria Teresinha Arns;Chaves Neto, Anselmo;Braulio, Sílvia Neide;Alves, Valdir;
Gest?o & Produ??o , 2008, DOI: 10.1590/S0104-530X2008000100004
Abstract: the purpose of this paper is to present a methodology composed by multivariate statistical analysis techniques in order to build a statistical multiple linear regression model to evaluate some estates according to their characteristics (variables, attributes). first, a clustering analysis was applied to the data of each urban estate class (apartments, houses or lots) to categorize similar groups and, correspondingly, the discriminant was defined in order to assign future items to these groups, by means of the quadratic score discriminant method. next, the principal components analysis (p.c.a.) was applied to solve the multicolinearity problem that may exist among the variables in the model. the scores of the principal components become then the new independent variables and with them a multiple linear regression model was adjusted to each group of similar estate within each class. this methodology was applied to a set of 119 estates including 44 apartments, 51 houses and 24 lots in the city of campo mour?o, pr. the model for each similar group in each class of the evaluated estates presented an adequate adjustment to the data and a satisfactory predictive capacity.
Page 1 /72315
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.