A guided local search based algorithm for the multiobjective empowerment-based field workforce scheduling

Empowerment-based workforce scheduling is a new approach that involves employees in the decision making. It enables employees to suggest their own preferences in the schedule. Employee involvement in this approach is modelled by adding to the employer's objective an additional objective that represents the overall employees' satisfaction rate. Thus, the scheduling problem becomes a biobjective optimization problem, where the task is to maximize both organizational objective(s) and employees' satisfaction level. In this paper, this problem is approached by a Pareto based local search metaheuristic, Guided Pareto Local Search (GPLS) which is an extension to the guided local search to contain multiobjective scenarios. Computational experiments show the effectiveness of GPLS, compared to a standard Pareto local search and a single-objective optimizer.

[1]  Peter I. Cowling,et al.  The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling , 2006, EvoCOP.

[2]  Qguhm -DVNLHZLF,et al.  On the performance of multiple objective genetic local search on the 0 / 1 knapsack problem . A comparative experiment , 2000 .

[3]  Gilbert Owusu,et al.  Service Chain Management: Technology Innovation for the Service Business , 2010 .

[4]  Gilbert Owusu,et al.  Service Chain Management , 2008 .

[5]  Torsten Fahle,et al.  A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem , 2006, Comput. Oper. Res..

[6]  Evripidis Bampis,et al.  A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem , 2004, Metaheuristics for Multiobjective Optimisation.

[7]  R. S. Hambleton The Prospect Award 1981: A Manpower Planning Model for Mobile Repairmen , 1982 .

[8]  Gilbert Owusu,et al.  Distributed resource allocation via local choices: A case study of workforce allocation , 2005, Int. J. Knowl. Based Intell. Eng. Syst..

[9]  Elise Miller-Hooks,et al.  Scheduling technicians for planned maintenance of geographically distributed equipment , 2007 .

[10]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[11]  Abdullah Alsheddy,et al.  Guided Pareto Local Search and its Application to the 0/1 Multi-objective Knapsack Problems , 2009 .

[12]  Nazaraf Shah,et al.  On the partitioning of dynamic scheduling problems -: assigning technicians to areas , 2008, GECCO '08.

[13]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[14]  Edward P. K. Tsang,et al.  Fast local search and guided local search and their application to British Telecom's workforce scheduling problem , 1997, Oper. Res. Lett..

[15]  Thomas Stützle,et al.  Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study , 2004, Metaheuristics for Multiobjective Optimisation.

[16]  Edward P. K. Tsang,et al.  Guided Pareto Local Search based frameworks for biobjective optimization , 2010, IEEE Congress on Evolutionary Computation.

[17]  Abdullah Alsheddy,et al.  Emp owerment-based Workforce Scheduling Problem , 2009 .