Vehicle routing using fixed delivery areas

Kf Wong and John Beasley

Omega, 1984, vol. 12, issue 6, 591-600

Abstract: In this paper we consider the problem of vehicle routing using fixed delivery areas. This is the problem of splitting the area serviced by a depot into a number of separate subareas--a single delivery vehicle being assigned to each subarea to supply all the customers within the subarea. A heuristic algorithm is developed for the problem based upon an initial allocation of customers to subareas followed by customer interchanges in an attempt to improve the subareas. Computational results are presented for a number of test problems drawn from the literature.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(84)90062-8
Full text for ScienceDirect subscribers only

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:eee:jomega:v:12:y:1984:i:6:p:591-600

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().