Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
From MaRDI portal
Publication:2052283
DOI10.1007/s40314-021-01650-zzbMath1476.90177OpenAlexW3203837447MaRDI QIDQ2052283
Alireza Motallebzadeh, Nader Ghaffari-Nasab
Publication date: 25 November 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01650-z
Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Allocation strategies in hub networks
- Solving the uncapacitated hub location problem using genetic algorithms
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Stochastic air freight hub location and flight routes planning
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Applications of second-order cone programming
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Second-order cone programming
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Hub-and-spoke network design with congestion
- Design of intermodal logistics networks with hub delays
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Adjustable robust balanced hub location problem with uncertain transportation cost
- Perspectives on modeling hub location problems
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Modeling congestion and service time in hub location problems
- A single allocation hub location and pricing problem
- Network hub location problems: The state of the art
- Lectures on Modern Convex Optimization
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- A hub covering network design problem for cargo applications in Turkey
- A hub covering model for cargo delivery systems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem
- Handbook of metaheuristics
- The uncapacitated r‐allocation p‐hub center problem
This page was built for publication: Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
