A parallel adaptive memory algorithm for the capacitated modular hub location problem

DOI10.1016/j.cor.2023.106173MaRDI QIDQ6164373

Qinghua Wu, Zhe Sun, Yongliang Lu, Una Benlic

Publication date: 4 July 2023

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

zbMATH Keywords

heuristicstabu searchparallel computinghub location problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Heuristics for the capacitated modular hub location problem
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Less is more: general variable neighborhood search for the capacitated modular hub location problem
• Perspectives on modeling hub location problems
• Solving the hub location problem with modular link capacities
• An adaptive memory algorithm for the \(k\)-coloring problem
• Network hub location problems: The state of the art
• Solving the Hub location problem in telecommunication network design: A local search approach
• Tabu Search—Part I
• Tabu Search—Part II

This page was built for publication: A parallel adaptive memory algorithm for the capacitated modular hub location problem