๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A network model for gate assignment

โœ Scribed by Shangyao Yan; Chia-Ming Chang

Publisher
Institute for Transportation Inc.
Year
1998
Tongue
English
Weight
647 KB
Volume
32
Category
Article
ISSN
0197-6729

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this research we developed a network model that will help the airport authorities assign flights to gates both efficiently and effectively. The model was formulated as a multi-commodity network flow problem. An algorithm based on the Lagrangian relaxation, with subgradient methods, accompanied by a shortest path algorithm and a Lagrangian heuristic was developed to solve the problem. The model was tested using data from Chiang Chiek-Shek Airport.

๐Ÿ“œ SIMILAR VOLUMES

Network modeling by linear assignment
Network modeling by linear assignment
โœ Jean H.P. Paelinck ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 246 KB
A channel assignment problem for optical
A channel assignment problem for optical networks modelled by Cayley graphs
โœ Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

A problem arising from a recent study of scalability of optical networks seeks to assign channels to the vertices of a network so that vertices distance 2 apart receive distinct channels. In this paper we introduce a general channel assignment scheme for Cayley graphs on abelian groups, and derive u

A composite traffic flow modeling approa
A composite traffic flow modeling approach for incident-responsive network traffic assignment
โœ Jiuh-Biing Sheu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 273 KB

This paper presents a hybrid traffic simulation-based model to address the network traffic route choice issue under conditions of lane-blocking incidents on surface streets. The proposed approach includes four sequential mechanisms: (1) link flow loading, (2) link traffic moving, (3) link cost calcu