Profit maximization in congested hub location problems: Demand models and service level constraints
研究拥堵枢纽选址问题，通过确定枢纽位置、容量和价格来最大化服务商利润，考虑价格依赖需求与M/G/1排队系统，并转化为可求解的混合整数二阶锥规划。
This study investigates a congested hub location problem with the aim of optimizing a service provider’s profit by determining hub locations, capacities, and prices for serving commodities. The study incorporates a price-dependent demand function with a general functional form and models hub operations as M / G / 1 queueing systems to address congestion effects. The problem is initially formulated as a mixed-integer nonlinear program, which is subsequently transformed into a mixed-integer second-order cone program, demonstrating solvability with standard off-the-shelf solvers. Through numerical analysis, the study evaluates the influence of different demand functional forms and service time constraints on the optimal network configuration and the service provider’s profitability.