arrow
返回

Boosting ant colony optimization via solution prediction and machine learning

delete2022-07-01
delete16
delete
OA
AI
Y
Yuan Sun *
S
Sheng Wang
Y
Yunzhuang Shen
李小冬 封面图
李小冬 (Xiaodong Li)
A
Andreas Ernst
M
Michael Kirley
DOI:10.1016/j.cor.2022.105769delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper introduces an enhanced meta-heuristic (ML-ACO) that combines machine learning (ML) and ant colony optimization (ACO) to solve combinatorial optimization problems. To illustrate the underlying mechanism of our ML-ACO algorithm, we start by describing a test problem, the orienteering problem. In this problem, the objective is to find a route that visits a subset of vertices in a graph within a time budget to maximize the collected score. In the first phase of our ML-ACO algorithm, an ML model is trained using a set of small problem instances where the optimal solution is known. Specifically, classification models are used to classify an edge as being part of the optimal route, or not, using problem-specific features and statistical measures. The trained model is then used to predict the 'probability' that an edge in the graph of a test problem instance belongs to the corresponding optimal route. In the second phase, we incorporate the predicted probabilities into the ACO component of our algorithm, i.e., using the probability values as heuristic weights or to warm start the pheromone matrix. Here, the probability values bias sampling towards favoring those predicted 'high-quality' edges when constructing feasible routes. We have tested multiple classification models including graph neural networks, logistic regression and support vector machines, and the experimental results show that our solution prediction approach consistently boosts the performance of ACO. Further, we empirically show that our ML model trained on small synthetic instances generalizes well to large synthetic and real-world instances. Our approach integrating ML with a meta-heuristic is generic and can be applied to a wide range of optimization problems.
Keyword:
Meta-heuristic
Machine learning
Combinatorial optimization
Ant colony optimization
Optimal solution prediction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

M
Monash University
学者数:
5.4W
论文数: 5.4W
被引数: 79
N
New York University
学者数:
4.4W
论文数: 3.9W
被引数: 5.8W
U
university of melbourne
学者数:
5.7W
论文数: 5.4W
被引数: 69
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art
err2022-01-01
err228
errOAAI
errKarimi-Mamaghan, Maryam; Mohammadi, Mehrdad; Meyer, Patrick; Karimi-Mamaghan, Amir Mohammad; Talbi, El-Ghazali
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容