Please use this identifier to cite or link to this item:
|Title:||Strategic planning for newspaper delivery problem using vehicle routing algorithm with time window (VRPTW)||Authors:||Boonkleaw, A.
|Keywords:||Newspaper distribution problem (ndp);Strategic planning;Sweep algorithm;Vehicle routing problem||Issue Date:||2010||Publisher:||Scopus
University of the Thai Chamber of Commerce
|Source:||A. Boonkleaw, N. Suthikarnnarunai, R. Srinon (2010) Strategic planning for newspaper delivery problem using vehicle routing algorithm with time window (VRPTW). Engineering Letters Vol.18 No.2.||Abstract:||We present a case study on the application of techniques for solving the Vehicle Routing Problem with Time Window (VRPTW) to improve the newspaper distribution service in Bangkok, Thailand. The improvement of the distribution activity is part of the strategic planning of the company which aims to reduce number of staffs and to reduce cost occurred in the distribution process.Empirical results indicate that the heuristic method with some modification of steps and constraints can find relatively good relations. It trends to save cost of distribution up to 5.3% which bring service cost from 23% to 17.70%.||URI:||https://scholar.utcc.ac.th/handle/6626976254/3603||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|
Show full item record Recommend this item
checked on Jul 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.