Felipe M Müller

• Dr.
• Professor (Full) at Federal University of Santa Maria

This paper deals with the problem of selecting a set of clients that will receive an offer of one or more products during a promotional campaign. Such campaigns are essential marketing tools to improve the economic profit of an enterprise, either by acquiring new customers or generating additional revenue from existing customers. In this research,...

Este artigo tem como objetivo apresentar a utilização dos algoritmos de redes neurais artificiais na geração de energia solar fotovoltaica como análise de sensibilidade do sistema fotovoltaico frente às variáveis climáticas. Inicialmente o artigo descreve alguns trabalhos relacionados e a relevância dos métodos de redes neurais. Por fim, o trabalho...

The population-based ant colony optimization (P-ACO) algorithm is a variant of the ant colony optimization metaheuristic specifically designed to address dynamic optimization problems. Whenever a change in the environment occurs, P-ACO repairs the pheromone trails affected by the change using previous solutions maintained in a population-list. Typi...

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with Dynamic Optimization Problems (DOPs) properly. Despite the good results obtained by the integrat...

The main objective of nonlinear dynamic system identification is to model the behaviour of the systems under analysis from input-output signals. To approach this problem, the Laguerre-Volterra network architecture combines the connectionist approach with Volterra-based processing to achieve good performances when modeling high-order nonlinearities,...

Among the existing techniques to improve the performance of metaheuristics in optimization problems, adaptive parameter control consists in varying one or more parameters of a given metaheuristic according to some indicator of the search conditions. This approach allows metaheuristics to change algorithmic behaviour during the search, and is partic...

The undergraduate dropout rate is a management concern and can generate many academic studies. In Brazil, the Ministry of Education annually conducts the Census of Higher Education. The different methodologies for calculating and analyzing indicators of school dropout rate are often considered imprecise and inconsistent, weakening their importance...

Ant colony optimization (ACO) algorithms have proved to be suitable for solving dynamic optimization problems (DOPs). The integration of local search operators with ACO has also proved to significantly improve the output of ACO algorithms. However, almost all previous works of ACO in DOPs do not utilize local search operators. In this work, the MAX...

Resumo A evasão no ensino superior representa uma preocupação na gestão e um campo fértil para estudos acadêmicos. No Brasil, o Ministério de Educação realiza anualmente o Censo da Educação Superior. As diferentes metodologias para o cálculo e análises de indicadores da evasão são muitas vezes consideradas imprecisas e inconsistentes, fragilizando...

O objetivo do estudo foi identificar as relações existentes entre a cultura organizacional (CO) e a aprendizagem organizacional (AO) sob a perspectiva dos servidores de uma instituição federal de ensino localizada na Região Sul do Brasil. Com caráter descritivo, o estudo foi conduzido pelo método survey. Os resultados identificaram os fatores comum...

Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical siz...

A necessidade de que os Sistemas de Informações (SI) apresentem disponibilidade e confiabilidade obriga que o software, como componente destes sistemas, também possua estas características. Grande parte dos trabalhos, relacionados ao tema de fatores críticos em projetos de desenvolvimento de software, utilizam a survey research (pesquisa de levanta...

A evasão no ensino superior é um fenômeno complexo e representa uma preocupação na gestão das instituições de ensino superior (IES). No Brasil, inexiste orientação oficial para sistematização da coleta e cálculo da evasão. Este trabalho apresenta uma metodologia que permite a identificação de fatores estratégicos capazes de sustentar um acompanhame...

Automatizar processos, através do uso de software, tornou-se uma prática amplamente utilizada nos mais diversos níveis organizacionais. Neste contexto, o sucesso de projetos de desenvolvimento de software passou a ter um papel fundamental e determinante. A importância da definição dos atributos de sucesso, bem como da determinação e tratamento dos...

Sistematizamos as atividades de ensino-aprendizagem investigativa desenvolvidas na disciplina Didática I da Física (MEN 500) do curso de licenciatura em Física - Diurno da Universidade Federal de Santa Maria (UFSM). Inicialmente localizamos o contexto e os sujeitos envolvidos na prática dialógico-problematizadora realizada no curso de formação esco...

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can sign...

A necessidade de que os Sistemas de Informações (SI), atualmente presentes nas mais diversas organizações, apresentem disponibilidade e confiabilidade obriga que o software, como componente destes sistemas, também possua estas características. Em razão disso, o interesse pelos fatores críticos que possam atuar sobre os resultados de projetos de des...

In this paper are presented a few power based organizations; the conflicts, power and conflict, power excercise and conflict resolution. Bibliographic research was used as this paper methodology, as it enables a rereading about the topic with a new perspective on writings from Bowditch, Foulcault, Galbraith, Mintzberg, Moscovici, Spector, and other...

We consider a mixed integer linear programming model from the literature for the problem of minimizing the makespan on parallel batch processing machines with non-identical job sizes. Symmetric and equivalent solutions in the feasible set of the problem lead to an inefficient application of branchand-bound algorithms. We present valid inequalities...

Ant colony optimization (ACO) algorithms have proved to be able to adapt for solving dynamic optimization problems (DOPs). The integration of local search algorithms has also proved to significantly improve the output of ACO algorithms. However, almost all previous works consider stationary environments. In this paper, the MAX-MIN Ant System, one o...

In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. We consider the objective of minimizing the maximum completion time of the latest job, usually referred to as makespan. We propose a new MIP-based heuristic combining atomic moves such as insertion, ejection and closure, in orde...

Scheduling problems on batch processing machines aiming to minimize makespan are widely exploited in the scientific literature, mainly motivated by reliability testing in the semiconductor industry. We consider the scheduling problem of minimizing the makespan in a single batch machine with release times and non-identical job sizes (1|rj,sj,B|Cmax)...

The improvement in the performance of computers and mathematical programming techniques has led to the development of a new class of algorithms called matheuristics. Associated with an improvement of Mixed Integer Programming (MIP) solvers, these methods have successfully solved plenty of combinatorial optimization problems. This paper presents a m...

This collaborative research in educational technology-mediated network had the thematic concern the management and organization of hypermedia teaching modules (resources and activities of study). It was developed in undergraduate and graduate distance and mediated by the Free Virtual Environment for Teaching and Learning (Moodle) in the Open Univer...

Mundos Virtuais 3D tem sido cada vez mais utilizados no contextoeducacional, buscando aumentar a interacao e engajamento dos estudantes junto asatividades academicas. Neste contexto, este artigo tem como objetivo apresentar ummuseu virtual 3D que apresenta a historia da computacao, desenvolvido atraves doambiente virtual OpenSimulator. Ao propor a...

This paper presents an analysis of the collaboration process in a small groups of students in a tridimensional virtual environment that aimed to solve a problem. The intention was to observe how the collaboration happened, considering a set of metrics developed from the 3C model. As the main contributions, we highlight the design of a set of metric...

Este artigo aborda a questão da construção de algoritmos paralelos e avaliação dos resultados a partir da redução de complexidade obtida pelo emprego massivo do paralelismo, em contraponto a obtenção de speedups como delineadores da construção de algoritmos paralelos. Mostra-se que, em um problema simples de pesquisa em um vetor, é mais proveitosa...

Este trabalho apresenta um panorama do ensino de engenharia de software em cursos de graduação na área de computação com base nos currículos de referência da Sociedade Brasileira de Computação (SBC) e da Association for Computing Machinery(ACM), focando no conteúdo referente ao tópico de teste de software. Com base neste panorama é apresentada uma...

Shisen-Sho or Four Rivers is a game with perfect information where the objective is to remove all tiles from the board. In this work we present two mixed integer programming models for solving Shisen-Sho game, as well as techniques to improve the formulations proposed. The first mathematical model considers the classical problem of finding a sequen...

Jurema was presented as a new branch-and-bound method to find optimal solutions or to prove the optimality of a solution. In this work, we present a discussion about some aspects of the Jurema method. We show that the objective function value of the initial solution used by Jurema to guide the search process is less important than its structure. We...

O avanço tecnológico proporciona uma nova realidade ao processo educacional, a possibilidade de usar ferramentas mais interativas no ensinoaprendizagem. Entre tantas ferramentas, os objetos de aprendizagem podem agir como facilitadores deste processo. Dispõe-se, no ambiente virtual de ensino-aprendizagem – Moodle, de uma ferramenta, o módulo Lição,...

Resumo Apresenta o processo de desenvolvimento de um modelo para sistema de gestão de propriedade intelectual por meio do uso de metodologia de análise contextual de tarefas, a qual visa desenvolver a modelagem sob a visão do usuário. Apresenta um estudo de caso, onde é empregada a abordagem sugestionada para o levantamento de requisitos. Tem como...

Through the wiki Moodle, we developed distance education activities in the Physics Course at UFSM, aiming at producing a hypermedia school subject related to the discipline Physics 2 structuring teaching theme: Heat, Environment and uses of Energy (coming from the PCN+), placing the problematic dialogue in the transversal theme "Environment". We de...

Neste texto, mostramos como o modo de produção colaborativo (bazar) do Movimento Software Livre (MSL) se aproxima da Educação como Prática da Liberdade (EPL), principalmente, quando a produção escolar a distância for mediada pelas Tecnologias da Informação e Comunicação (TIC) livres. A participação nas instâncias produtivas do conhecimento potencia...

RESUMO O presente trabalho é um estudo sobre dois problemas de agrupamento capacitado: o clássico Problema das P-Medianas Capacitado (PPMC) e o Problema de Agrupamento Centrado Capacitado (PACC), recentemente proposto por Negreiros e Palhano (2006). De modo geral, o objetivo é obter agrupamentos de dados definidos com o auxílio de medidas de distân...

The education of heuristics and metaheuristics - algorithms used widely in the resolution of complex problems in the most diverse areas of the knowledge - is dispersed in the Brazilian higher educational structure in disciplines of the graduation and posgraduation. The approach of the learning object LOBO - Learning Object Based on Optimization) pr...

Este trabalho apresenta a metodologia do fluxo de tarefas para o (re)desenvolvimento de um Ambiente Virtual de Ensino Aprendizagem, o AMEM 2.0. A partir dos levantamentos realizadosatravés da análise de tarefa, o novo ambiente se mostrou mais adequado em relação a seu interfaceamento e navegabilidade.

Resumo: O ensino de heurísticas e metaheurísticas na área de pesquisa operacional está centrado, basicamente, na definição de modelos matemáticos e algoritmos para o teste de teorias que são apresentadas em sala de aula. Este modelo tradicional de ensino pressupõe o professor como principal mentor do processo de transferência da teoria matemática p...

This paper presents a distributed software architecture that allows the cooperation among research institutions in the field of Combinatorial Optimization --- DEVOpT: Distributed Evolutionary Optimization Centers. It has as main aims to share existing algorithms for optimization problems, to allow the easy testing of these algorithms with existing...

The aim of this paper is to compare the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times. The goal is to minimize the makespan. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines a populationbased meth...

Este trabalho trata do problema de seqüenciamento de n tarefas independentes em m máquinas paralelas não-relacionadas com o objetivo de minimizar o tempo de execução da máquina mais carregada (makespan). É proposto um novo algoritmo de busca local em conexão com um esquema de vizinhança que usa estrutura de intervalos e o conceito de eficiência das...

The purpose of this work was to activate an IBM PowerPC to run experimentally a free virtual learning environment to the Internet (Multimedia Environment for Computer Based Education in the action-research perspective – AMEM). The problem was to identify and to install a compatible Linux distribution that fits the above mentioned machine and from a...

This paper presents a distributed software architecture that allows the cooperation among research institutions in the field of Operations Research. It has as main aims to share existing algorithms for optimization problems, to allow the easy testing of these algorithms with existing instances, and to share computational power among the cooperating...

This paper studies the imbalanced time minimizing assignment problem (ITMAP) dealing with the allocation of n jobs to m (< n) machines. There are few works about this problem in the literature. In fact, only one lexi-shearch algorithm was found for the ITMAP, but it contain an slight error that was corrected here. Other algorithm by dynamic program...

The cyclic scheduling problem of n jobs on m identical parallel machines that can be represented by P I cyc, sds I Cmax, from a practical view this problem is extremely important to the production of any product that needs machine preparing operations, as they pass from one job to the other, such as: cleaning piece, tool and drawing changing. A heu...

O sequenciamento de tarefas independentes de forma não preemptiva em sistemas de processadores uniformes, com o objetivo de minimizar o tempo total de execução (makespan), é o assunto do presente artigo. Considera-se um conjunto de n tarefas, onde cada tarefa possui um tempo de processamento, e um conjunto m > ou = 2 de processadores com velocidade...

The aim of this paper is to compare the performance of two meta-heuristic methods proposed for solving the identical parallel machine scheduling problem with sequence dependent setup times. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines population-based methods with local search procedures. As...

The problem is to schedule, without preemption, independent jobs on an uniform multiprocessor system. We consider a set of n jobs, each having an execution time and a set of m ≥ 2 processors with speeds σ1 ≤ σ2 ≤ ... ≤ σm. We propose a powerful interchange heuristic composed by three phases: an initial assignment phase, a job reassignment phase and...

This article deals with the problem of scheduling n jobs on m identical parallel processors with the objective of minimizing the total execution time (makespan). A new three-phase heuristic is proposed for solving this problem. An initial phase constructs a starting solution which is improved, in a second phase, by means of a tabu search method. A...

This article proposes algorithms for the Minmax version of the m -Traveling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search schemes are developed. Problems involving up to 50 vertices are solved to optimality.

This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the makespan. The algorithm produces near-optimal solutions in short computation times. It outperforms alternative heuristics on a series of test problems.

: This article is intended to, show the development of a system of export and import data, developed from free software for a virtual environment for teaching and learning. The environment for which the system was developed, it was the environment AMEM, which is a totally free environment, used in the Federal University of Santa Maria Resumo: Este...

The heuristics and metaheristics teaching process is centered in a set of mathematical models definitions and algorithms, which are presented in classrooms. This traditional model of education estimates the professor as a main mentor of the transference process of the mathematical theory to define algorithmical logical steps. The studens must under...

The heuristics and metaheristics teaching process is centered in a set of mathematical models definitions and algorithms, which are presented in classrooms. This traditional model of education estimates the professor as a main mentor of the transference process of the mathematical theory to define algorithmical logical steps. The studens must under...

This paper presents an experience report through the Dialogical- Education based on Problems methodology, using the LOBO learning object. The paper shows the professor lessons and comments, which are defined using the methodology presented. Resumo. Este artigo apresenta uma experiência realizada com a aplicação da prática da educação-dialógica prob...

This paper presents the Action-Researh Methodology through the Heurists and Metaheurists teaching process in high school. The paper presents class examples using the methodology and a brief analysis of this process. Resumo. Este artigo apresenta a Metodologia da Investigação-Ação Educacional, no contexto do Ensino de Heurísticas e Metaheurísticas p...