การลดต้นทุนการขนส่งโดยการประยุกต์ใช้ปัญหาการจัดเส้นทางการเดินรถ: กรณีศึกษา บริษัทจำหน่ายอุปกรณ์ประดับยนต์
Keywords:
vehicle routing, nearest neighbor algorithm, saving algorithms, traveling salesman problemAbstract
Nowadays several businesses face with the capital cost, especially transportation cost. The main cost are material procurement, production, product selling and distribution. Also, transportation cost also affects the total cost of product and service. This research aimed to study the solution for reducing the transportation cost, mainly need to reduce the petrol cost, a part of transportation cost and determine the definite quantity of products for a car accessory company in Surin province, who distributes products to customers located around Thailand. Researchers applied 2 heuristics methods, the first is nearest neighbor heuristics and other is saving algorithm which improved delivery network using traveling salesman problem model (TSP model) and used solver function in Excel to find the optimal delivery network. The results showed that transportation cost from the saving algorithm with TSP model was 21,099.70 Baht but using the nearest neighbor heuristics, the transportation cost was 20,647.38 Baht. Therefore, solution for routing the vehicle should be the results from the nearest neighbor heuristics
Downloads
Published
Issue
Section
License
*Copyright
The article has been published in Kasem Bundit Engineering Journal (KBEJ) is the copyright of the Kasem Bundit University. Do not bring all of the messages or republished except permission from the university.
* Responsibility
If the article is published as an article that infringes the copyright or has the wrong content the author of article must be responsible.