Two-Stage Distributionally Robust Optimization for a Two-Allocation p-Hub Median Problem

Author:

Wang Congke1,Liu Yankui1,Zhang Peiyu1,Yang Guoqing2

Affiliation:

1. College of Mathematics and Information Science, Hebei University, Baoding City 071002, P. R. China

2. School of Management, Hebei University, Baoding City 071002, P. R. China

Abstract

This paper presents a novel two-stage distributionally robust optimization model of the two-allocation p-hub median problem with different hub link scales. With the objective of minimizing overall costs of building and operating the hub network, the choices of hub locations and hub link scales are decided in the first stage, while the optimal flows are determined in the second stage once the uncertain demands have been realized. Before establishing the hub network, we just have partial distribution information about the uncertain flow demands, which can be described by a given perturbation set based on the historical information. Due to the ambiguous distributions leading to a computationally intractable model, we reformulate the proposed model into the tractable robust counterpart forms under two types of uncertainty sets (Box[Formula: see text]ellipsoidal perturbation set and Generalized ellipsoidal perturbation set). Finally, to demonstrate the effectiveness and applicability for our model, we conduct a case study for the express network system in the Beijing–Tianjin–Hebei region.

Funder

The National Natural Science Foundation of China

The Top-notch talents of Heibei province

The Social Science Foundation of Hebei Province

Publisher

World Scientific Pub Co Pte Lt

Subject

Artificial Intelligence,Control and Optimization,Computer Vision and Pattern Recognition

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3