Fuzzy multi-objective linear programming for a stochastic hub maximal covering problem with uncertain shipments
Fuzzy multi-objective linear programming for a stochastic hub maximal covering problem with uncertain shipments
复制标题
不确定发货的随机枢纽最大覆盖问题的模糊多目标线性规划
DOI：
10.1504/ijise.2016.077699
复制
发表时间：
2016
影响因子：
--
通讯作者：
M. M. Lotfi
中科院分区：
文献类型：
--
作者：
Amir Ebrahimi Zade;A. Sadegheih;M. M. Lotfi
当网络中有许多始发地和目的地时，枢纽的使用有助于从运输的规模经济中受益，并大大减少所需链路的数量。在两个真实世界的假设下，我们提出了一个随机枢纽最大覆盖问题的双目标数学模型。在许多网络中，节点之间的运输存在一定的风险。为了考虑这种风险，除了最大化覆盖节点的效用之外，第二个目标旨在最大化网络中最弱路径的安全性。此外，与实际情况类似，假设运输时间为正态随机变量。建立了一种有效的非线性混合整数模型，线性化后，采用模糊多目标线性规划方法进行求解。值得注意的是，我们的模型的单目标版本比以前的模型具有更少的变量和方程数量。通过建立从土耳其数据集中提取的24个测试问题的计算结果证实：1)所提出的单目标枢纽最大覆盖问题公式的有效性；2)所提出的双目标模型在提高所设计网络的安全性方面具有令人满意的性能。
When there are many origins and destinations in a network, the use of hubs helps to benefit from the economies of scale in transportation and considerable reduction in the number of required links. We propose a bi-objective mathematical model for a stochastic hub maximal covering problem formulated under two real-world assumptions. In many networks, there are some risks for the shipments among the nodes. In order to consider such risks, a second objective, in addition to maximising the utility of covered nodes, is aimed at maximising the safety of weakest path in the network. Also, similar to the real world situation, it is assumed that the transport times are normal random variables. An efficient nonlinear mixed-integer model is developed and after linearising, a fuzzy multi-objective linear programming method is applied to solve it. Notably, the single objective version of our model has smaller number of variables and equations than the previous ones. The computational results by establishing 24 test problems extracted from the Turkish dataset confirm: 1) the validity of proposed formulations for single objective hub maximal covering problem; 2) the satisfying performance of proposed bi-objective model in improving the safety of designed network.