2 Citations (Scopus)

Abstract

To analyze intercity multimodal transportation choices, an aviation network design model was developed to consider all transportation modes relative to daily airport capacity under different demand conditions in the determination of route availability and frequency. The factors in the model include the travel time of various modes (ground access time included), operating cost of various modes, travel demand, airport capacity, and aircraft-type restrictions for each route. A network flow problem with side constraints was formulated. To solve this problem efficiently, a heuristic algorithm was developed by incorporating Lagrangian relaxation, the shortest-path algorithm, and the subgradient method. The performance of this algorithm was compared with the exact solution for a network of five metropolitan area centers. The results show that the gap between these two is only 1.28%. In addition, a case study of a real network was conducted. This network differed from the exact solution by 0.274%. The study verifies that the flight frequency for each route and the passenger route choices, which were obtained with the heuristic algorithm, are feasible and reasonable. Thus, the model and the heuristic algorithm could be applied to real situations and provide insight for restructuring an aviation network.

Original languageEnglish
Pages (from-to)34-41
Number of pages8
JournalTransportation Research Record
Issue number1888
DOIs
Publication statusPublished - 2004 Jan 1

Fingerprint

Heuristic algorithms
Aviation
Airports
Multimodal transportation
Travel time
Operating costs
Aircraft
Availability

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Mechanical Engineering

Cite this

@article{3a1cec18d5504d07a5b8182d85cd8cfd,
title = "Aviation network design in Taiwan",
abstract = "To analyze intercity multimodal transportation choices, an aviation network design model was developed to consider all transportation modes relative to daily airport capacity under different demand conditions in the determination of route availability and frequency. The factors in the model include the travel time of various modes (ground access time included), operating cost of various modes, travel demand, airport capacity, and aircraft-type restrictions for each route. A network flow problem with side constraints was formulated. To solve this problem efficiently, a heuristic algorithm was developed by incorporating Lagrangian relaxation, the shortest-path algorithm, and the subgradient method. The performance of this algorithm was compared with the exact solution for a network of five metropolitan area centers. The results show that the gap between these two is only 1.28{\%}. In addition, a case study of a real network was conducted. This network differed from the exact solution by 0.274{\%}. The study verifies that the flight frequency for each route and the passenger route choices, which were obtained with the heuristic algorithm, are feasible and reasonable. Thus, the model and the heuristic algorithm could be applied to real situations and provide insight for restructuring an aviation network.",
author = "Dai, {Melody D.M.} and Lin, {Cheng Chang} and Liou, {Jong Shyang}",
year = "2004",
month = "1",
day = "1",
doi = "10.3141/1888-05",
language = "English",
pages = "34--41",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "1888",

}

Aviation network design in Taiwan. / Dai, Melody D.M.; Lin, Cheng Chang; Liou, Jong Shyang.

In: Transportation Research Record, No. 1888, 01.01.2004, p. 34-41.

Research output: Contribution to journalReview article

TY - JOUR

T1 - Aviation network design in Taiwan

AU - Dai, Melody D.M.

AU - Lin, Cheng Chang

AU - Liou, Jong Shyang

PY - 2004/1/1

Y1 - 2004/1/1

N2 - To analyze intercity multimodal transportation choices, an aviation network design model was developed to consider all transportation modes relative to daily airport capacity under different demand conditions in the determination of route availability and frequency. The factors in the model include the travel time of various modes (ground access time included), operating cost of various modes, travel demand, airport capacity, and aircraft-type restrictions for each route. A network flow problem with side constraints was formulated. To solve this problem efficiently, a heuristic algorithm was developed by incorporating Lagrangian relaxation, the shortest-path algorithm, and the subgradient method. The performance of this algorithm was compared with the exact solution for a network of five metropolitan area centers. The results show that the gap between these two is only 1.28%. In addition, a case study of a real network was conducted. This network differed from the exact solution by 0.274%. The study verifies that the flight frequency for each route and the passenger route choices, which were obtained with the heuristic algorithm, are feasible and reasonable. Thus, the model and the heuristic algorithm could be applied to real situations and provide insight for restructuring an aviation network.

AB - To analyze intercity multimodal transportation choices, an aviation network design model was developed to consider all transportation modes relative to daily airport capacity under different demand conditions in the determination of route availability and frequency. The factors in the model include the travel time of various modes (ground access time included), operating cost of various modes, travel demand, airport capacity, and aircraft-type restrictions for each route. A network flow problem with side constraints was formulated. To solve this problem efficiently, a heuristic algorithm was developed by incorporating Lagrangian relaxation, the shortest-path algorithm, and the subgradient method. The performance of this algorithm was compared with the exact solution for a network of five metropolitan area centers. The results show that the gap between these two is only 1.28%. In addition, a case study of a real network was conducted. This network differed from the exact solution by 0.274%. The study verifies that the flight frequency for each route and the passenger route choices, which were obtained with the heuristic algorithm, are feasible and reasonable. Thus, the model and the heuristic algorithm could be applied to real situations and provide insight for restructuring an aviation network.

UR - http://www.scopus.com/inward/record.url?scp=12344288215&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12344288215&partnerID=8YFLogxK

U2 - 10.3141/1888-05

DO - 10.3141/1888-05

M3 - Review article

AN - SCOPUS:12344288215

SP - 34

EP - 41

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 1888

ER -