STACKELBERG HUB LOCATION PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we consider a new competitive hub location model called Stackelberg hub location problem where a big firm competes with several medium firms to maximize its own profit. We assume that the medium firms' service sets are mutually disjoint and there is no competition among them. The big firm first locates a new hub on a plane as a leader on the condition that the other firms locate their new hubs after that. We formulate the leader's problem as a bilevel programming problem with followers' problem as lower level problems, and solve it using SQP method. Computational results show the significance of the proposed competitive hub location model.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Sasaki Mihiro

  Nanzan University

• Fukushima Masao

  Kyoto University

• Sasaki Mihiro

  Nanzan Univ.

関連論文

• ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
• STACKELBERG HUB LOCATION PROBLEM
• HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
• A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY
• PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A MATHEMATICAL PROGRAMMING APPROACH TO THE MULTI-ROUND TOPOLOGY CONSTRUCTION PROBLEM IN WIRELESS SENSOR NETWORKS
• A MATHEMATICAL PROGRAMMING APPROACH TO THE MULTI-ROUND TOPOLOGY CONSTRUCTION PROBLEM IN WIRELESS SENSOR NETWORKS

スポンサーリンク