Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Marcus Ritt"'
Publikováno v:
Operations Research Perspectives, Vol 8, Iss , Pp 100186- (2021)
This paper introduces acviz, a tool that helps to analyze the automatic configuration of algorithms with irace. It provides a visual representation of the configuration process, allowing users to extract useful information, e.g. how the configuration
Externí odkaz:
https://doaj.org/article/87702e53e3ed4647ab71e2e062b50694
Autor:
Victor Billy da Silva, Marcus Ritt, João Batista da Paz Carvalho, Marcos José Brusso, Juliano Tonezer da Silva
Publikováno v:
Revista Brasileira de Computação Aplicada, Vol 4, Iss 1, Pp 61-70 (2012)
Este trabalho apresenta um algoritmo heurístico, baseado no Continuous GRASP, que busca encontrar a maior elipse, de excentricidade prescrita, inscrita no interior de um polígono não convexo, e um estudo de caso da eficiência desta abordagem. P
Externí odkaz:
https://doaj.org/article/3f47590e92054efbb07f64f3bc14b408
Autor:
Alex Gliesch, Marcus Ritt
Publikováno v:
Journal of Heuristics. 28:61-91
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:141-148
Pattern databases have been successfully applied to several problems. Their use assumes that the goal state is known, and once the pattern database is built, commonly it can be used by all instances. However, in Sokoban, before solving the puzzle, th
Publikováno v:
Proceedings of the Genetic and Evolutionary Computation Conference Companion.
Autor:
Marcelo de Souza, Marcus Ritt
Publikováno v:
Proceedings of the Genetic and Evolutionary Computation Conference.
Autor:
Alex Gliesch, Marcus Ritt
Publikováno v:
European Journal of Operational Research. 288:721-735
In this paper we propose a hybrid heuristic for the Maximum Dispersion Problem of finding a balanced partition of a set of objects such that the shortest intra-part distance is maximized. In contrast to clustering problems, dispersion problems aim fo
Autor:
Jordi Pereira, Marcus Ritt
Publikováno v:
European Journal of Operational Research. 287:61-75
We address the problem of finding an arborescence of minimum total edge weight rooted at a given vertex in a directed, edge-weighted graph. If the arborescence must span all vertices the problem is solvable in polynomial time, but the non-spanning ve
Autor:
Marcus Ritt, Jordi Pereira
Publikováno v:
Journal of the Operational Research Society. 73:1420-1422
Battarra et al. recently proposed a novel assembly line balancing problem with applications to the apparel industry, where the tasks are performed in a fixed order. To solve the problem, one has to...
Autor:
Marcus Ritt, Gustavo Delazeri
Publikováno v:
CEC
Speedy delivery of products is important for customers and the optimization of the last mile has particular challenges. In recent years drone-supported delivery has become increasingly feasible and therefore a topic of intense research. In this paper