Competitive multiple allocation hub location problem considering primary and backup routes
From MaRDI portal
Publication:2140777
DOI10.1007/s40314-022-01849-8zbMath1499.90057OpenAlexW4229000888MaRDI QIDQ2140777
Emad Roghanian, Sina Khodaee, Nader Ghaffari-Nasab
Publication date: 23 May 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-01849-8
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Cites Work
- Optimization by Simulated Annealing
- Hub location under competition
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A Stackelberg hub arc location model for a competitive environment
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- Metaheuristics for bi-level optimization
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- A fuzzy programming approach for dynamic virtual hub location problem
- 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
- 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
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Location of hubs in a competitive environment
- Practical bilevel optimization. Algorithms and applications
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- Foundations of bilevel programming
- 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
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Alternate solution approaches for competitive hub location problems
- Perspectives on modeling hub location problems
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- A single allocation hub location and pricing problem
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand
- Dynamical Gene-Environment Networks Under Ellipsoidal Uncertainty: Set-Theoretic Regression Analysis Based on Ellipsoidal OR
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- STACKELBERG HUB LOCATION PROBLEM
- Robust optimization in spline regression models for multi-model regulatory networks under polyhedral uncertainty
- Equation of State Calculations by Fast Computing Machines
- The uncapacitated r‐allocation p‐hub center problem
