Popular Posts

Friday, March 25, 2011

Chunyu's Resume

Chunyu Tian
979-422-2046; tcalex@tamu.edu
1700 Southwest Pkwy Apt 138, College Station, TX 77840
Qualifications

  •      Advanced knowledge in building linear, integer, non-linear programming models.
  •      Familiar with ILOG CPLEX and programming language Java, Matlab, C/C++.
  •      Skills in using ArcGIS for vehicle routing and warehousing.
  •      Experience in algorithms including Column Generation and Lagrangian Relaxation.
  •     Skills in Oracle SQL and MSAccess.
  •     Ability to use SAS to conduct time series forecasting and statistical analysis. 
  •     Experience in simulation software WITNESS and SIMMOD.

Relevant Experience
Thesis Title  
Taxi Planning of George Bush International Airport (IAH) Using a MILP Method

  •  Analyzed the taxi time data using linear regression analysis and forecasted the future air traffic in SAS.
  •  Proposed a Mixed Integer Programming model to solve the taxi planning problem at IAH.
  •  Programmed and solved the model using C++ and ILOG CPLEX.
  •  Adopted a rolling horizon method and reduced the taxi time significantly.
Texas Transportation Institute, Texas A&M University                                       09/09-09/10
 G.R.A
Project 1:

  • Formulated a mixed integer linear programming model to decide the  optimal production rate, to choose the best suppliers for each raw material and to find out the best amount transported to each store.
  • Solved the model using AMPL and CPLEX.
  • Developed a one-month production and market plan with deterministic market demand.
  • Studied the effect of changing demand on the optimal solutions.
Project 2:

  • Proposed a model for warehousing with information of market demand, transportation mode, labor cost and customer service.
  • Implemented the model using ArcGIS and roadway information of Texas pulling from Bureau of Transportation statistics.
  • Identified the optimal number, location and size of warehouse.
China Shipping Container Lines, Shanghai, China                                                07/08 -10/08
 Intern

  •  Forecasted the market demand using the data of first half year of 2008 and helped updating the database.
  • Assisted designing optimal transportation routes for hazardous materials using simulation software WITNESS.
  • Worked as the leader of a small team and obtained organization skills.
  • Improved the routes successfully and increased the profits by 10% in East Asian Area.
Education
Texas A&M University, College Station, Texas                                                  Grad 12/11
Master of Science in Transportation Engineering, GPA: 4.0/4.0
Relative Courses: Engineering Optimization, Probability Engineering Decisions,
                           Linear Programming, Non-linear and dynamic programming.
Shanghai Jiao Tong University (SJTU), Shanghai, China,                                   07/09
Bachelor of Logistics, GPA: 3.8/4.3(Rank1/27)
Courses:C++, Probability and Statistics, Logistics Management, Time Series and  
             Forecasting, Linear Algebra, Software Engineering. 
Awards
  • OOCL Scholarship (Top 5%, Corporate-funded)                                            09/08
  • National Scholarship (Highest in China, Top 5%)                                             09/07
  • “Three Merits” Student of SJTU (Top5%)                                                       09/07

Thesis Show

Taxiway Aircraft Traffic Scheduling Using the George Bush  
          International Airport Data

Objective: The objective is to assign the routes of taxiing with minimum total taxi time for the safety operations.

Model: The airport ground network is denoted as G(V,E). V is a set of vertex, which represents the gates, runway thresholds, runway exits, taxiway intersections. E is a set of edge, which represents the taxiways and edges connecting the vertexes. Given the origin node and destination node of the departure and arrival aircraft, the problem is to assign optimal routes for taxiing with minimum total taxi time. A Mixed Integer Linear Programming (MILP) model is used.


              
                                                  Figure 1: Taxi Planning Network

Constraints: (1) Minimum Separation Constraints.(2) Time Window Constraints.(3) Speed Limit   
                      Constraints. (4)Constraints to avoid overtaking and head-on-head collision.(5) Runway   
                      Separations constraints.
                  
                                Figure 2: Head-on-head Movement
              
                                      Figure 3: Overtaking Movement


Life in the United States and China


Life in the United States (Aug 2009-Present):

I started my study in Texas A&M University since Aug 2009. Life was not easy at first because everything is different from China. However, I got used to the life here very fast. I really enjoy travelling. I went to New York City, Boston, Washington D.C., Philadelphia, Atlanta, Orlando. Some of the pictures are shown below.


Universal Studio in Orlando(Dec 2010)



Universal Studio in Orlando with my friends(Dec 2010)



Harvard University in Boston(Dec 2009)


Washington D.C. (Dec 2009)

Life in China: