列生成
数学优化
计算机科学
布线(电子设计自动化)
利用
网络规划与设计
运筹学
工程类
数学
计算机网络
计算机安全
作者
Vedat Bayram,Barış Yıldız,Mohammad Saleh Farham
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2023-09-01
卷期号:57 (5): 1276-1295
标识
DOI:10.1287/trsc.2022.0112
摘要
Our study introduces the hub network design problem with congestion, capacity, and stochastic demand considerations (HNDC), which generalizes the classical hub location problem in several directions. In particular, we extend state-of-the-art by integrating capacity acquisition decisions and congestion cost effect into the problem and allowing dynamic routing for origin-destination (OD) pairs. Connecting strategic and operational level decisions, HNDC jointly decides hub locations and capacity acquisitions by considering the expected routing and congestion costs. A path-based mixed-integer second-order cone programming (SOCP) formulation of the HNDC is proposed. We exploit SOCP duality results and propose an exact algorithm based on Benders decomposition and column generation to solve this challenging problem. We use a specific characterization of the capacity-feasible solutions to speed up the solution procedure and develop an efficient branch-and-cut algorithm to solve the master problem. We conduct extensive computational experiments to test the proposed approach’s performance and derive managerial insights based on realistic problem instances adapted from the literature. In particular, we found that including hub congestion costs, accounting for the uncertainty in demand, and whether the underlying network is complete or incomplete have a significant impact on hub network design and the resulting performance of the system. Funding: This work was supported by Türkiye Bilimsel ve Teknolojik Araştırma Kurumu [Grant 218M520]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.0112 .
科研通智能强力驱动
Strongly Powered by AbleSci AI