期刊
MATHEMATICS
卷 10, 期 24, 页码 -出版社
MDPI
DOI: 10.3390/math10244776
关键词
combinatorial problems; metaheuristics; binarization scheme; backward Q-learning; machine learning
类别
资金
- National Agency for Research and Development (ANID)
- Beca INF-PUCV [2021-21210740]
- [ANID/FONDECYT/REGULAR/1210810]
This paper investigates the use of continuous metaheuristics in solving binary-based combinatorial problems and proposes the use of reinforcement learning techniques to intelligently choose binarization schemes. The experimental results show that the method is competitive and applicable to complex problems in the industry.
In recent years, continuous metaheuristics have been a trend in solving binary-based combinatorial problems due to their good results. However, to use this type of metaheuristics, it is necessary to adapt them to work in binary environments, and in general, this adaptation is not trivial. The method proposed in this work evaluates the use of reinforcement learning techniques in the binarization process. Specifically, the backward Q-learning technique is explored to choose binarization schemes intelligently. This allows any continuous metaheuristic to be adapted to binary environments. The illustrated results are competitive, thus providing a novel option to address different complex problems in the industry.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据