Please use this identifier to cite or link to this item: https://scholar.utcc.ac.th/handle/6626976254/3501
Title: Cash distribution using skip concept for heuristics vehicle routing methodology
Authors: Suthikarnnarunai, Nanthi 
Boonsam, Prat 
Wattanalertrak, W. 
Engchuan, K. 
Taprab, C. 
Keywords: Cash distribution;Skip nearest neighbor search algorithm;Skip sweep algorithm;Vehicle Routing Problem with Time Window
Issue Date: 2013
Publisher: Scopus
University of the Thai Chamber of Commerce
Source: Nanthi Suthikarnnarunai, Prat Boonsam, W. Wattanalertrak, K. Engchuan, C. Taprab (2013) Cash distribution using skip concept for heuristics vehicle routing methodology. Lecture Notes in Engineering and Computer Science, 1092-1097.
Abstract: This article presents new heuristics concept for solving Vehicle Routing Problem with Time Window. New concept, which is a skip concept, derives from a solution of the traditional sweep and nearest neighbor technique, which gives poor vehicle's utilization. Hence, skip sweepalgorithm and skip nearest neighbor search focus on increasing the vehicle's utilization. The case study of cash distribution has been applied to proof efficiency of the skip concept. New concepts have been resulting inusing the same amount of vehicle as the traditional one. The favorable result is the increasing of the vehicle's utilization. The decreasing of total travel time, which is an unexpected result, has found from the case study. It turns to be a favorable result since it associates to the variable cost of fuel.
URI: https://scholar.utcc.ac.th/handle/6626976254/3501
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 
93.pdf161.26 kBAdobe PDFThumbnail
View/Open
Show full item record Recommend this item

Page view(s)

11
checked on Jul 11, 2019

Google ScholarTM

Check


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