A Stackelberg hub arc location model for a competitive environment

Sasaki, Mihiro; Campbell, James F.; Krishnamoorthy, Mohan; Ernst, Andreas T.

doi:10.1016/j.cor.2014.01.009

Cited by 57 publications

(15 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and by Mahmutogullari and Kara (2016) who present hub-medianoid and hub-centroid CHLPs where the market is assumed to be a duopoly, customers select one firm based on the provided service levels and the objective is to maximize their market share. The interested reader is addressed to Adler and Smilowitz (2007), Lin and Lee (2010), and Sasaki et al (2014), for examples of approaches of CHLPs under a game theoretic framework.…”

Section: Literature Reviewmentioning

confidence: 99%

Exact solution of hub network design problems with profits

Alibeyg

Contreras

Fernández

2018

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

Exact solution of hub network design problems with profits

Alibeyg

Contreras

Fernández

2018

European Journal of Operational Research

View full text Add to dashboard Cite

“…CHLPs have also been studied under a game theoretic framework, such as Stackelberg hub location models, cooperative game theoretic models with alliances and mergers, and non-cooperative game theoretic models (see Adler and Smilowitz, 2007;Lin and Lee, 2010;Asgari et al, 2013;Sasaki et al, 2014;Contreras, 2015). We note that HNDPPs can be clearly differentiated from CHLPs, as the focus of the former is to optimize the individual decision related to one single firm rather than on competition aspects.…”

Section: Literature Reviewmentioning

confidence: 99%

“…We note that HNDPPs can be clearly differentiated from CHLPs, as the focus of the former is to optimize the individual decision related to one single firm rather than on competition aspects. To the best of our knowledge, besides Sasaki et al (2014) all CHLPs previously studied focus on the location of hubs and do not explicitly consider hub arc selection decisions. Moreover, none of them consider other relevant decisions such as the activation of access/bridge arcs and servicing decisions for O/D nodes.…”

Section: Literature Reviewmentioning

confidence: 99%

Hub network design problems with profits

Alibeyg

Contreras

Fernández

2016

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

This paper presents a class of hub network design problems with profit-oriented objectives, which extend several families of classical hub location problems. Potential applications arise in the design of air and ground transportation networks. These problems include decisions on the origin/destination nodes that will be served as well as the activation of different types of edges, and consider the simultaneous optimization of the collected profit, setup cost of the hub network and transportation cost. Alternative models and integer programming formulations are proposed and analyzed. Results from computational experiments show the complexity of such models and highlight their superiority for decision-making.Peer ReviewedPostprint (author's final draft

show abstract

“…The game theory was introduced into the competitive location problem by Küçükaydin et al [10], in which they formulated a bilevel mixedinteger nonlinear programming model to solve the leader-follower problem. Sasaki et al [11] employed a generic hub arc location model to locate arcs within the framework of Stackelberg. With respect to methodology, various approaches were proposed to obtain the estimate of the market share captured by each competitive facility, such as proximity approach [4], deterministic utility approach [12], cover-based approach [13], and gravitybased approach [14].…”

Section: Introductionmentioning

confidence: 99%

An Uncertain Programming Model for Competitive Logistics Distribution Center Location Problem

Lan¹,

Peng²,

Chen³

2015

AJOR

View full text Add to dashboard Cite

We employ uncertain programming to investigate the competitive logistics distribution center location problem in uncertain environment, in which the demands of customers and the setup costs of new distribution centers are uncertain variables. This research was studied with the assumption that customers patronize the nearest distribution center to satisfy their full demands. Within the framework of uncertainty theory, we construct the expected value model to maximize the expected profit of the new distribution center. In order to seek for the optimal solution, this model can be transformed into its deterministic form by taking advantage of the operational law of uncertain variables. Then we can use mathematical software to obtain the optimal location. In addition, a numerical example is presented to illustrate the effectiveness of the presented model.

show abstract

A Stackelberg hub arc location model for a competitive environment

Cited by 57 publications

References 52 publications

Exact solution of hub network design problems with profits

Exact solution of hub network design problems with profits

Hub network design problems with profits

An Uncertain Programming Model for Competitive Logistics Distribution Center Location Problem

Contact Info

Product

Resources

About