The multi-trip vehicle routing problem

J C S Brandão () and A Mercer
Additional contact information
J C S Brandão: Universidade do Minho
A Mercer: Lancaster University

Journal of the Operational Research Society, 1998, vol. 49, issue 8, 799-805

Abstract: 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: vehicle routing; multiple trips; tabu search (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600595 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:49:y:1998:i:8:d:10.1057_palgrave.jors.2600595

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600595

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().