6
Views
18
CrossRef citations to date
0
Altmetric
Theoretical Paper

Fixed Routes

Pages 49-55 | Published online: 20 Dec 2017
 

Abstract

In this paper we consider the fixed routes problem, which is the problem of designing routes for delivery vehicles that can be operated unchanged for a given period of time. We show how standard vehicle routing algorithms can be adapted to deal with the daily version of this problem. Computational results are presented for these adapted algorithms for a number of test problems drawn from the literature.

View correction statement:
Erratum: Fixed Routes

An erratum to this article is available at http://dx.doi.org/10.1057/jors.1984.59.

An erratum to this article is available at http://dx.doi.org/10.1057/jors.1984.59.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.