An exact algorithm for the service network design problem with hub capacity constraints

DOI10.1002/NET.22128MaRDI QIDQ6085889zbMATH OpenFDO

Authors Edward He, Natashia Boland, G. L. Nemhauser, Martin W. P. Savelsbergh

Publication date 12 December 2023

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22128

zbMATH Keywords

dynamic discretization discoveryhub capacityiterative refinementsame-day deliveryservice network designtime discretizationtime-expanded networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The Continuous-Time Service Network Design Problem
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Exact solution of hub network design problems with profits
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
• Hub location problems with choice of different hub capacities and vehicle types

Cites work

• A suggested computation for maximal multi-commodity network flows
• A time bucket formulation for the traveling salesman problem with time windows
• A time indexed formulation of non-preemptive single machine scheduling problems
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Constructing maximal dynamic flows from static flows
• Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
• Efficient continuous-time dynamic network flow algorithms
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Multicommodity flows over time: Efficient algorithms and complexity
• Multimodal Express Package Delivery: A Service Network Design Application
• Perspectives on integer programming for time-dependent models
• Service network design in freight transportation
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• The Continuous-Time Service Network Design Problem

Cited in

(2)

• scientific article; zbMATH DE number 4100921 (Why is no real title available?)
• An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints

This page was built for publication: An exact algorithm for the service network design problem with hub capacity constraints

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