Pengembangan Algoritma Ant Colony System Pada Heterogeneous Vehicle Routing Problem with Soft Time Window

Every enterprise commonly has distribution and transportation system to support the delivery of goods to customers. An effective and efficient distribution system is needed so that the costs of transportation can be minimized. This research is aimed to develop the Ant Colony System (ACS) algorithm for the Heterogeneous Vehicle Routing Problem with Soft Time Window (HVRPSTW) mathematical model in determining transportation routes that can minimize costs at PT XYZ. HVRPSTW is VRP which considers various vehicles and time window with a penalty fee charged if the vehicle arrives outside the specified time. One of the methods used to solve VRP problems is the metaheuristic ACS. ACS method is implemented to find the best vehicle route in accordance with predetermined constraints. The initial stages in ACS is to discover an initial solution as initial solution using the Nearest Neighbour method. The routing process in ACS begins with the tour construction stage then continue with updating the pheromone. The solution to the problem will be generated by Python. The results showed that the total distance generated using the ACS method is 1448,98 km and total cost is IDR 3.582.367,86, where the difference with previous research using the exact method is 6,68 km (0,45%) and IDR 42.248,86 (1,19%).