Boosting ant colony optimization via solution prediction and machine learning. (July 2022)
- Record Type:
- Journal Article
- Title:
- Boosting ant colony optimization via solution prediction and machine learning. (July 2022)
- Main Title:
- Boosting ant colony optimization via solution prediction and machine learning
- Authors:
- Sun, Yuan
Wang, Sheng
Shen, Yunzhuang
Li, Xiaodong
Ernst, Andreas T.
Kirley, Michael - Abstract:
- Abstract: 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 ofAbstract: 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. Highlights: Integrating machine learning with meta-heuristic is beneficial for problem solving. The sampling of ant colony optimization can be improved via solution prediction. Three classification algorithms are shown to be effective for solution prediction. The hybrid approach generalizes well to a large array of problem instances. … (more)
- Is Part Of:
- Computers & operations research. Volume 143(2022)
- Journal:
- Computers & operations research
- Issue:
- Volume 143(2022)
- Issue Display:
- Volume 143, Issue 2022 (2022)
- Year:
- 2022
- Volume:
- 143
- Issue:
- 2022
- Issue Sort Value:
- 2022-0143-2022-0000
- Page Start:
- Page End:
- Publication Date:
- 2022-07
- Subjects:
- Meta-heuristic -- Machine learning -- Combinatorial optimization -- Ant colony optimization -- Optimal solution prediction
Operations research -- Periodicals
Electronic digital computers -- Periodicals
004.05 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03050548 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cor.2022.105769 ↗
- Languages:
- English
- ISSNs:
- 0305-0548
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.770000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 21249.xml