.png){kind=icon}
返回
A conditional p-hub location problem with attraction functions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.11.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We formulate the competitive hub location problem in which customers have gravity-like utility functions. In the resulting probabilistic model, customers choose an airline depending on a combination of functions of flying time and fare. The (conditional) follower's hub location problem is solved by means of a heuristic concentration method. Computational experience is obtained using the Australian data frequently used in the literature. The results demonstrate that the proposed method is viable even for problems of realistic size, and the results appear quite robust with respect to the leader's hub locations. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Hub location
Conditional location
Gravity model
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
查看更多内容