PROPOSED SOLUTION IN THREE-DIMENSIONAL LOADING CAPACITED VEHICLE ROUTING PROBLEM USING TABU SEARCH AND GREEDY ALGORITHM

• Main Author: Syauqi Mirza Fakhri, A.
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/43211
• Institution: Institut Teknologi Bandung

PT X is one of the mattress manufacturers that serves 638 consumers spread across Bandung with a total of 114 product variants. Operational deliveries are made in total of 9 available replacement trucks consisting of three types of products. PT X encounter the low utilization truck usage in delivery. In addition, there is opportunity for savings in the total transportation costs. This happens because of routing planning, truck selection and product placement arrangements in the tailgate only based on workers intuition. PT X need a method for routing planning, truck selection and product placement arrangements to minimize the total transportation costs. This study will discuss solving three-dimensional loading capacited vehicle routing problem to minimize the total transportation costs (3L-VRP). A solution search algorithm was developed to answer the 3L-VRP problem by using a hybrid algorithm between tabu search and the greedy algorithm. A mathematical model was developed to answer the problem, but the computational time required is long so it is inefficient. The developed algorithm can produce a proposed route solution, selected truck and product placement configuration. The output of the algorithm results can reduce transportation costs by an average of 36.95% compared to existing conditions. The use of the number of trucks for the selected route was reduced by an average 2 units, the total distance of the trip was reduced by an average of 36.95% and the utilization of the truck bed for the selected route increased by 47,44% compared to current conditions.