An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
From MaRDI portal
Publication:1652700
DOI10.1016/j.cor.2018.04.021zbMath1391.90376OpenAlexW2802557590WikidataQ129884562 ScholiaQ129884562MaRDI QIDQ1652700
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.021
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (10)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Stochastic hub location problems with Bernoulli demands ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ An alternative approach to address uncertainty in hub location ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Uses Software
Cites Work
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Integrating matheuristics and metaheuristics for timetabling
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Stochastic uncapacitated hub location
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- 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
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- The stochastic \(p\)-hub center problem with service-level constraints
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Preprocessing and cutting for multiple allocation hub location problems.
- A capacitated hub location problem under hose demand uncertainty
- Matheuristics for the single-path design-balanced service network design problem
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Benders decomposition applied to a robust multiple allocation incomplete hub location 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
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Future paths for integer programming and links to artificial intelligence
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- A hub covering model for cargo delivery systems
- Matheuristics
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Matheuristics for the capacitated p‐median problem
This page was built for publication: An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
