Model-based automatic neighborhood design by unsupervised learning

DOI10.1016/j.cor.2014.09.006zbMath1348.90489OpenAlexW1975388745MaRDI QIDQ337347

Gianpaolo Ghiani, Emanuele Manni, Gilbert Laporte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.006

zbMATH Keywords

mixed integer programmingunsupervised learningneighborhood search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, A learn‐and‐construct framework for general mixed‐integer programming problems, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems

Uses Software

• TSPLIB
• AMPL
• MIPLIB
• CPLEX
• GAMS
• VRP

Cites Work

• Bounding, filtering and diversification in CP-based local branching
• A survey of very large-scale neighborhood search techniques
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• New convergent heuristics for 0-1 mixed integer programming
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• Repairing MIP infeasibility through local branching
• Variable neighborhood search and local branching
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• The Vehicle Routing Problem
• Integer Programming Formulation of Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• Solution of a Large-Scale Traveling-Salesman Problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design