Advertisement

Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms

  • Irfan Younas
  • Farzad Kamrani
  • Farshad Moradi
  • Rassul Ayani
  • Johan Schubert
  • Anne Håkansson
Part of the Communications in Computer and Information Science book series (CCIS, volume 402)

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.

Keywords

Battalion rescheduling Multi-objective optimization Genetic algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Durillo, J.J., Nebro, A.J.: jMetal: A Java framework for multi-objective optimization. Advances in Engineering Software 42, 760–771 (2011)CrossRefGoogle Scholar
  3. 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
  4. 4.
    Moz, M., Pato, M.V.: A genetic algorithm approach to a nurse rerostering problem. Computers and Operations Research 34(3), 667–691 (2007)CrossRefzbMATHGoogle Scholar
  5. 5.
    Maenhout, B., Vanhoucke, M.: An evolutionary approach for the nurse rerostering problem. Computers and Operations Research 38(10), 1400–1411 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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
  7. 7.
    Alba, A., Chicano, J.F.: Software project management with GAs. Information Sciences 177, 2380–2401 (2007)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Massachusetts (1989)zbMATHGoogle Scholar
  10. 10.
    Mitchell, M.: Introduction to genetic algorithms. MIT Press, Massachusetts (1999)Google Scholar
  11. 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
  12. 12.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Irfan Younas
    • 1
  • Farzad Kamrani
    • 2
  • Farshad Moradi
    • 2
  • Rassul Ayani
    • 1
  • Johan Schubert
    • 2
  • Anne Håkansson
    • 1
  1. 1.KTH Royal Institute of TechnologyStockholmSweden
  2. 2.Swedish Defence Research AgencyStockholmSweden

Personalised recommendations