| dc.description.abstract | This research is discussed about routing problem for gallon distribution. This problem is categorized as complex problem. It is caused by several factors such as different level of demand, a simultaneous activities in one visit, and the large number of demand point. Besides routing problem is also known as NP-Hard problem, so it needs to be solved by metaheuristics. The object used as the research focus is PT. Mitrajaya Pasopati (MJP). The distribution routes in MJP is still determined based on intuition. This results delays in deliveries, large total travel distance, and results in high overall transportation costs.
Therefore, the aim of this research is to find a better route solution by implementing the Vehicle Routing Problem with Simultaneous Pick-Up Delivery (VRPSPD) model. This model was chosen because it has a characteristic which the activity of delivery and pick up products simultaneously in one visit. In addition, the Tabu search metaheuristic method is used to find the best solution. This method was chosen because it can produce a solution by avoiding being trapped in the optimal locale. Beside, Tabu search method is used to find the best optimal solution. This method was chosen because it can produce optimal solution by avoiding trapped in local-optimal solution. Experimental results show that the proposed method is more efficient than the intuitive one, by decreasing the total travel distance by 6,09%. | en_US |
