Penentuan Solusi Laso dari Traveling Salesman Problem with Pick-up and Delivery dengan Metode Heuristik

Abstract

Goods and service distributions are essential in a company or institution. The optimization of goods distribution problems can be solved mathematically by using TSP formulation. This paper discusses one of TSP variations. It is a TSPPD with pick-up and delivery demand considering as the most important problem. Pure TSP has property that a vehicle can not visit each post more than once. Meanwhile the TSPPD can visit each post more than once, therefore all constraints can be fulfilled. The TSPPD solution forms a lasso consisting a loop which is large enough, spoke, junction, and depot at the end. This solution is named as lasso solution. The aim of this work is to determine lasso solution from traveling salesman problem with pick-up and delivery on heuristic method and then to implement the model for the problem of shipping and picking up refilling bottles.