A Heuristic for Vehicle Routing and Manpower Planning

  • George A. Bohoris
  • Jane M. Thomas
Part of the Applied Optimization book series (APOP, volume 16)


This paper discusses the approach taken in solving a specific depot staffing and routing problem. The problem differs from the normal routing exercise in that the route passes through a number of outlets where monetary collections are made. Owing to the ever increasing risks of carrying money there is a requirement for the money to be deposited at banks along the route. Consequently the more traditional routing and scheduling methodologies and software are not easily applied to the problem. This paper details the approach used and highlights some of the good points and the pitfalls in the proposed solution.


Staffing Level Vehicle Routing Bank Region Depot Area Rout Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. Chan, M. Levnajic, M. Newmarch, N. Peters, and P. Simonsson, 1991, Developing a Methodology for Determining the Staffing Levels at BLMS Depots, Case Study, School of Manufacturing and Mechanical Engineering, University of Birmingham, Birmingham, UK.Google Scholar
  2. [2]
    M. Desrochers, J. Desrosers, and M. Solomon, 1992, A new optimisation algorithm for the vehicle routing problem with time windows, Operations Research, 40, 342–354.CrossRefGoogle Scholar
  3. [3]
    J. Desrosers, M. Sauve, and F. Soumis, 1988, Lagrangian relaxation methods for solving the minimum fleet size multiple travelling salesman problem with time windows, Management Science, 34, 1005–1022.CrossRefGoogle Scholar
  4. [4]
    Y. Dumas, J. Desrosers, and F. Soumis, 1991, The pickup and delivery problem with time windows, European Journal of Operational Research, 54, 7–22.CrossRefGoogle Scholar
  5. [5]
    B. Golden and C. Skiscim, 1986, Using simulated annealing to solve routing and location problems, Naval Research Logistics, 33, 261–279.CrossRefGoogle Scholar
  6. [6]
    S. K. Jacobsen and O. Madsen, 1980, A comparative study of heuristics for a two-level routing location problem, European Journal of Operational Research, 5, 378–387.CrossRefGoogle Scholar
  7. [7]
    M. Mistry and D. Livingstone, 1990, Bass Leisure Machines Depot Staffing Levels, M.Sc. Dissertation Thesis, School of Manufacturing and Mechanical Engineering, University of Birmingham, Birmingham, UK.Google Scholar
  8. [8]
    M. Solomon, 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, 35, 264265.Google Scholar
  9. [9]
    H. A. Taha, 1987, Operational Research, Macmillan Publishing Company, New York.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • George A. Bohoris
    • 1
  • Jane M. Thomas
    • 2
  1. 1.School of Industrial Management University of PireausPireausGreece
  2. 2.Ashbey-de-la-Zouch LeicestershireUK

Personalised recommendations