Name
Abstract | ||
|---|---|---|
Although in the literature several Air Transportation Networks have been modeled through the mathematical framework of Complex Networks, less attention has been devoted to their evolution: specifically, topology is studied as static, excluding any schedule information. Simulating the growth of an air network is not an easy task, due to the great amount and heterogeneity of agents interacting (aircrafts, controllers and more). In this work we use a recently developed tool, called Scheduled Network, to define an algorithm to simulate such a growth; the basic assumption is that the cost for passengers should be minimized, which is approximated with the time needed to go from one airport to another one. Some results are presented, and the role and importance of hubs (that is, central airports where great part of the flights are concentrated) is discussed. |
Year | Venue | Keywords |
|---|---|---|
2009 | 23RD EUROPEAN CONFERENCE ON MODELLING AND SIMULATION (ECMS 2009) | LT: Discrete Event Modelling and Simulation in Logistics, Transport and Supply Chains |
Field | DocType | Citations |
Adjacency matrix,Graph theory,Topology,Computer science,Matrix (mathematics),Scheduling (computing),Square matrix,Network topology,Complex network,Identity matrix | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Massimiliano Zanin | 1 | 514 | 32.55 |
| Lucas Lacasa | 2 | 16 | 6.12 |
| Miguel Cea | 3 | 0 | 0.34 |
| Samuel Cristobal | 4 | 0 | 0.68 |