Sapti Wahyuningsih, Darmawan Satyananda, Dahliatul Hasanah
Problems of distributing goods from one or more depots to customers generally become substantial problems for many companies or factories. Those distribution problems have been modeled using TSP (Transportation Salesman Problem) or VRP (Vehicle Routing Problem) and its variants. The refinement of the variants is intended to have the fittest models for real life problems concerning distribution problems. In this paper, variants of TSP and VRP are implemented using Delphi programming language. The methods of TSP used in this paper are sequential insertion heuristic, nearest neighbor heuristic, and cheapest link. The TSP variants which are implemented are multiple TSP (mTSP), and TSP with Time Window (TSPTW). On the other hand, VRP variants used are CVRP, MDVRP, MTVRP, VRPTW, MFVRP, VRPSDP and the method for each variant is the sequential insertion. The application program obtained is tested with the data from TSPLIB, a library of sample instances for the TSP and related problems from various sources and of various types. We also provide some examples on distribution problems. © Research India Publications.
Mathematics Department, FMIPA, Universitas Negeri Malang, Jl. Semarang 5, Malang, 65145, Indonesia
