A Scheduling/Routing Solutionfor a Service Routing Problem

摘要

The motivation for this paper is a service/repair company’s desire to produce efficient and effective routes andrnschedules for their service crews. In particular, the service company maintains vehicles at customer sitesrnthroughout the country. This maintenance is performed by regional servicemen. The objective is to develop arnsimple heuristic which produces a route for each serviceman with the best weighted average score acrossrnmultiple criteria. Objective criteria include lowest cost, number of days to complete the route, fewest nightsrnaway from home, and least amount of overtime hours. Several heuristics are developed and evaluated for 2 ofrnthe company’s servicemen based in Florida.