Clustering-based heuristic for the workload balancing problem in enterprise logistics

Workload balancing between drivers in transshipment of goods is a critical humanitarian issue in enterprise logistics management. This problem is modelled as a multiple Travelling Salesman Problem with Workload Balancing (mTWB). The problem is addressed under the condition that the load for all the drivers must be balanced on a trip. We propose a clustering-based heuristic to solve the mTWB with the objective of balancing the workload amongst drivers. The methodology is tested over a range of benchmark data sets and is found to give satisfactory results with high convergence in reasonable time.

[1]  A M Feyer,et al.  Balancing work and rest to combat driver fatigue: an investigation of two-up driving in Australia. , 1997, Accident; analysis and prevention.

[2]  Helena Ramalhinho-Lourenço,et al.  A Multi-Objective Model For A Multi-Period Distribution Management Problem , 2001 .

[3]  L R Hartley,et al.  Hours of work, and perceptions of fatigue among truck drivers. , 1997, Accident; analysis and prevention.

[4]  Paul H. Calamai,et al.  A multi-objective optimization approach to urban school bus routing: Formulation and solution method , 1995 .

[5]  C. Okonjo-Adigwe.  An effective method of balancing the workload amongst salesmen , 1988 .

[6]  M. Mourgaya,et al.  Column generation based heuristic for tactical planning in multi-period vehicle routing , 2007, Eur. J. Oper. Res..

[7]  Tzong-Ru Lee,et al.  A study of vehicle routing problems with load‐balancing , 1999 .

[8]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[9]  T. T. Narendran,et al.  CLOSE: a heuristic to solve a precedence-constrained travelling salesman problem with delivery and pickup , 2005 .

[10]  Nicolas Jozefowiez,et al.  An evolutionary algorithm for the vehicle routing problem with route balancing , 2009, Eur. J. Oper. Res..

[11]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[12]  Angappa Gunasekaran,et al.  Efficient mechanism development for multirobot coordination , 2008 .

[13]  Nikos A. Vlassis,et al.  The global k-means clustering algorithm , 2003, Pattern Recognit..

[14]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[15]  Beatrice M. Ombuki-Berman,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[16]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[17]  Nishanth Chandran,et al.  A clustering approach to solve the multiple travelling salesmen problem , 2006 .