The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network

DOI10.1016/j.apm.2011.09.063zbMath1246.90087OpenAlexW1970024794MaRDI QIDQ450150

Jr-Yung Lin, Yin-Chieh Chen, Cheng-Chang Lin

Publication date: 13 September 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.063

zbMATH Keywords

genetic algorithmlocation\(p\)-hub median problemchinese air cargo network

Mathematics Subject Classification ID

Integer programming (90C10) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (12)

Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Skyport location problem for urban air mobility system ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ The hub location problem with market selection ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• Composite Variable Formulations for Express Shipment Service Network Design
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

This page was built for publication: The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network