Abstract
Eight problems of a practical staff scheduling application from logistics are used to compare the effectiveness and efficiency of two fundamentally different solution approaches. One can be called centralized and is based on search in the solution space with an adapted metaheuristic, namely particle swarm optimization (PSO). The second approach is decentralized. Artificial agents negotiate to construct a staff schedule. Both approaches significantly outperform todays manual planning. PSO delivers the best overall results in terms of solution quality and is the method of choice, when CPU-time is not limited. The agent approach is vastly quicker in finding solutions of almost the same quality as PSO. The results suggest that agents could be an interesting method for real-time scheduling or re-scheduling tasks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ATOSS Software AG, FH Heidelberg (eds.): Standort Deutschland 2006. Zukunftssicherung durch intelligentes Personalmanagement. München (2006)
Brodersen, O.: Eignung schwarmintelligenter Verfahren für die betriebliche Ent-scheidungsunterstützung. Cuvillier, Göttingen (2008)
Chu, S.C., Chen, Y.T., Ho, J.H.: Timetable Scheduling Using Particle Swarm Optimization. In: Proc. of ICICIC 2006, vol. 3, pp. 324–327 (2006)
De Causemaecker, P., Ouelhadj, D., Vanden Berghe, G.: Agents in Timetabling Problems. In: Proc. of MISTA 2003, pp. 67–71 (2003)
Ernst, A.T., et al.: An Annotated Bibliography of Personnel Scheduling and Rostering. In: Annals of OR, vol. 127, pp. 21–144 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability. In: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Günther, M., Nissen, V.: A Comparison of Neighbourhood Topologies for Staff Scheduling With Particle Swarm Optimisation. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009. LNCS (LNAI), vol. 5803, pp. 185–192. Springer, Heidelberg (2009)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. of IEEE Int. Conf. on Neural Networks,, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Kaufmann, San Francisco (2001)
Kragelund, L., Kabel, T.: Employee Timetabling. An Empirical Study. Master’s Thesis, Dep. of Computer Science, Univ. of Aarhus (1998)
Krempels, K.H.: Lösen von Scheduling-Konflikten durch Verhandlungen zwischen Agenten. In: Sauer, J. (ed.) Proc. of PuK 2002, pp. 86–89 (2002)
Nissen, V., Günther, M.: Staff Scheduling with Particle Swarm Optimization and Evolution Strategies. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 228–239. Springer, Heidelberg (2009)
Poli, R.: An Analysis of Publications on Particle Swarm Optimization. Report CSM-469, Dep. of Computer Science, Univ. of Essex (2007)
Proudfoot Consulting: Produktivitätsbericht 2007. Company Report (2007)
Puppe, F., Klügl, F., Herrler, R., Kirn, S., Heine, C.: Konzeption einer flexiblen Agentenkomponente für Schedulingaufgaben im Krankenhausumfeld. In: Proc. of 2. Kolloquium Intelligente Softwareagenten und betriebswirtschaftliche Anwendungsszenarien (2000)
Sub-Daily Staff Scheduling Data Sets and Benchmarks, http://www.tu-ilmenau.de/fakww/2608+M54099f70862.0.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Günther, M., Nissen, V. (2010). Particle Swarm Optimization and an Agent-Based Algorithm for a Problem of Staff Scheduling. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12242-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-12242-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12241-5
Online ISBN: 978-3-642-12242-2
eBook Packages: Computer ScienceComputer Science (R0)