A Heuristic for Vehicle Routeing and Depot Staffing
GEORGE A. BOHORIS, Jason Michael Thomas
Abstract
GEORGE A. BOHORIS, Jason Michael Thomas
Abstract
This paper discusses the approach taken in solving a specific depot staffing and routeing problem. The problem differs from the normal routeing 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 routeing 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.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper discusses the approach taken in solving a specific depot staffing and routeing problem. The problem differs from the normal routeing 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 routeing 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.
Key concepts: Staffing, Scheduling (production processes), Purchasing, Operations research, Project management, Depot, Computer science, Heuristic