Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms
2013 (English)In: Asiasim 2013: 13th International Conference on Systems Simulation. Proceedings, Singapore, November 6-8, 2013., Springer Berlin/Heidelberg, 2013, 93-104 p.Conference paper (Refereed)
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 difference 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 result of rescheduling when unpredictable activities emerge.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 93-104 p.
, Communications in Computer and Information Science, ISSN 1865-0929 ; 402
Battalion rescheduling, Multi-objective optimization, Genetic algorithms
Computer Science Computer Science
IdentifiersURN: urn:nbn:se:kth:diva-139366DOI: 10.1007/978-3-642-45037-2_9ScopusID: 2-s2.0-84893870796ISBN: 978-3-642-45036-5OAI: oai:DiVA.org:kth-139366DiVA: diva2:685981
13th International Conference on Systems Simulation. Singapore, November 6-8, 2013
QC 201401282014-01-102014-01-102014-03-28Bibliographically approved