Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Cites Work

Title not available (Why is that?)
Optimization by Simulated Annealing
Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
A quadratic integer program for the location of interacting hub facilities
Applications of second-order cone programming
Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
Second-order cone programming
Hub-and-spoke network design with congestion
Network hub location problems: The state of the art
A hub covering model for cargo delivery systems
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Allocation strategies in hub networks
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Hub Location and the p-Hub Median Problem
Solving the uncapacitated hub location problem using genetic algorithms
New simple and efficient heuristics for the uncapacitated single allocation hub location problem
Handbook of metaheuristics
Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Solution algorithms for the capacitated single allocation hub location problem
Location models for airline hubs behaving as \(M/D/c\) queues.
Robust optimization approach to capacitated single and multiple allocation hub location problems
A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
Stochastic air freight hub location and flight routes planning
Design of intermodal logistics networks with hub delays
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 general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
Perspectives on modeling 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
The uncapacitated r‐allocation p‐hub center 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
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
Hub interdiction problem variants: models and metaheuristic solution algorithms
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 maximal covering problem
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
Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem

Cited In (6)

An \(M/M/c\) queue model for hub covering location problem
Competitive multiple allocation hub location problem considering primary and backup routes
The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
Modeling congestion and service time in hub location problems
GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis

Recommendations

Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem 👍 👎
Efficient algorithms for the uncapacitated single allocation p-hub median problem 👍 👎
Uncapacitated single and multiple allocation \(p\)-hub center problems 👍 👎
A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem 👍 👎
Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem 👍 👎
GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem 👍 👎
The uncapacitated r‐allocation p‐hub center problem 👍 👎
Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem 👍 👎
Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem 👍 👎

This page was built for publication: Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion

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