Zobrazeno 1 - 10
of 459
pro vyhledávání: '"Tierney, Kevin"'
Autor:
Berto, Federico, Hua, Chuanbo, Zepeda, Nayeli Gast, Hottung, André, Wouda, Niels, Lan, Leon, Park, Junyoung, Tierney, Kevin, Park, Jinkyoo
This paper introduces RouteFinder, a comprehensive foundation model framework to tackle different Vehicle Routing Problem (VRP) variants. Our core idea is that a foundation model for VRPs should be able to represent variants by treating each as a sub
Externí odkaz:
http://arxiv.org/abs/2406.15007
Reinforcement learning-based methods for constructing solutions to combinatorial optimization problems are rapidly approaching the performance of human-designed algorithms. To further narrow the gap, learning-based approaches must efficiently explore
Externí odkaz:
http://arxiv.org/abs/2402.14048
Autor:
Berto, Federico, Hua, Chuanbo, Park, Junyoung, Luttmann, Laurin, Ma, Yining, Bu, Fanchen, Wang, Jiarui, Ye, Haoran, Kim, Minsu, Choi, Sanghyeok, Zepeda, Nayeli Gast, Hottung, André, Zhou, Jianan, Bi, Jieyi, Hu, Yu, Liu, Fei, Kim, Hyeonah, Son, Jiwoo, Kim, Haeyeon, Angioni, Davide, Kool, Wouter, Cao, Zhiguang, Zhang, Qingfu, Kim, Joungho, Zhang, Jie, Shin, Kijung, Wu, Cathy, Ahn, Sungsoo, Song, Guojie, Kwon, Changhyun, Tierney, Kevin, Xie, Lin, Park, Jinkyoo
Deep reinforcement learning (RL) has recently shown significant benefits in solving combinatorial optimization (CO) problems, reducing reliance on domain expertise, and improving computational efficiency. However, the field lacks a unified benchmark
Externí odkaz:
http://arxiv.org/abs/2306.17100
Autor:
Brandt, Jasmin, Schede, Elias, Bengs, Viktor, Haddenhorst, Björn, Hüllermeier, Eyke, Tierney, Kevin
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there has been significant progress in designing AC approaches that satisfy st
Externí odkaz:
http://arxiv.org/abs/2212.00333
Block stacking storage systems are highly adaptable warehouse systems with low investment costs. With multiple, deep lanes they can achieve high storage densities, but accessing some unit loads can be time-consuming. The unit-load pre-marshalling pro
Externí odkaz:
http://arxiv.org/abs/2207.09118
Autor:
Choo, Jinho, Kwon, Yeong-Dae, Kim, Jihoon, Jae, Jeongwoo, Hottung, André, Tierney, Kevin, Gwon, Youngjune
Neural approaches for combinatorial optimization (CO) equip a learning mechanism to discover powerful heuristics for solving complex real-world problems. While neural approaches capable of high-quality solutions in a single shot are emerging, state-o
Externí odkaz:
http://arxiv.org/abs/2207.06190
Autor:
Schede, Elias, Brandt, Jasmin, Tornede, Alexander, Wever, Marcel, Bengs, Viktor, Hüllermeier, Eyke, Tierney, Kevin
Publikováno v:
Journal of Artificial Intelligence Research (JAIR) 75 (2022) 425-487
Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of AC problem variants and methods proposed in the literature. Existing re
Externí odkaz:
http://arxiv.org/abs/2202.01651
Autor:
Bliek, Laurens, da Costa, Paulo, Afshar, Reza Refaei, Zhang, Yingqian, Catshoek, Tom, Vos, Daniël, Verwer, Sicco, Schmitt-Ulms, Fynn, Hottung, André, Shah, Tapan, Sellmann, Meinolf, Tierney, Kevin, Perreault-Lafleur, Carl, Leboeuf, Caroline, Bobbio, Federico, Pepin, Justine, Silva, Warley Almeida, Gama, Ricardo, Fernandes, Hugo L., Zaefferer, Martin, López-Ibáñez, Manuel, Irurozki, Ekhine
This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCAI-21). The TSP is one of the classical combinatorial optimization prob
Externí odkaz:
http://arxiv.org/abs/2201.10453
Publikováno v:
In European Journal of Operational Research 1 December 2024 319(2):531-542