Dual-based approach for a hub network design problem under non-restrictive policy

DOI10.1016/S0377-2217(00)00114-4MaRDI QIDQ5938396zbMATH OpenOpenAlexWikidataFDO

Authors Chang Sup Sung, H. W. Jin

Publication date 18 July 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(00)00114-4

zbMATH Keywords

dual-based approachinteger programminglocationtransportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Airline network design and hub location problems
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• Exact solution of hub network design problems with profits

Cites work

• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• A dual ascent approach for steiner tree problems on a directed graph
• A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A Dual-Based Procedure for Uncapacitated Facility Location
• A linear program for the two-hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Analyzing tradeoffs between zonal constraints and accessibility in facility location
• Avoiding local optima in the p-hub location problem using tabu search and GRASP
• Design of a distributed finer transport network with hubbing topology
• Dual-ascent methods for large-scale multicommodity flow problems
• Heuristics for the p-hub location problem
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Lower Bounds for the Hub Location Problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• On tabu search for the location of interacting hub facilities

Cited in

(12)

• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
• A multiobjective hub-airport location problem for an airline network design
• Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
• Modeling congestion and service time in hub location problems
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling
• Dual market facility network design under bounded rationality
• Network hub location problems: The state of the art
• Allocation strategies in hub networks
• Lagrangean relaxation-based techniques for solving facility location problems
• An efficient model for the multiple allocation hub maximal covering problem
• Flow shipment scheduling in an incomplete hub location-routing network design problem
• An exact solution procedure for a cluster hub location problem

This page was built for publication: Dual-based approach for a hub network design problem under non-restrictive policy

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