Hub location problem in round-trip service applications

DOI10.1051/ro/2020125OpenAlexW3095694975MaRDI QIDQ5002408

Karim Bouamrane, Shahin Gelareh, Omar Kemmar

Publication date: 27 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2020125

zbMATH Keywords

reinforcement learningvariable neighborhood searchbranch-and-cut\(k\)-meanshyper-heuristichub location problemliner shippingrunaway node

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Hub location problem in round-trip service applications