Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Francisco Chagas de Lima"'
Publikováno v:
Anais do XLIX Seminário Integrado de Software e Hardware (SEMISH 2022).
O problema de horário de curso baseado em currículo é um problema clássico de otimização combinatória. Diversas pesquisas foram realizadas nas últimas décadas com o propósito de investigar o desempenho de uma variedade de metodologias. O ob
Autor:
Francisco Chagas de Lima Júnior, Rommel Wladimir de Lima, Emerson Inácio Cenzi, Francisco Sales Angelo de Araújo
Publikováno v:
Anais do 60º Congresso da Sociedade Brasileira de Economia, Administração e Sociologia Rural (SOBER).
ENTRAVES E DESAFIOS DA IMPLEMENTAÇÃO DO SERVIÇO DE INSPEÇÃO MUNICIPAL – SIM NO MUNICÍPIO DE CAICÓ/RN
Publikováno v:
Anais do 60º Congresso da Sociedade Brasileira de Economia, Administração e Sociologia Rural (SOBER).
Autor:
Dario José Aloise, Shahin Gelareh, Kassem Danach, Rahimeh Neamatian Monemi, Wissam Khalil, Francisco Chagas de Lima
Publikováno v:
Expert Systems with Applications. 42:4493-4505
A novel mathematical model for the workover rig scheduling.Identifying several classes of valid inequalities.Developed a very efficient hyper-heuristic method.Developed a branch, price and cut algorithm for the problem.Work is based on a case study o
Publikováno v:
Traveling Salesman Problem, Theory and Applications
Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don’t guarantee the det
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccb480626a5eae53afc180c3263197cb
https://doi.org/10.5772/13343
https://doi.org/10.5772/13343
Autor:
Jorge Dantas de Melo, Rafael Marrocos Magalhães, Adrião Duarte Dória Neto, Francisco Chagas de Lima Júnior, João Paulo Queiroz dos Santos
Publikováno v:
Computational Intelligence in Expensive Optimization Problems ISBN: 9783642107009
Many problems formerly considered intractable have been satisfactorily resolved using approximate optimization methods called metaheuristics. These methods use a non-deterministic approach that finds good solutions, despite not ensuring the determina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1012a3c205be85d314a551128208a7cc
https://doi.org/10.1007/978-3-642-10701-6_14
https://doi.org/10.1007/978-3-642-10701-6_14
Autor:
Jorge Dantas de Melo, Adrião Duarte Dória Neto, João Paulo Queiroz dos Santos, Rafael Marrocos Magalhães, Francisco Chagas de Lima
Publikováno v:
IJCNN
In the process of searching for better solutions, a metaheuristic can be guided to regions of promising solutions using the acquisition of information on the problem under study. In this work this is done through the use of reinforcement learning. Th