Railway security personnel scheduling problem considering personnel preferences

This study discusses the shift scheduling problem of security personnel, considering personnel preferences for 43 stations on four lines of the Ankara metro, which carries more than 10 million passengers monthly. Firstly, 751 security personnel have been distributed to four lines of the Ankara metro according to personnel needs. A survey is conducted among the personnel at the stations on each line, and they are asked to rank the stations they want to work at according to their preferences. The station preferences of the personnel are listed with increasing scoring in parallel with the order of preference. A goal programming model has been used to assign personnel to stations, considering personnel needs, operating rules, and personnel preference scoring at the stations. The main objective of the model is to minimize the personnel-preferred station scoring. As a result of the solution of the mathematical model solved separately for four lines, 24.23% of the personnel for the M1 (K & imath;z & imath;lay-Bat & imath;kent) line, 27.94% of the personnel for the M2 (K & imath;z & imath;lay-Koru) line, 23.32% of the personnel for the M3 (Bat & imath;kent-Sincan) line, and 35.85% of the personnel for the M4 (Ke & ccedil;i & ouml;ren-& Scedil;ehitler) line, are assigned to their first three preferences. Moreover, an important balance is achieved between personnel preferences. Few studies are in the literature on railway security personnel scheduling, and no studies that consider personnel preferences have been found in this field. This study, which considers personnel preferences, contributes to the literature.