Edson L F Senne | Universidade Estadual Paulista "Júlio de Mesquita Filho" (original) (raw)
Papers by Edson L F Senne
Anais do XLI Simpósio Brasileiro de Telecomunicações e Processamento de Sinais
Resumo-Dos 5570 municípios brasileiros, ainda há 1309 municípios sem conexão à Internet por fibra... more Resumo-Dos 5570 municípios brasileiros, ainda há 1309 municípios sem conexão à Internet por fibra óptica, o que levanta a seguinte questão: qual a melhor forma de investir nessa cobertura para os municípios? Este estudo buscou, através do cálculo da Árvore Geradora Mínima com algoritmos exato e heurístico, trazer alguma luz à questão. Foi realizado o cálculo do custo mínimo para a cobertura, com pelo menos um enlace, entre todos os municípios brasileiros, bem como em cenários menores, como cada estado do Brasil. Por fim, foi realizada uma comparação da precisão e eficiência entre os diferentes algoritmos escolhidos e apresentados os resultados.
This paper describes an integrated environment in which a student can acquire and test knowledge ... more This paper describes an integrated environment in which a student can acquire and test knowledge about Operations Research techniques. In this environment all the interactions with the users are performed by means of an appropriated graphical interface related to the problem and the algorithm chosen to solve it During a step-by-step problem solving session, the user makes the decisions and lets the system process the necessary computations. Moreover, this environment is able: (i) to check the correctness of the user's replies, (ii) to display warnings every time a wrong decision is taken, and (iii) to return to any previous step in order to give more flexibility to the teacher's exposition. The system is designed to include: Primal Simplex, Dual Simplex, Revised Simplex, Stepping-Stone Method for Transportation Problems, Hungarian Method for Assignment Problems, and Sensitivity Analysis.
International Conference on Computers and Industrial Engineering, 2015
School of Engineering at Guaratingueta (FEG) Univ. Estadual Paulista (UNESP), Av. Dr. Ariberto Pe... more School of Engineering at Guaratingueta (FEG) Univ. Estadual Paulista (UNESP), Av. Dr. Ariberto Pereira da Cunha, 333
This work presents the development of a Web based system for Academic Assessment and Follow-up wh... more This work presents the development of a Web based system for Academic Assessment and Follow-up which is being developed for allowing educational institutions to manage both the application of evaluation processes of the teaching activities and the pedagogic follow-up of their courses. This system will make it possible to collect the students' opinion about the disciplines, teachers and other subjects related to teaching. This system will also make possible to publish to the Internet the data related to the lessons plans, grades and class attendance of the offered disciplines. These characteristics are created to help Course Councils in developing evaluation processes and planning activities in order to assure the quality of teaching. The system is being developed to be distributed under a GPL license.
Journal of optimization, 2017
Usually, metaheuristic algorithms are adapted to a large set of problems by applying few modifica... more Usually, metaheuristic algorithms are adapted to a large set of problems by applying few modifications on parameters for each specific case. However, this flexibility demands a huge effort to correctly tune such parameters. Therefore, the tuning of metaheuristics arises as one of the most important challenges in the context of research of these algorithms. Thus, this paper aims to present a methodology combining Statistical and Artificial Intelligence methods in the fine-tuning of metaheuristics. The key idea is a heuristic method, called Heuristic Oriented Racing Algorithm (HORA), which explores a search space of parameters looking for candidate configurations close to a promising alternative. To confirm the validity of this approach, we present a case study for finetuning two distinct metaheuristics: Simulated Annealing (SA) and Genetic Algorithm (GA), in order to solve the classical traveling salesman problem. The results are compared considering the same metaheuristics tuned through a racing method. Broadly, the proposed approach proved to be effective in terms of the overall time of the tuning process. Our results reveal that metaheuristics tuned by means of HORA achieve, with much less computational effort, similar results compared to the case when they are tuned by the other fine-tuning approach.
arXiv (Cornell University), Apr 26, 2023
− The increasing use of drones to perform various tasks has motivated an exponential growth of re... more − The increasing use of drones to perform various tasks has motivated an exponential growth of research aimed at optimizing the use of these means, benefiting both military and civilian applications, including logistics delivery. In this sense, the combined use of trucks and drones has been explored with great interest by Operations Research. This work presents mathematical formulations in Mixed Integer Linear Programming and proposes a hybrid Genetic Algorithm (HGenFS) for optimizing a variation of the Traveling Salesman Problem (TSP) called Flying Sidekick TSP (FSTSP), in which truck and drone cooperate. The results obtained confirmed that the adopted formulation for the exact solution is suitable for solving problems up to ten customers, and the HGenFS proved to be capable of finding optimal solutions for the FSTSP in a few seconds by incorporating specific heuristics and a local search phase.
HAL (Le Centre pour la Communication Scientifique Directe), 2009
No cenario dos sistemas Web, em particular, dos sistemas de administracao de ensino, a crescente ... more No cenario dos sistemas Web, em particular, dos sistemas de administracao de ensino, a crescente utilizacao de dispositivos moveis e das tecnologias de comunicacao sem fio proporcionou surgimento de novos servicos chamados sensiveis ao contexto. Entretanto, o desenvolvimento de tais servicos impoe desafios principalmente em decorrencia da heterogeneidade dos dispositivos moveis, da gestao das informacoes de contexto e da complexidade de implementacao dos mecanismos de adaptacao. Com o objetivo de auxiliar o desenvolvimento destes servicos, este artigo propoe uma arquitetura sensivel ao contexto e orientada a componente chamada CAUS.
International journal of engineering mathematics, Sep 16, 2015
The setup of heuristics and metaheuristics, that is, the fine-tuning of their parameters, exercis... more The setup of heuristics and metaheuristics, that is, the fine-tuning of their parameters, exercises a great influence in both the solution process, and in the quality of results of optimization problems. The search for the best fit of these algorithms is an important task and a major research challenge in the field of metaheuristics. The fine-tuning process requires a robust statistical approach, in order to aid in the process understanding and also in the effective settings, as well as an efficient algorithm which can summarize the search process. This paper aims to present an approach combining design of experiments (DOE) techniques and racing algorithms to improve the performance of different algorithms to solve classical optimization problems. The results comparison considering the default metaheuristics and ones using the settings suggested by the fine-tuning procedure will be presented. Broadly, the statistical results suggest that the fine-tuning process improves the quality of solutions for different instances of the studied problems. Therefore, by means of this study it can be concluded that the use of DOE techniques combined with racing algorithms may be a promising and powerful tool to assist in the investigation, and in the fine-tuning of different algorithms. However, additional studies must be conducted to verify the effectiveness of the proposed methodology.
Gestão & produção, Jun 20, 2016
This paper presents a study on non-parametric tests to verify the similarity between two small sa... more This paper presents a study on non-parametric tests to verify the similarity between two small samples of variables classified into multiple categories. The study shows that the only tests available for this situation are the chi-square and the exact tests. However, asymptotic tests, such as the chi-square, may not work well for small samples, leaving exact tests as the alternative. Nevertheless, if the number of classes increases, the implementation of these tests can become very difficult, in addition to requiring specific algorithms that may demand considerable computational effort. Therefore, as an alternative to the exact tests, a new test based on the difference between two uniform distributions is proposed. Computational assays are conducted to evaluate the performance of these three tests. Although non-parametric tests present numerous applications in various areas of knowledge, this study was motivated by the need to verify whether the business strategy adopted by a company is a determining factor for its competitiveness.
Journal of Intelligent Systems, 1996
The increase of computing power of the microcomputers has stimulated the building of direct manip... more The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.
The Maximal Covering Location Problem (MCLP) deals with the location of facilities in order to at... more The Maximal Covering Location Problem (MCLP) deals with the location of facilities in order to attend the largest subset of a population within a service distance. Many successful heuristic approaches have been developed to solve this problem. In this work we use the Unified Linear Model developed by Hillsman to adapt the distance coefficients of a p-median problem to reflect the demand information of a population. This transformation permits the application of a Lagrangean/surrogate heuristic developed for solving p-median problems to solve the MCLP. In previous works this heuristic proved to be very affordable, providing good quality solutions in reduced computational times. Computational tests for random generated scenarios ranging from 100 to 900 vertices and GIS- referenced instances of São José dos Campos city (Brazil) were conducted, showing the effectiveness
Este trabalho descreve uma nova heurística para a resolução de problemas de atribuição de escalas... more Este trabalho descreve uma nova heurística para a resolução de problemas de atribuição de escalas de serviço de longa duração para empresas de transporte. Problemas desta natureza são classificados como NP-Hard devido ao seu grau de complexidade. A abordagem procura reduzir a complexidade elaborando modelos mais simples que são resolvidos em etapas seqüenciais e com realimentação até que um critério de otimização seja atingido.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017
Gestão & Produção, 2009
No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um... more No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se um algoritmo para resolver este problema baseado em um ordenamento parcial das tarefas. Uma sequência ótima é obtida expandindo-se as sequências parciais enumeradas. Testes computacionais são apresentados.
Gestão & Produção, 2007
Neste trabalho, apresenta-se um estudo sobre os principais métodos para identificar os caminhos d... more Neste trabalho, apresenta-se um estudo sobre os principais métodos para identificar os caminhos de maior duração em redes PERT, denominados na literatura de caminhos k-críticos (quando k = 1, tem-se o caminho mais longo, conhecido tradicionalmente por caminho crítico; quando k = 2, tem-se o segundo caminho mais longo, e assim sucessivamente). São discutidos três algoritmos apresentados na literatura e propõe-se um novo procedimento, denominado algoritmo da folga mínima, que apresenta algumas vantagens sobre os anteriores. O comportamento do algoritmo da folga mínima, quando aplicado a redes PERT, é verificado por meio de simulação.
European Journal of Operational Research, 1997
... Fax: 1895-203-303. This research work was performed while Dr. Matins and Dr. Senne were visit... more ... Fax: 1895-203-303. This research work was performed while Dr. Matins and Dr. Senne were visiting the Department of Mathematics and Statistics at Brunet University, Uxbridge - Middlesex, England, UK. ... Ho 184 FAS Marins et al. ...
Anais do XLI Simpósio Brasileiro de Telecomunicações e Processamento de Sinais
Resumo-Dos 5570 municípios brasileiros, ainda há 1309 municípios sem conexão à Internet por fibra... more Resumo-Dos 5570 municípios brasileiros, ainda há 1309 municípios sem conexão à Internet por fibra óptica, o que levanta a seguinte questão: qual a melhor forma de investir nessa cobertura para os municípios? Este estudo buscou, através do cálculo da Árvore Geradora Mínima com algoritmos exato e heurístico, trazer alguma luz à questão. Foi realizado o cálculo do custo mínimo para a cobertura, com pelo menos um enlace, entre todos os municípios brasileiros, bem como em cenários menores, como cada estado do Brasil. Por fim, foi realizada uma comparação da precisão e eficiência entre os diferentes algoritmos escolhidos e apresentados os resultados.
This paper describes an integrated environment in which a student can acquire and test knowledge ... more This paper describes an integrated environment in which a student can acquire and test knowledge about Operations Research techniques. In this environment all the interactions with the users are performed by means of an appropriated graphical interface related to the problem and the algorithm chosen to solve it During a step-by-step problem solving session, the user makes the decisions and lets the system process the necessary computations. Moreover, this environment is able: (i) to check the correctness of the user's replies, (ii) to display warnings every time a wrong decision is taken, and (iii) to return to any previous step in order to give more flexibility to the teacher's exposition. The system is designed to include: Primal Simplex, Dual Simplex, Revised Simplex, Stepping-Stone Method for Transportation Problems, Hungarian Method for Assignment Problems, and Sensitivity Analysis.
International Conference on Computers and Industrial Engineering, 2015
School of Engineering at Guaratingueta (FEG) Univ. Estadual Paulista (UNESP), Av. Dr. Ariberto Pe... more School of Engineering at Guaratingueta (FEG) Univ. Estadual Paulista (UNESP), Av. Dr. Ariberto Pereira da Cunha, 333
This work presents the development of a Web based system for Academic Assessment and Follow-up wh... more This work presents the development of a Web based system for Academic Assessment and Follow-up which is being developed for allowing educational institutions to manage both the application of evaluation processes of the teaching activities and the pedagogic follow-up of their courses. This system will make it possible to collect the students' opinion about the disciplines, teachers and other subjects related to teaching. This system will also make possible to publish to the Internet the data related to the lessons plans, grades and class attendance of the offered disciplines. These characteristics are created to help Course Councils in developing evaluation processes and planning activities in order to assure the quality of teaching. The system is being developed to be distributed under a GPL license.
Journal of optimization, 2017
Usually, metaheuristic algorithms are adapted to a large set of problems by applying few modifica... more Usually, metaheuristic algorithms are adapted to a large set of problems by applying few modifications on parameters for each specific case. However, this flexibility demands a huge effort to correctly tune such parameters. Therefore, the tuning of metaheuristics arises as one of the most important challenges in the context of research of these algorithms. Thus, this paper aims to present a methodology combining Statistical and Artificial Intelligence methods in the fine-tuning of metaheuristics. The key idea is a heuristic method, called Heuristic Oriented Racing Algorithm (HORA), which explores a search space of parameters looking for candidate configurations close to a promising alternative. To confirm the validity of this approach, we present a case study for finetuning two distinct metaheuristics: Simulated Annealing (SA) and Genetic Algorithm (GA), in order to solve the classical traveling salesman problem. The results are compared considering the same metaheuristics tuned through a racing method. Broadly, the proposed approach proved to be effective in terms of the overall time of the tuning process. Our results reveal that metaheuristics tuned by means of HORA achieve, with much less computational effort, similar results compared to the case when they are tuned by the other fine-tuning approach.
arXiv (Cornell University), Apr 26, 2023
− The increasing use of drones to perform various tasks has motivated an exponential growth of re... more − The increasing use of drones to perform various tasks has motivated an exponential growth of research aimed at optimizing the use of these means, benefiting both military and civilian applications, including logistics delivery. In this sense, the combined use of trucks and drones has been explored with great interest by Operations Research. This work presents mathematical formulations in Mixed Integer Linear Programming and proposes a hybrid Genetic Algorithm (HGenFS) for optimizing a variation of the Traveling Salesman Problem (TSP) called Flying Sidekick TSP (FSTSP), in which truck and drone cooperate. The results obtained confirmed that the adopted formulation for the exact solution is suitable for solving problems up to ten customers, and the HGenFS proved to be capable of finding optimal solutions for the FSTSP in a few seconds by incorporating specific heuristics and a local search phase.
HAL (Le Centre pour la Communication Scientifique Directe), 2009
No cenario dos sistemas Web, em particular, dos sistemas de administracao de ensino, a crescente ... more No cenario dos sistemas Web, em particular, dos sistemas de administracao de ensino, a crescente utilizacao de dispositivos moveis e das tecnologias de comunicacao sem fio proporcionou surgimento de novos servicos chamados sensiveis ao contexto. Entretanto, o desenvolvimento de tais servicos impoe desafios principalmente em decorrencia da heterogeneidade dos dispositivos moveis, da gestao das informacoes de contexto e da complexidade de implementacao dos mecanismos de adaptacao. Com o objetivo de auxiliar o desenvolvimento destes servicos, este artigo propoe uma arquitetura sensivel ao contexto e orientada a componente chamada CAUS.
International journal of engineering mathematics, Sep 16, 2015
The setup of heuristics and metaheuristics, that is, the fine-tuning of their parameters, exercis... more The setup of heuristics and metaheuristics, that is, the fine-tuning of their parameters, exercises a great influence in both the solution process, and in the quality of results of optimization problems. The search for the best fit of these algorithms is an important task and a major research challenge in the field of metaheuristics. The fine-tuning process requires a robust statistical approach, in order to aid in the process understanding and also in the effective settings, as well as an efficient algorithm which can summarize the search process. This paper aims to present an approach combining design of experiments (DOE) techniques and racing algorithms to improve the performance of different algorithms to solve classical optimization problems. The results comparison considering the default metaheuristics and ones using the settings suggested by the fine-tuning procedure will be presented. Broadly, the statistical results suggest that the fine-tuning process improves the quality of solutions for different instances of the studied problems. Therefore, by means of this study it can be concluded that the use of DOE techniques combined with racing algorithms may be a promising and powerful tool to assist in the investigation, and in the fine-tuning of different algorithms. However, additional studies must be conducted to verify the effectiveness of the proposed methodology.
Gestão & produção, Jun 20, 2016
This paper presents a study on non-parametric tests to verify the similarity between two small sa... more This paper presents a study on non-parametric tests to verify the similarity between two small samples of variables classified into multiple categories. The study shows that the only tests available for this situation are the chi-square and the exact tests. However, asymptotic tests, such as the chi-square, may not work well for small samples, leaving exact tests as the alternative. Nevertheless, if the number of classes increases, the implementation of these tests can become very difficult, in addition to requiring specific algorithms that may demand considerable computational effort. Therefore, as an alternative to the exact tests, a new test based on the difference between two uniform distributions is proposed. Computational assays are conducted to evaluate the performance of these three tests. Although non-parametric tests present numerous applications in various areas of knowledge, this study was motivated by the need to verify whether the business strategy adopted by a company is a determining factor for its competitiveness.
Journal of Intelligent Systems, 1996
The increase of computing power of the microcomputers has stimulated the building of direct manip... more The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.
The Maximal Covering Location Problem (MCLP) deals with the location of facilities in order to at... more The Maximal Covering Location Problem (MCLP) deals with the location of facilities in order to attend the largest subset of a population within a service distance. Many successful heuristic approaches have been developed to solve this problem. In this work we use the Unified Linear Model developed by Hillsman to adapt the distance coefficients of a p-median problem to reflect the demand information of a population. This transformation permits the application of a Lagrangean/surrogate heuristic developed for solving p-median problems to solve the MCLP. In previous works this heuristic proved to be very affordable, providing good quality solutions in reduced computational times. Computational tests for random generated scenarios ranging from 100 to 900 vertices and GIS- referenced instances of São José dos Campos city (Brazil) were conducted, showing the effectiveness
Este trabalho descreve uma nova heurística para a resolução de problemas de atribuição de escalas... more Este trabalho descreve uma nova heurística para a resolução de problemas de atribuição de escalas de serviço de longa duração para empresas de transporte. Problemas desta natureza são classificados como NP-Hard devido ao seu grau de complexidade. A abordagem procura reduzir a complexidade elaborando modelos mais simples que são resolvidos em etapas seqüenciais e com realimentação até que um critério de otimização seja atingido.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017
Gestão & Produção, 2009
No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um... more No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se um algoritmo para resolver este problema baseado em um ordenamento parcial das tarefas. Uma sequência ótima é obtida expandindo-se as sequências parciais enumeradas. Testes computacionais são apresentados.
Gestão & Produção, 2007
Neste trabalho, apresenta-se um estudo sobre os principais métodos para identificar os caminhos d... more Neste trabalho, apresenta-se um estudo sobre os principais métodos para identificar os caminhos de maior duração em redes PERT, denominados na literatura de caminhos k-críticos (quando k = 1, tem-se o caminho mais longo, conhecido tradicionalmente por caminho crítico; quando k = 2, tem-se o segundo caminho mais longo, e assim sucessivamente). São discutidos três algoritmos apresentados na literatura e propõe-se um novo procedimento, denominado algoritmo da folga mínima, que apresenta algumas vantagens sobre os anteriores. O comportamento do algoritmo da folga mínima, quando aplicado a redes PERT, é verificado por meio de simulação.
European Journal of Operational Research, 1997
... Fax: 1895-203-303. This research work was performed while Dr. Matins and Dr. Senne were visit... more ... Fax: 1895-203-303. This research work was performed while Dr. Matins and Dr. Senne were visiting the Department of Mathematics and Statistics at Brunet University, Uxbridge - Middlesex, England, UK. ... Ho 184 FAS Marins et al. ...