当前位置: X-MOL 学术Comput. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The bi-objective stochastic covering tour problem
Computers & Operations Research ( IF 4.6 ) Pub Date : 2012-07-01 , DOI: 10.1016/j.cor.2011.09.009
Fabien Tricoire 1 , Alexandra Graf , Walter J Gutjahr
Affiliation  

We formulate a bi-objective covering tour model with stochastic demand where the two objectives are given by (i) cost (opening cost for distribution centers plus routing cost for a fleet of vehicles) and (ii) expected uncovered demand. In the model, it is assumed that depending on the distance, a certain percentage of clients go from their homes to the nearest distribution center. An application in humanitarian logistics is envisaged. For the computational solution of the resulting bi-objective two-stage stochastic program with recourse, a branch-and-cut technique, applied to a sample-average version of the problem obtained from a fixed random sample of demand vectors, is used within an epsilon-constraint algorithm. Computational results on real-world data for rural communities in Senegal show the viability of the approach.

中文翻译:

双目标随机覆盖旅游问题

我们制定了一个包含随机需求的双目标覆盖旅游模型,其中两个目标由(i)成本(配送中心的开放成本加上车队的路线成本)和(ii)预期的未覆盖需求给出。在该模型中,假设根据距离的不同,一定比例的客户会从家中前往最近的配送中心。设想在人道主义物流中应用。对于所产生的具有资源的双目标两阶段随机程序的计算解决方案,分支和切割技术应用于从需求向量的固定随机样本中获得的问题的样本平均版本,用于epsilon 约束算法。塞内加尔农村社区真实世界数据的计算结果显示了该方法的可行性。
更新日期:2012-07-01
down
wechat
bug