Single allocation hub location with heterogeneous economies of scale

DOI10.1287/OPRE.2021.2185zbMATH Open1490.90190OpenAlexW3186291209MaRDI QIDQ5080641FDOQ5080641

Authors: Borzou Rostami, Masoud Chitsaz, Okan Arslan, G. Laporte, Andrea Lodi 

Publication date: 31 May 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2021.2185

Recommendations

• Solving large single allocation \(p\)-hub problems with two or three hubs
• Benders decomposition algorithms for two variants of the single allocation hub location problem
• Enumeration and search procedures for a hub location problem with economies of scale
• A decomposition approach for single allocation hub location problems with multiple capacity levels
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion

zbMATH Keywords

transportationLagrangian relaxationhub locationeconomies of scalequadratic programbenders decompositionsingle allocation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• 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
• Network hub location problems: The state of the art
• Benders decomposition for large-scale uncapacitated hub location
• The Cutting-Plane Method for Solving Convex Programs
• Stochastic uncapacitated hub location
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Hub Location and the p-Hub Median Problem
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Solution algorithms for the capacitated single allocation hub location problem
• Hub location problems in urban traffic networks
• Hub arc location problems: I. Introduction and results
• Projecting the flow variables for hub location problems
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• Branch and price for large-scale capacitated hub location problems with single assignment
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• The latest arrival hub location problem
• A conditional \(p\)-hub location problem with attraction functions
• 0-1 reformulations of the multicommodity capacitated network design problem
• Network cost minimization using threshold-based discounting
• Perspectives on modeling hub location problems
• Integer programming duality: Price functions and sensitivity analysis
• Airline network design and hub location problems
• Solving the Hub location problem in telecommunication network design: A local search approach
• Stochastic single-allocation hub location
• Enumeration and search procedures for a hub location problem with economies of scale
• Duality for mixed-integer linear programs
• Routing and scheduling decisions in the hierarchical hub location problem
• Release Time Scheduling and Hub Location for Next-Day Delivery
• An exact algorithm for the modular hub location problem with single assignments
• Reliable single allocation hub location problem under hub breakdowns
• Improving the integer L-shaped method

Cited In (4)

• A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
• Location of slaughterhouses under economies of scale
• The Economics of Hubs: The Case of Monopoly

This page was built for publication: Single allocation hub location with heterogeneous economies of scale

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