Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms
In this paper, we consider the problem of rescheduling human resources in a battalion where new activities are assigned to the battalion by higher headquarters, requiring modification of an existing original schedule. The problem is modeled as a multi-criteria optimization problem with three objectives: (i) maximizing the number of tasks that are performed, (ii) minimizing the number of high-priority tasks that are missed, and (iii) minimizing the differences between the original schedule and the modified one. In order to solve the optimization model, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The accuracy of NSGA-II in this context is verified by considering a small-sized problem where it is easy to verify solutions. Furthermore, we consider a realistic problem instance for a battalion with 400 agents and 66 tasks in the initial schedule. We present the computational results of rescheduling when unpredictable activities emerge.
KeywordsBattalion rescheduling Multi-objective optimization Genetic algorithms
Unable to display preview. Download preview PDF.
- 3.Clark, A.R., Walker, H.: Nurse rescheduling with shift preferences and minimal disruption. Journal of Applied Operational Research 3(3), 148–162 (2011)Google Scholar
- 6.Chicano, F., Luna, F., Nebro, A.J., Alba, E.: Using multi-objective metaheuristics to solve the software project scheduling problem. In: GECCO, pp. 1915–1922. ACM (2011)Google Scholar
- 8.Hao, X., Lin, L.: Job shop rescheduling by using multi-objective genetic algorithm. In: 40th International Conference on Computers and Industrial Engineering (CIE), pp. 1–6. IEEE (2010)Google Scholar
- 10.Mitchell, M.: Introduction to genetic algorithms. MIT Press, Massachusetts (1999)Google Scholar
- 11.Younas, I., Kamrani, F., Schulte, C., Ayani, R.: Optimization of Task Assignment to Collaborating Agents. In: IEEE Symposium on Computational Intelligence in Scheduling, pp. 17–24. IEEE (2011)Google Scholar