Please use this identifier to cite or link to this item:
Title: Efficiency improvement for multi depot vehicle routing: A case study in cash distribution
Authors: Boonsam, Prat 
Suthikarnnarunai, Nanthi 
Rattanawong, Wanchai 
Keywords: Assignment problem with time window;Group sweep algorithm;Multi depot vehicle routing problem
Issue Date: 2013
Publisher: Scopus
University of the Thai Chamber of Commerce
Source: Prat Boonsam, Nanthi Suthikarnnarunai, Wanchai Rattanawong (2013) Efficiency improvement for multi depot vehicle routing: A case study in cash distribution. Applied Mechanics and Materials, 3667-3674.
Abstract: This research is aimed at increasing efficiency of cash distribution from three distribution centers delivered to 377 branches, and 3,699 automatic teller machines by using Cluster First Route Second technique. New concept of assignment problem with time window is presented in this paper for clustering. A Group Sweep Algorithm which is modified from a traditional Sweep Algorithm combined with a nearest neighbor search is also presented as the routing methodology. Application software has developedusing PHP and MySQL. AMPL with CPLEX 10.0 is used to solve the assignment problem and is perfectly embraced underneath the developed application software to allow the user friendly experience. The software allow the flexibility in changing various parameters such as, capacity proportion of each cash distribution center, speed of vehicle, service time at each branch or ATM,time window of each branch or ATM or distribution center, etc. The result shows that 11 vehicle can be reduced resulting in cost reduction in a total amount of US$195,097 annually.
Rights: This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Appears in Collections:RSO: Journal Articles

Files in This Item:
File Description SizeFormat 
81.pdf128.31 kBAdobe PDFThumbnail
Show full item record Recommend this item

Page view(s)

checked on Jul 11, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.