Learning tabu search algorithms: a scheduling application
From MaRDI portal
Cites work
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- A learning tabu search for a truck allocation problem with linear and nonlinear cost components
- A search space ``cartography for guiding graph coloring heuristics
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Algorithm runtime prediction: methods \& evaluation
- An ILP-refined tabu search for the directed profitable rural postman problem
- Bandwidth Packing: A Tabu Search Approach
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Heuristic manipulation, tabu search and frequency assignment
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Learning evaluation functions to improve optimization by local search
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- Measuring the impact of primal heuristics
- Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management
This page was built for publication: Learning tabu search algorithms: a scheduling application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979389)
