A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
复制标题
考虑Hub能力的可靠多目标p-Hub覆盖定位问题
DOI：
10.5829/idosi.ije.2015.28.05b.10
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
M. Rezanezhad
中科院分区：
文献类型：
--
作者：
M. Bashiri;M. Rezanezhad
在设施选址问题中，减少总的运输费用和运输时间是常见的目标。设计具有集线器设施的网络可以提高网络效率。提出了一种新的P-枢纽覆盖选址模型。在p-hub覆盖问题中，试图定位hub并将客户分配给已建立的hub，而分配给hub的节点在相关hub覆盖半径内。本文试图根据已建枢纽的分拣能力来考虑其分拣能力。此外，网络的可靠性被认为是在所提出的模型作为一个目标。针对小规模实例，采用e约束算法求解所提出的多目标模型。针对大规模问题，提出了一种求解Pareto问题的非支配排序遗传算法（NSGA-II），并将其性能与e-约束算法进行了比较。通过数值算例对模型和求解算法进行了分析，并进行了灵敏度分析。分析表明，该模型提取的网络比经典网络更有效。
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are inside of related hubs covering radius. In this paper we attempt to consider capability of established hubs according to their corresponding capabilities on sorting operation. Moreover the reliability of network is considered in the proposed model as an objective. The proposed multi objective model is solved by e-constraint algorithm for small size instances. For large scale instances a non-dominated sorting genetic algorithm (NSGA-II) is presented to obtain Pareto solutions and its performance is compared with results of e-constraint algorithm. The model and solution algorithm were analyzed by more numerical examples and some sensitivity analysis have been done. The analysis confirms that the network extracted by the proposed model is more efficient than classic networks.