Combinatorial analysis for route first-cluster second vehicle routing

Rh Mole, Dg Johnson and K Wells

Omega, 1983, vol. 11, issue 5, 507-512

Abstract: Two Route first-cluster second vehicle routing algorithms are contrasted in the first section of the paper. Next, the 'large' number of feasible solutions to a multiple travelling salesman problem is established given that each salesman can visit any number of customers in a stated range. An approximate expression is given for the 'small' fraction of this solution space searched by a route first-cluster second vehicle routing heuristic. Nevertheless, this heuristic is seen to be a very efficient means of searching its solution space.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(83)90043-9
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:11:y:1983:i:5:p:507-512

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 ().