Actions

User

Huang yan: Difference between revisions

From Santa Fe Institute Events Wiki

No edit summary
 
No edit summary
 
Line 1: Line 1:
I am Huang Yan, a master candidate at School of Software, Tsinghua University.
I am Huang Yan, a master candidate at School of Software, Tsinghua University.
My research field is in logistics including real-time fleet assignment and routing network in the air transport industry. My current research focus is on the fleet assignment problem (FAP). The FAP is to find the cost-minimizing assignment of aircraft types to flight legs in the flight network. The objective is to flow commodities, i.e. aircraft types, through the network feasibly and with minimum cost. The FAP is a complex system because it concerns various kinds of constraints, including cover constraints and work-rule restrictions. In my research, I mainly focus on two aspects of the complex system. The first aspect is how to obtain a sound solution approach. Indeed, The FAP is a context that perfectly suited to the use of large-scale, discrete optimization approaches. So I am working on developing a neighborhood search algorithm and thus solve this problem to near-optimality within reasonable computational time. The second aspect is how to adjust the fleet assignment plan according to the changing demand on each flight. This is a very realistic problem because the actual number of people who take flights is keeping on changing until 24 hours before an aircraft’s departure time.

Latest revision as of 09:18, 24 March 2006

I am Huang Yan, a master candidate at School of Software, Tsinghua University.

My research field is in logistics including real-time fleet assignment and routing network in the air transport industry. My current research focus is on the fleet assignment problem (FAP). The FAP is to find the cost-minimizing assignment of aircraft types to flight legs in the flight network. The objective is to flow commodities, i.e. aircraft types, through the network feasibly and with minimum cost. The FAP is a complex system because it concerns various kinds of constraints, including cover constraints and work-rule restrictions. In my research, I mainly focus on two aspects of the complex system. The first aspect is how to obtain a sound solution approach. Indeed, The FAP is a context that perfectly suited to the use of large-scale, discrete optimization approaches. So I am working on developing a neighborhood search algorithm and thus solve this problem to near-optimality within reasonable computational time. The second aspect is how to adjust the fleet assignment plan according to the changing demand on each flight. This is a very realistic problem because the actual number of people who take flights is keeping on changing until 24 hours before an aircraft’s departure time.