A Leader-Follower Hub Location Problem Under Fixed Markups

Čvokić, Dimitrije D.; Kochetov, Yury; Plyasunov, Andrey V.

doi:10.1007/978-3-319-44914-2_28

Cited by 7 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraints (8) makes sure that any hub-level flow must traverse the hub edges of operators. Constraints ( 9)-( 11) are the flow constraint taking into account that only one LSC is the winner for one given O-D demand.…”

Section: Mixed Integer Programming Formulationmentioning

confidence: 99%

“…Each decision-maker aims to maximize his/her own market share. Čvokić et al [8] deal with a Stackelberg approach where in a Leader and a Follower, are sequentially creating their hub and spoke networks to attract customers in a market where prices have fixed markups. Each competitor wants to maximize his profit, rather than a market share.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A co-opetitive framework for the hub location problems in transportation networks

et al. 2017

View full text Add to dashboard Cite

In this paper, we present the first model of co-opetition for a Hub Location Problem (HLP) between two Logistics Service Provider (LSPs) companies where the mother company is the owner of infrastructure. The LSPs would like to cooperate with each other by establishing joint edges with limited capacities connecting their service networks. Such services are in form of pendulum services (a direct service between two points) between nodes of different networks. Additional market can be generated as a result of joining the two networks. At the same time, a competition is taking place between the two operators to increase their share from the additional market generated. In order to solve this problem, we propose a matheuristic approach combining a local search algorithm and a Lagrangian relaxation-based approach. In our matheuristic algorithm, the neighborhood solutions are evaluated using a Lagrangian relaxation-based approach. Numerical results of applying the proposed algorithm on a real case study of the problem are presented.

show abstract

Section: Mixed Integer Programming Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A co-opetitive framework for the hub location problems in transportation networks

et al. 2017

View full text Add to dashboard Cite

show abstract

“…They modeled the problem as a bilevel program. Čvokić et al [5] considered a competitive market where prices had fixed markups and the each one two competitors (a leader and a follower) try to maximize his/her profit. The aim of this problem is to find the optimal hub and spoke network for the leader.…”

Section: Literature Reviewmentioning

confidence: 99%