Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia
by Elia Oey; Alexander B. Marpaung; M. Idham Sofyan
International Journal of Industrial and Systems Engineering (IJISE), Vol. 31, No. 3, 2019

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.

Online publication date: Tue, 26-Mar-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com