A hub covering network design problem for cargo applications in Turkey
From MaRDI portal
Publication:3161787
DOI10.1057/jors.2008.92zbMath1196.90019OpenAlexW1968998791MaRDI QIDQ3161787
Bahar Yetis Kara, Sibel A. Alumur
Publication date: 18 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22604
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (18)
A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Hub location for time definite transportation ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Hub and spoke network design with single-assignment, capacity decisions and balancing requirements ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ LTL logistics networks with differentiated services ⋮ Perspectives on modeling hub location problems ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem
This page was built for publication: A hub covering network design problem for cargo applications in Turkey
