Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Elizabeth Ferreira Gouvea Goldbarg"'
Publikováno v:
Brazilian Journal of Development. 7:20493-20514
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e9cc33a016ce594217b9da07fc78b66
https://doi.org/10.34117/bjdv7n2-612
https://doi.org/10.34117/bjdv7n2-612
Autor:
Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg, Igor Rosberg de Medeiros Silva
Publikováno v:
Repositório Institucional da UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
Hybridisation is a technique that exploits and unites the best features of individual algorithms. The literature includes several hybridisation methodologies, among which there are general procedures, termed architectures, that provide generic functi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2ecbb5d0b523ffe288b34ccd48aa027
https://doi.org/10.1007/s12293-020-00307-4
https://doi.org/10.1007/s12293-020-00307-4
Autor:
Elizabeth Ferreira Gouvea Goldbarg, Matheus da Silva Menezes, Zailton Sachas Amorim Calheiros, Gustavo de Araujo Sabry, Marco César Goldbarg
Publikováno v:
Optimization Letters. 15:59-81
In this study, we introduce the Traveling Car Renter with Passengers (CaRSP), an extension of the Traveling Car Renter Problem (CaRS). The latter generalizes the Traveling Salesman Problem (TSP) by allowing several cars with different costs to be ava
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8dbf1a8b9afd5403b220cc88c61924f
https://doi.org/10.1007/s11590-020-01585-0
https://doi.org/10.1007/s11590-020-01585-0
Autor:
Marcos Cesar Gouvea Goldbarg, Murilo Oliveira Machado, Thiago Soares Marques, Elizabeth Ferreira Gouvea Goldbarg
Publikováno v:
Brazilian Journal of Development. 6:36730-36754
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c73930dc147468025edb9523a4aee57a
https://doi.org/10.34117/bjdv6n6-275
https://doi.org/10.34117/bjdv6n6-275
Publikováno v:
Brazilian Journal of Development. 6:27746-27760
O presente trabalho apresenta o Problema do Caixeiro Viajante com Multiplos Passageiros e Quota, variante do Problema do Caixeiro Viajante com Quota. O problema consiste em minimizar os custos de um caixeiro viajante que deve coletar uma cota minima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2ea9852376bd1ab16d322180f20bf76
https://doi.org/10.34117/bjdv6n5-283
https://doi.org/10.34117/bjdv6n5-283
Autor:
Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg, Sílvia M. D. M. Maia, Islame F. C. Fernandes
Publikováno v:
Computational Optimization and Applications. 75:561-605
The multi-objective spanning tree (MoST) is an extension of the minimum spanning tree problem (MST) that, as well as its single-objective counterpart, arises in several practical applications. However, unlike the MST, for which there are polynomial-t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ae8f3e7bdf9614a2e4e573a3104a6ce
https://doi.org/10.1007/s10589-019-00154-1
https://doi.org/10.1007/s10589-019-00154-1
Autor:
Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg
Publikováno v:
LAGOS
The Bi-objective Spanning Tree (BiST) is an NP-hard extension of the Minimum Spanning Tree (MST) problem. The BiST models situations in which two conflicting objectives need to be optimized simultaneously. The BiST has been studied in the literature
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5fe2461044ff32d94060091b0ff1e19
https://doi.org/10.1016/j.entcs.2019.08.040
https://doi.org/10.1016/j.entcs.2019.08.040
Publikováno v:
Brazilian Journal of Development. 5:30055-30076
Este trabalho propoe a versao assimetrica do Problema de Roteamento de Veiculo Suficientemente Proximo, utilizado para planejamento de rotas de reconhecimento aereo. O problema foi formulado com um modelo de programacao conica de segunda ordem e para
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6625913f435366cfa9aee43e5f10ed3
https://doi.org/10.34117/bjdv5n12-140
https://doi.org/10.34117/bjdv5n12-140
Autor:
Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg, Vinícius Araújo Petch, José Gomes Lopes Filho
Publikováno v:
Brazilian Journal of Development. 5:21003-21019
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b9527c1cb7103c211e7ef91744c23e8
https://doi.org/10.34117/bjdv5n10-267
https://doi.org/10.34117/bjdv5n10-267
Publikováno v:
Traveling Salesman Problem
Particle swarm optimization, PSO, is an evolutionary computation technique inspired in the behavior of bird flocks. PSO algorithms were first introduced by Kennedy & Eberhart (1995) for optimizing continuous nonlinear functions. The fundamentals of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f6440f9bf95882bfcda45c2524aeec5
http://www.intechopen.com/articles/show/title/particle_swarm_optimization_algorithm_for_the_traveling_salesman_problem
http://www.intechopen.com/articles/show/title/particle_swarm_optimization_algorithm_for_the_traveling_salesman_problem
