IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v11y1983i5p507-512.html
   My bibliography  Save this article

Combinatorial analysis for route first-cluster second vehicle routing

Author

Listed:
  • Mole, RH
  • Johnson, DG
  • Wells, K

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.

Suggested Citation

  • Mole, RH & Johnson, DG & Wells, K, 1983. "Combinatorial analysis for route first-cluster second vehicle routing," Omega, Elsevier, vol. 11(5), pages 507-512.
    • Handle: RePEc:eee:jomega:v:11:y:1983:i:5:p:507-512
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(83)90043-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
    2. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:11:y:1983:i:5:p:507-512. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.