Pages that link to "Item:Q2242290"
From MaRDI portal
The following pages link to Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290):
Displayed 13 items.
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
- A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
- Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
- The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
- A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
- (Q6120096) (← links)
- Learn to decompose multiobjective optimization models for large‐scale networks (Q6187246) (← links)