Boosting ant colony optimization via solution prediction and machine learning
From MaRDI portal
Publication:2147035
DOI10.1016/j.cor.2022.105769OpenAlexW3048271757MaRDI QIDQ2147035
Sheng Wang, Andreas T. Ernst, Yunzhuang Shen, Michael Kirley, Xiaodong Li, Yu-An Sun
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.04213
combinatorial optimizationmachine learningmeta-heuristicant colony optimizationoptimal solution prediction
Related Items (4)
A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ Machine learning augmented approaches for hub location problems ⋮ MNEARO: a meta swarm intelligence optimization algorithm for engineering applications ⋮ A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A branch-and-cut algorithm for the orienteering arc routing problem
- Solving the team orienteering problem with cutting planes
- The orienteering problem: a survey
- Model-based search for combinatorial optimization: A critical survey
- The effective application of a new approach to the generalized orienteering problem
- A fast and effective heuristic for the orienteering problem
- A hybrid genetic algorithm for the open shop scheduling problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- The probabilistic orienteering problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- An efficient evolutionary algorithm for the orienteering problem
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A new upper bound for the maximum weight clique problem
- Support-vector networks
- Coupling ant colony systems with strong local searches
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- A fast solution method for the time-dependent orienteering problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- Ant colony optimization theory: a survey
- A review on algorithms for maximum clique problems
- The stable set problem: clique and nodal inequalities revisited
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- The orienteering problem
- Solving the Orienteering Problem through Branch-and-Cut
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: Boosting ant colony optimization via solution prediction and machine learning
