Round-trip hub location problem

DOI10.1051/RO/2024116MaRDI QIDQ7023081zbMATH OpenFDO

Authors Omar Kemmar, Karim Bouamrane, Shahin Gelareh

Publication date 21 February 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024116

zbMATH Keywords

\(A\)-learning\(Q\)-learningbranch-and-cuthub location problemhyper-heuristicliner shippingreinforcement learningrunaway node

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A branch-and-cut algorithm for the hub location and routing problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• Exact and heuristic approaches for the cycle hub location problem
• scientific article; zbMATH DE number 1728538 (Why is no real title available?)
• Hub location problem in round-trip service applications
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping
• Improved formulations for the ring spur assignment problem
• Integer programming formulations of discrete hub location problems
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
• Reliable single allocation hub location problem under hub breakdowns
• Solving the Hub location problem in telecommunication network design: A local search approach
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• The ring/-rings network design problem: model and branch-and-cut algorithm
• The transfer point location problem
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(1)

• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems

This page was built for publication: Round-trip hub location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023081)