Hub location problem considering spoke links with incentive-dependent capacities
From MaRDI portal
Publication:2676359
DOI10.1016/J.COR.2022.105959OpenAlexW4286566100MaRDI QIDQ2676359FDOQ2676359
Authors: Yanyan Li 
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105959
Recommendations
- Hub location problems with choice of different hub capacities and vehicle types
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- Hub-and-spoke network design with congestion
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
locationmixed integer convex programminghub-and-spoke networkouter-approximationstepwise linearization
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Discrete Choice Methods with Simulation
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- The many-to-many location-routing problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Hub-and-spoke network design with congestion
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Network hub location problems: The state of the art
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Allocation strategies in hub networks
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Hub location-allocation in intermodal logistic networks
- Multiple allocation hub-and-spoke network design under hub congestion
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Tight bounds from a path based formulation for the tree of hub location problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Design of intermodal logistics networks with hub delays
- A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
- Solving the hub location problem with modular link capacities
- Topological design of a two-level network with ring-star configuration
- On the single-assignment \(p\)-hub center problem
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- A branch-and-cut algorithm for the hub location and routing problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median 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
- Path relinking approach for multiple allocation hub maximal covering problem
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- The \(p\)-hub center allocation problem
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- The capacitated directed cycle hub location and routing problem under congestion
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- An exact algorithm for the modular hub location problem with single assignments
- Heuristics for the capacitated modular hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
Cited In (6)
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Integrated hub location and flow processing schedule problem under renewable capacity constraint
- Title not available (Why is that?)
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- A co-opetitive framework for the hub location problems in transportation networks
- Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount
Uses Software
This page was built for publication: Hub location problem considering spoke links with incentive-dependent capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676359)
