Skip to main content
Log in

The multi-trip vehicle routing problem

  • Paper
  • Published:
Journal of the Operational Research Society

An Erratum to this article was published on 01 November 1998

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J C S Brandão.

Additional information

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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandão, J., Mercer, A. The multi-trip vehicle routing problem. J Oper Res Soc 49, 799–805 (1998). https://doi.org/10.1057/palgrave.jors.2600595

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2600595

Keywords

Navigation