Zobrazeno 1 - 10
of 12
pro vyhledávání: '"André Renato Villela da Silva"'
Publikováno v:
Pesquisa Operacional para o Desenvolvimento. 11:151-158
O Problema do Caixeiro Alugador e uma variante do Problema do Caixeiro Viajante onde o cliente deseja percorrer algumas cidades utilizando um carro alugado. Neste problema o cliente pode trocar de carro em qualquer cidade da sua rota, pois cada carro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9f4566335950b310586195a298e35f8
https://doi.org/10.4322/podes.2019.011
https://doi.org/10.4322/podes.2019.011
Autor:
Rian G. S. Pinheiro, Luiz Satoru Ochi, André Renato Villela da Silva, Bruno José da Silva Barros
Publikováno v:
Annals of Operations Research. 286:33-54
This paper deals with the Flooding Problem on graphs. This problem consists in finding the shortest sequence of flooding moves that turns a colored graph into a monochromatic one. The problem has applications in some areas as disease propagation, for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::177629c3ff37d6c4bb28c3bc8f460f85
https://doi.org/10.1007/s10479-018-2796-0
https://doi.org/10.1007/s10479-018-2796-0
Publikováno v:
Expert Systems with Applications. 64:132-140
An evolutionary algorithm is proposed for non-Euclidean instances.A hybrid method using variable fixing is used as local search.Good calibration of algorithmic parameters can produce better solutions against literature results. This paper tackles a T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ebd6ef5969855013356cdf6893887c6
https://doi.org/10.1016/j.eswa.2016.07.038
https://doi.org/10.1016/j.eswa.2016.07.038
Publikováno v:
Hybrid Metaheuristics ISBN: 9783030059828
The Multi-Mode Resource-Constrained Project Scheduling Problem with energy saving (MRCPSP-energy) is a variant of the classical Resource-Constrained Project Scheduling Problem (RCPSP). In this variant, the execution of each job must take into account
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5164a8c560366c83f4df30480d5122d7
https://doi.org/10.1007/978-3-030-05983-5_13
https://doi.org/10.1007/978-3-030-05983-5_13
Publikováno v:
CEC
This work proposes a new algorithm that combines Iterated Local Search (ILS), Variable Neighborhood Search (VNS), Random Variable Neighborhood Descent (RVND) and a constructive initial search to solve the Traveling Car Renter Problem (CaRS). The CaRS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0483569734c241f55923e0e014c20895
https://doi.org/10.1109/cec.2018.8477777
https://doi.org/10.1109/cec.2018.8477777
Publikováno v:
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics.
Este artigo aborda uma variante do Problema do Caixeiro Viajante chamado Problema do Caixeiro Alugador, onde um cliente deseja viajar entre as cidades usando um veiculo alugado. Basicamente, o cliente tem duas opcoes quando chega em uma cidade: devol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebdec6a80e49d5503b37fc9e905895b9
https://doi.org/10.5540/03.2017.005.01.0460
https://doi.org/10.5540/03.2017.005.01.0460
Publikováno v:
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics.
O problema de inundacao e derivado de um popular jogo de computador de- nominado Flood-It. O objetivo e tornar monocromatica uma matriz colorida atraves do menor numero de etapas de inundacao. Por inundacao entende-se o processo de modificar a cor de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a89db3848f4225c3cc2b4cdc132f8bbd
https://doi.org/10.5540/03.2017.005.01.0458
https://doi.org/10.5540/03.2017.005.01.0458
Publikováno v:
Pesquisa Operacional v.34 n.1 2014
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Volume: 34, Issue: 1, Pages: 125-142, Published: 08 APR 2014
Pesquisa Operacional, Vol 34, Iss 1, Pp 125-142 (2014)
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Volume: 34, Issue: 1, Pages: 125-142, Published: 08 APR 2014
Pesquisa Operacional, Vol 34, Iss 1, Pp 125-142 (2014)
This work deals with a project scheduling problem where the tasks consume resources to be activated, but start to produce them after that. This problem is known as Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP). Three methods were p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::598d0ba944e931c62732547014804c0e
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100010
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100010
Publikováno v:
Computação Evolucionária em Problemas de Engenharia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99e28237fbfd4dc6630ca645ff2ac9a0
https://doi.org/10.7436/2011.cepe.c13
https://doi.org/10.7436/2011.cepe.c13
Publikováno v:
Hybrid Metaheuristics ISBN: 9783642160530
Hybrid Metaheuristics
Hybrid Metaheuristics
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and decrease in quantity according to the activated tasks and are not bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60c0e7f5d01114e82d7bd7d9b664bf52
https://doi.org/10.1007/978-3-642-16054-7_6
https://doi.org/10.1007/978-3-642-16054-7_6