已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

A new distributionally robust p-hub median problem with uncertain carbon emissions and its tractable approximation method

稳健优化 模棱两可 数学优化 约束(计算机辅助设计) 最优化问题 设施选址问题 集合(抽象数据类型) 高斯分布 数学 计算机科学 几何学 量子力学 物理 程序设计语言
作者
Fanghao Yin,Yanju Chen,Fengxuan Song,Yankui Liu
出处
期刊:Applied Mathematical Modelling [Elsevier BV]
卷期号:74: 668-693 被引量:32
标识
DOI:10.1016/j.apm.2019.04.056
摘要

The p-hub median problem is to determine the optimal location for p hubs and assign the remaining nodes to hubs so as to minimize the total transportation costs. Under the carbon cap-and-trade policy, we study this problem by addressing the uncertain carbon emissions from the transportation, where the probability distributions of the uncertain carbon emissions are only partially available. A novel distributionally robust optimization model with the ambiguous chance constraint is developed for the uncapacitated single allocation p-hub median problem. The proposed distributionally robust optimization problem is a semi-infinite chance-constrained optimization model, which is computationally intractable for general ambiguity sets. To solve this hard optimization model, we discuss the safe approximation to the ambiguous chance constraint in the following two types of ambiguity sets. The first ambiguity set includes the probability distributions with the bounded perturbations with zero means. In this case, we can turn the ambiguous chance constraint into its computable form based on tractable approximation method. The second ambiguity set is the family of Gaussian perturbations with partial knowledge of expectations and variances. Under this situation, we obtain the deterministic equivalent form of the ambiguous chance constraint. Finally, we validate the proposed optimization model via a case study from Southeast Asia and CAB data set. The numerical experiments indicate that the optimal solutions depend heavily on the distribution information of carbon emissions. In addition, the comparison with the classical robust optimization method shows that the proposed distributionally robust optimization method can avoid over-conservative solutions by incorporating partial probability distribution information. Compared with the stochastic optimization method, the proposed method pays a small price to depict the uncertainty of probability distribution. Compared with the deterministic model, the proposed method generates the new robust optimal solution under uncertain carbon emissions.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
科研通AI2S应助t忒对采纳,获得10
1秒前
西瓜霜完成签到 ,获得积分10
2秒前
3秒前
秋波发布了新的文献求助30
6秒前
Lucas应助chu采纳,获得10
6秒前
旧时光完成签到,获得积分10
6秒前
故笺完成签到,获得积分10
7秒前
情怀应助要减肥的冰姬采纳,获得10
9秒前
长安完成签到 ,获得积分10
10秒前
11秒前
11秒前
一天完成签到 ,获得积分10
13秒前
t忒对完成签到 ,获得积分10
14秒前
干煸鸡发布了新的文献求助10
15秒前
跳跃惜筠发布了新的文献求助10
15秒前
顾白凡完成签到,获得积分0
15秒前
19秒前
烟花应助xu采纳,获得10
20秒前
lpp完成签到,获得积分10
20秒前
21秒前
fuziluo发布了新的文献求助10
21秒前
okayu发布了新的文献求助10
24秒前
27秒前
无花果应助柠VV采纳,获得10
29秒前
29秒前
快乐学习每一天完成签到 ,获得积分10
30秒前
30秒前
干煸鸡完成签到,获得积分10
32秒前
35秒前
35秒前
FashionBoy应助短短大王采纳,获得10
36秒前
maplesirup发布了新的文献求助10
36秒前
Criminology34应助科研通管家采纳,获得10
37秒前
Criminology34应助科研通管家采纳,获得10
37秒前
Criminology34应助科研通管家采纳,获得10
37秒前
科研通AI2S应助科研通管家采纳,获得10
37秒前
搜集达人应助科研通管家采纳,获得10
38秒前
纯真忆安完成签到,获得积分20
38秒前
FashionBoy应助科研通管家采纳,获得10
38秒前
英俊的铭应助科研通管家采纳,获得10
38秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Prompt Engineering for Clinicians: Harnessing AI in Everyday Medical Practice 600
REAL-WORLD EFFICACY AND GENOMIC LANDSCAPE OF POLATUZUMA VEDOTIN-BASED FIRST-LINE THERAPY IN DIFFUSE LARGE B-CELL LYMPHOMA: A FOCUS ON TP53 MUTATIONS AND TREATMENT RESPONSE 500
Handbook of Luminescence Dating 500
Safety Pharmacology 500
《KNN基无铅压电陶瓷电学性能优化与物理机理研究》 500
Elgar Concise Encyclopedia of Space Law 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 计算机科学 化学工程 生物化学 物理 内科学 复合材料 催化作用 光电子学 物理化学 电极 细胞生物学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6944437
求助须知:如何正确求助?哪些是违规求助? 8629885
关于积分的说明 18305557
捐赠科研通 6379654
什么是DOI,文献DOI怎么找? 3079291
关于科研通互助平台的介绍 2120203
邀请新用户注册赠送积分活动 2056180