My Statement of Purpose_2_ Request for help Second part: In my master’s thesis, I’m mainly working on the Tactical to Strategic Level Crew Planning and Balancing Workloads in Turkish State Railways. We moved forward from tactical level and considered a more flexible structure in our transportation network to propose some managerial insights. The problem is to determine the allocation and the level of minimum sufficient crew resources level coherently. Generally, we can approach to the problem from two sides, heuristics approach and exact approach. For the former, I designed a neighborhood search heuristic in order to search effectively and efficiently in the neighboring solutions. Currently I’m implementing the algorithm (in C++). For the exact approach, we formulated the problem as a network flow problem. I implemented the mathematical formulation using Cplex Concert Technology (in C++) and plan to submit the paper in a few months to a reputable journal. In operational level crew planning, we worked on balancing problem in Turkish State Railways. Again, both exact algorithm and several heuristics were designed. We presented the result of my thesis in some conferences. Moreover, we are planning to submit our balancing paper to INFORMS Journal on Computing. In addition to my thesis, I took part in different research works. There, I gained lots of experiences, besides their technical benefits, such as independent research abilities, teamwork and efficient resource investigation. Among those works, I should emphasize on some of them. I worked on Dynamic Networks with one of my friends and published a paper in Journal of Mathematical Modelling and Algorithms. We dealt with minimum cost flow problem on dynamic network flows with zero transit times and a new arc capacity, horizon capacity. We develop a simple approach based on mathematical modeling attributes to solve the problem. Moreover, I am working on a paper about Dynamic P-median Problem with Prof. X. We proposed a new formulation and two different heuristic algorithms to find facility locations to satisfy dynamic demands over a time in a network. Some of the existing heuristic algorithms such as genetic algorithm and tabu search algorithm can be easily used to solve the new problem. However, our new heuristic algorithms use the special structure of the new problem and some existing heuristic methods as a subroutine.