The capacitated directed cycle hub location and routing problem under congestion
From MaRDI portal
Publication:2030629
DOI10.1016/j.ejor.2020.11.021zbMath1487.90431OpenAlexW3098361543MaRDI QIDQ2030629
Sanja Petrovic, Luc Muyldermans, Cihan Bütün
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.021
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (max. 100)
Hub location problem considering spoke links with incentive-dependent capacities ⋮ Multi-period single-allocation hub location-routing: models and heuristic solutions
Uses Software
Cites Work
- Unnamed Item
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- A branch-and-cut algorithm for the hub location and routing problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- An \(M/M/c\) queue model for hub covering location problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Tight bounds from a path based formulation for the tree of hub location problem
- Application of FMCDM model to selecting the hub location in the marine transportation: a case study in southeastern Asia
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Solution algorithms for the capacitated single allocation hub location problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Preprocessing and cutting for multiple allocation hub location problems.
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Hub-and-spoke network design with congestion
- Locating median cycles in networks
- Design of intermodal logistics networks with hub delays
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Modeling congestion and service time in hub location problems
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Topological design of a two-level network with ring-star configuration
- Star \(p\)-hub median problem with modular arc capacities
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- Bicriteria p-Hub Location Problems and Evolutionary Algorithms
- Hub Location as the Minimization of a Supermodular Set Function
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solving the hub location problem in a star–star network
- Nonlinear Programming
This page was built for publication: The capacitated directed cycle hub location and routing problem under congestion
