IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v31y2019i3p287-303.html
   My bibliography  Save this article

Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia

Author

Listed:
  • Elia Oey
  • Alexander B. Marpaung
  • M. Idham Sofyan

Abstract

The study analysed salesmen itinerary of a confectionery supplier in Indonesia. Channel management and robust product distribution are important elements for confectionery business, since growth heavily depends on healthy product distribution. To support product distribution, optimising salesmen itinerary plays an important role in the firm's sales operation. The study was limited to optimising salesmen schedule for its wholesalers' outlet type, since it contributed to 78% of its revenue. The analyses were carried out using 'cluster first-route second' approach. For clustering the customer nodes, it recommended agglomerative hierarchical clustering (AHC) method. For routing within each customer's cluster, it tested two algorithms, i.e., Clarke-Wright and weighted-serving time-visual approach. The result showed that AHC-weighted-serving-time-visual algorithm was as good as AHC-Clarke-Wright with 2.1% cheaper variable cost. The proposed algorithm was adapted from practical insight and easier to be understood.

Suggested Citation

  • Elia Oey & Alexander B. Marpaung & M. Idham Sofyan, 2019. "Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 31(3), pages 287-303.
  • Handle: RePEc:ids:ijisen:v:31:y:2019:i:3:p:287-303
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=98541
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijisen:v:31:y:2019:i:3:p:287-303. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.