Sub-daily Staff Scheduling for a Logistics Service Provider

The current paper uses a scenario from logistics to show that solution approaches based on metaheuristics, and in particular particle swarm optimization (PSO) can significantly add to the improvement of staff scheduling in practice. Sub-daily planning, which is the focus of our research offers considerable productivity reserves for companies but also creates complex challenges for the planning software. Modifications of the traditional PSO method are required for a successful application to scheduling software. Results are compared to different variants of the evolution strategy (ES). Both metaheuristics significantly outperform manual planning, with PSO delivering the best overall results.

[1]  Günter Rudolph,et al.  An Evolutionary Algorithm for Integer Programming , 1994, PPSN.

[2]  Franz Rothlauf,et al.  Evolution Strategies, Network Random Keys, and the One-Max Tree Problem , 2002, EvoWorkshops.

[3]  Elena Marchiori,et al.  Applications of Evolutionary Computing: Evoworkshops 2003 , 2003 .

[4]  Volker Nissen,et al.  Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies , 2009, EvoCOP.

[5]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[6]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Volker Nissen,et al.  Survivable Network Design with an Evolution Strategy , 2008 .

[9]  Lam Thu Bui,et al.  Success in Evolutionary Computation , 2008 .

[10]  Amnon Meisels,et al.  Modelling and Solving Employee Timetabling Problems , 2003, Annals of Mathematics and Artificial Intelligence.

[11]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[12]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[13]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[14]  Volker Nissen,et al.  Solving the quadratic assignment problem with clues from nature , 1994, IEEE Trans. Neural Networks.

[15]  R. Poli.  An Analysis of Publications on Particle Swarm Optimisation Applications , 2007 .

[16]  Michael Herdy,et al.  Application of the 'Evolutionsstrategie' to Discrete Optimization Problems , 1990, PPSN.

[17]  Greet Vanden Berghe,et al.  An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare , 2002 .

[18]  Kalyan Veeramachaneni,et al.  Optimization Using Particle Swarms with Near Neighbor Interactions , 2003, GECCO.

[19]  Ivo Blöchliger,et al.  Modeling staff scheduling problems. A tutorial , 2004, Eur. J. Oper. Res..

[20]  Mohamed A. El-Sharkawi,et al.  Fundamentals of Particle Swarm Optimization Techniques , 2008 .

[21]  Thomas Bäck,et al.  Mixed-Integer Evolution Strategies and Their Application to Intravascular Ultrasound Image Analysis , 2006, EvoWorkshops.

[22]  Shu-Chuan Chu,et al.  Timetable Scheduling Using Particle Swarm Optimization , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[23]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[24]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[25]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .

[26]  Kalyan Veeramachaneni,et al.  Probabilistically Driven Particle Swarms for Optimization of Multi Valued Discrete Problems : Design and Analysis , 2007, 2007 IEEE Swarm Intelligence Symposium.