Tabu search guided by reinforcement learning for the max-mean dispersion problem

DOI10.3934/jimo.2020115zbMath1476.65100OpenAlexW3039866308MaRDI QIDQ2666721

Dieudonné Nijimbere, Moses Olabhele Esangbedo, Nyiribakwe Dominique, Songzheng Zhao, Xunhao Gu

Publication date: 23 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020115

zbMATH Keywords

tabu searchreinforcement learning\(Q\)-learning algorithmhybrid metaheuristics algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• A hybrid three-phase approach for the Max-Mean dispersion problem
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• A simple and effective algorithm for the MaxMin diversity problem
• Construction and improvement algorithms for dispersion problems
• An efficient memetic algorithm for the graph partitioning problem
• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
• The quadratic balanced optimization problem
• An exact semidefinite programming approach for the max-mean dispersion problem
• 10.1162/15324430152733124
• Reinforcement Learning: A Tutorial Survey and Recent Advances
• A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem

This page was built for publication: Tabu search guided by reinforcement learning for the max-mean dispersion problem