.png){kind=icon}
返回
A genetic algorithm for the uncapacitated single allocation planar hub location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each spoke must be assigned to only one hub. We propose a mathematical formulation and a genetic algorithm (PHLGA) to solve PHLP in reasonable time. We test PHLGA on simulated and real life data sets. We compare our results with optimal solution and analyze results for special cases of PHLP for which the solution behavior can be predicted. Moreover, PHLGA results for the AP and CAB data set are compared with other heuristics. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Genetic algorithms
Hub location problems
Planar hub location problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem求解无容量单分配p-hub中值问题的一般变邻域搜索
PREAI
分享收藏Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem求解无资本单分配p-hub中值问题的两种遗传算法
PREAI
分享收藏
查看更多内容