Sequential Competitive Airline Network Design under Duopolistic Market

碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 94 === This study addresses the network design problem under duopolistic airline market. Two airlines are assumed to enter the market or make decision sequentially. The leader, who makes the first move in the market, has no information on the competitor. The follower...

Full description

Bibliographic Details
Main Authors: Wan Tien, O, 歐婉恬
Other Authors: Ta-Hui, Yang
Format: Others
Language:zh-TW
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/77088501292156438497
id ndltd-TW-094NCYU5425009
record_format oai_dc
spelling ndltd-TW-094NCYU54250092015-10-13T16:31:56Z http://ndltd.ncl.edu.tw/handle/77088501292156438497 Sequential Competitive Airline Network Design under Duopolistic Market 業者循序進入雙占競爭市場之航空網路規劃 Wan Tien, O 歐婉恬 碩士 國立嘉義大學 運輸與物流工程研究所 94 This study addresses the network design problem under duopolistic airline market. Two airlines are assumed to enter the market or make decision sequentially. The leader, who makes the first move in the market, has no information on the competitor. The follower, who makes the decision later, has to design the network subject to the existing leader’s network. A two stage model is proposed to describe the behavior of the competitive market. The first stage is used to formulate the leader’s decision and the second stage is to describe the follower’s problem. The leader’s model is a mixed integer linear problem (MIP) and the follower’s model is a mixed integer nonlinear problem (MINLP). Due to the absence of effective solution algorithm in MINLP, a heuristic was proposed to solve the follower’s problem. The commercial package GAMS in conjunction with its different solvers was used to solve the problems. Finally, a real network based on Taiwan and Mainland China airline market was used to test the performance of the proposed model. Ta-Hui, Yang 楊大輝 2004 學位論文 ; thesis 123 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 94 === This study addresses the network design problem under duopolistic airline market. Two airlines are assumed to enter the market or make decision sequentially. The leader, who makes the first move in the market, has no information on the competitor. The follower, who makes the decision later, has to design the network subject to the existing leader’s network. A two stage model is proposed to describe the behavior of the competitive market. The first stage is used to formulate the leader’s decision and the second stage is to describe the follower’s problem. The leader’s model is a mixed integer linear problem (MIP) and the follower’s model is a mixed integer nonlinear problem (MINLP). Due to the absence of effective solution algorithm in MINLP, a heuristic was proposed to solve the follower’s problem. The commercial package GAMS in conjunction with its different solvers was used to solve the problems. Finally, a real network based on Taiwan and Mainland China airline market was used to test the performance of the proposed model.
author2 Ta-Hui, Yang
author_facet Ta-Hui, Yang
Wan Tien, O
歐婉恬
author Wan Tien, O
歐婉恬
spellingShingle Wan Tien, O
歐婉恬
Sequential Competitive Airline Network Design under Duopolistic Market
author_sort Wan Tien, O
title Sequential Competitive Airline Network Design under Duopolistic Market
title_short Sequential Competitive Airline Network Design under Duopolistic Market
title_full Sequential Competitive Airline Network Design under Duopolistic Market
title_fullStr Sequential Competitive Airline Network Design under Duopolistic Market
title_full_unstemmed Sequential Competitive Airline Network Design under Duopolistic Market
title_sort sequential competitive airline network design under duopolistic market
publishDate 2004
url http://ndltd.ncl.edu.tw/handle/77088501292156438497
work_keys_str_mv AT wantieno sequentialcompetitiveairlinenetworkdesignunderduopolisticmarket
AT ōuwǎntián sequentialcompetitiveairlinenetworkdesignunderduopolisticmarket
AT wantieno yèzhěxúnxùjìnrùshuāngzhànjìngzhēngshìchǎngzhīhángkōngwǎnglùguīhuà
AT ōuwǎntián yèzhěxúnxùjìnrùshuāngzhànjìngzhēngshìchǎngzhīhángkōngwǎnglùguīhuà
_version_ 1717772168948875264