The competition game on hub network design

被引:38
作者
Lin, Cheng-Chang [1 ]
Lee, Shwu-Chiou [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Transportat & Commun Management Sci, Tainan 70101, Taiwan
关键词
Hub-and-spoke network; Game theory; Cournot-Nash equilibrium; Less-than-truckload freight services; LOCATION PROBLEM; SPOKE NETWORKS; EXPRESS; FORMULATIONS; MODELS;
D O I
10.1016/j.trb.2009.09.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
In a competitive market, carriers in network industries design their hub networks and operations plans to maximize their respective profits. The long-term Cournot-Nash equilibrium steady state requires that none of the carriers may unilaterally alternate their hub networks or operations plans to increase profits. We study an integral-constrained game theoretic model for time-definite less-than-truckload freight services in an oligopolistic market. The research showed that carriers favor geographic central than outlying hub locations. With price-elastic demand in the freight market, the higher the network density is, the higher the profit is. Thus, the stable Cournot-Nash equilibrium solution states that all carriers respectively possess a similarly dense hub network, which is robust even with uneven changes in carrier cost structures. However, there is a prorogation effect in that an operating cost reduction will increase the individual carrier's and also the competitors' profits. The results also showed that there are cooperative equilibria that can make all carriers better off, but are unstable solutions in the non-cooperative game. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:618 / 629
页数:12
相关论文
共 28 条
[1]  
Ahuja R., 1993, NETWORK FLOWS THEORY
[2]   Network hub location problems: The state of the art [J].
Alumur, Sibel ;
Kara, Bahar Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) :1-21
[3]   The design of single allocation incomplete hub networks [J].
Alumur, Sibel A. ;
Kara, Bahar Y. ;
Karasan, Oya E. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2009, 43 (10) :936-951
[4]   Composite variable formulations for express shipment service network design [J].
Armacost, AP ;
Barnhart, C ;
Ware, KA .
TRANSPORTATION SCIENCE, 2002, 36 (01) :1-20
[5]   Hub location for time definite transportation [J].
Campbell, James F. .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (12) :3107-3116
[6]  
CHESTLER L, 1985, TRANSPORT Q, V39, P59
[7]   Benders decomposition for the uncapacitated multiple allocation hub location problem [J].
de Camargo, R. S. ;
Miranda, G., Jr. ;
Luna, H. P. .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) :1047-1064
[8]   Solving large single allocation p-hub problems with two or three hubs [J].
Ebery, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 128 (02) :447-458
[9]   The capacitated multiple allocation hub location problem: Formulations and algorithms [J].
Ebery, J ;
Krishnamoorthy, M ;
Ernst, A ;
Boland, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (03) :614-631
[10]   Hub-and-spoke network design with congestion [J].
Elhedhli, S ;
Hu, FXL .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) :1615-1632