Generalization of machine learning for problem reduction: a case study on travelling salesman problems
From MaRDI portal
Publication:2241908
Abstract: Combinatorial optimization plays an important role in real-world problem solving. In the big data era, the dimensionality of a combinatorial optimization problem is usually very large, which poses a significant challenge to existing solution methods. In this paper, we examine the generalization capability of a machine learning model for problem reduction on the classic travelling salesman problems (TSP). We demonstrate that our method can greedily remove decision variables from an optimization problem that are predicted not to be part of an optimal solution. More specifically, we investigate our model's capability to generalize on test instances that have not been seen during the training phase. We consider three scenarios where training and test instances are different in terms of: 1) problem characteristics; 2) problem sizes; and 3) problem types. Our experiments show that this machine learning based technique can generalize reasonably well over a wide range of TSP test instances with different characteristics or sizes. While the accuracy of predicting unused variables naturally deteriorates as a test instance is further away from the training set, we observe that even when tested on a different TSP problem variant, the machine learning model still makes useful predictions about which variables can be eliminated without significantly impacting solution quality.
Recommendations
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning the travelling salesperson problem requires rethinking generalization
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- Learning heuristics for the TSP by policy gradient
- Boosting ant colony optimization via solution prediction and machine learning
Cites work
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- A review on algorithms for maximum clique problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Edge elimination in TSP instances
- LIBLINEAR: a library for large linear classification
- Learning heuristics for the TSP by policy gradient
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Support-vector networks
- TSPLIB—A Traveling Salesman Problem Library
- The traveling salesman problem. A computational study.
- Transforming asymmetric into symmetric traveling salesman problems
- Trust region Newton method for logistic regression
- Working set selection using second order information for training support vector machines
Cited in
(8)- Boosting ant colony optimization via solution prediction and machine learning
- One-shot learning for MIPs with SOS1 constraints
- Scalability of using restricted Boltzmann machines for combinatorial optimization
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Deep policy dynamic programming for vehicle routing problems
- Learning to sparsify travelling salesman problem instances
- Learning the travelling salesperson problem requires rethinking generalization
- Network flow problem heuristic reduction using machine learning
This page was built for publication: Generalization of machine learning for problem reduction: a case study on travelling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2241908)
