![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Abstract
The basic vehicle routing problem is concerned with the design of a set of routes to serve a given number of customers, minimising the total distance travelled. In that problem, each vehicle is assumed to be used only once during a planning period, which is typically a day, and therefore is unrepresentative of many practical situations, where a vehicle makes several journeys during a day. The present authors have previously published an algorithm which outperformed an experienced load planner working on the complex, real-life problems of Burton's Biscuits, where vehicles make more than one trip each day. This present paper uses a simplified version of that general algorithm, in order to compare it with a recently published heuristic specially designed for the theoretical multi-trip vehicle routing problem.
Keywords:
An Erratum for this chapter can be found at http://dx.doi.org/10.1057/palgrave.jors.2600667
An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2600667.
An Erratum for this chapter can be found at http://dx.doi.org/10.1057/palgrave.jors.2600667
An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2600667.