Efficient distribution of toy products using ant colony optimization algorithm

被引：0

作者：

Hidayat, S. ^{[1
]}

Nurpraja, C. A. ^{[1
]}

机构：

[1] Univ Al Azhar Indonesia, Fac Sci & Technol, Ind Engn, Komplek Masjid Agung Al Azhar, Kebayoran Baru 12110, Jakarta Selatan, Indonesia

来源：

10TH INTERNATIONAL SEMINAR ON INDUSTRIAL ENGINEERING AND MANAGEMENT: SUSTAINABLE DEVELOPMENT IN INDUSTRY AND MANAGEMENT | 2017年 / 277卷

关键词：

Ant Colony Optimization; Vehicle Routing Problem; wooden toys; delivery route;

D O I：

10.1088/1757-899X/277/1/012046

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

CV Atham Toys (CVAT) produces wooden toys and furniture, comprises 13 small and medium industries. CVAT always attempt to deliver customer orders on time but delivery costs are high. This is because of inadequate infrastructure such that delivery routes are long, car maintenance costs are high, while fuel subsidy by the government is still temporary. This study seeks to minimize the cost of product distribution based on the shortest route using one of five Ant Colony Optimization (ACO) algorithms to solve the Vehicle Routing Problem (VRP). This study concludes that the best of the five is the Ant Colony System (ACS) algorithm. The best route in 1st week gave a total distance of 124.11 km at a cost of Rp 66,703.75. The 2nd week route gave a total distance of 132.27 km at a cost of Rp 71,095.13. The 3rd week best route gave a total distance of 122.70 km with a cost of Rp 65,951.25. While the 4th week gave a total distance of 132.27 km at a cost of Rp 74,083.63. Prior to this study there was no effort to calculate these figures.

引用

页数：8