Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Durillo, J.J., Nebro, A.J.: jMetal: A Java framework for multi-objective optimization. Advances in Engineering Software 42, 760–771 (2011)
Clark, A.R., Walker, H.: Nurse rescheduling with shift preferences and minimal disruption. Journal of Applied Operational Research 3(3), 148–162 (2011)
Moz, M., Pato, M.V.: A genetic algorithm approach to a nurse rerostering problem. Computers and Operations Research 34(3), 667–691 (2007)
Maenhout, B., Vanhoucke, M.: An evolutionary approach for the nurse rerostering problem. Computers and Operations Research 38(10), 1400–1411 (2011)
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)
Alba, A., Chicano, J.F.: Software project management with GAs. Information Sciences 177, 2380–2401 (2007)
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)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Massachusetts (1989)
Mitchell, M.: Introduction to genetic algorithms. MIT Press, Massachusetts (1999)
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)
Gonc̨alves, J.F., Mendes, J.J.M., Resende, M.G.C.: A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research 189(3), 1171–1190 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Younas, I., Kamrani, F., Moradi, F., Ayani, R., Schubert, J., Håkansson, A. (2013). Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms. In: Tan, G., Yeo, G.K., Turner, S.J., Teo, Y.M. (eds) AsiaSim 2013. AsiaSim 2013. Communications in Computer and Information Science, vol 402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45037-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-45037-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45036-5
Online ISBN: 978-3-642-45037-2
eBook Packages: Computer ScienceComputer Science (R0)