Solving large vehicle routing and scheduling problems in small core

Abstract

In this paper, an efficient implementation of the Clarke and Wright algorithm for solving the single depot vehicle routing and scheduling problem is presented. With this implementation, a 900 customer problem can be solved approximately in less than 9 seconds of CPU time and less than 128K bytes of storage on an IBM 3033 computer.