2-Way And Dynamic Time Of Traveling Salesman Problem With Simulated Annealing

In this paper we will discuss about delivering goods from manufacture to many of their customer and after finish it must head back to the manufacture. It just another type of Traveling Salesman Problem (TSP). The problem is we need to find the right time to deliver their goods and the right route to minimizing cost. A 2-way compete digraph is a fit model to describe what happen on the street. Dynamic time of traveling is a fit model to describe an estimated time arrives. In the end we used Simulated Annealing to solve the problem for every time of departure.

Baca Lebih Lanjut

Tinggalkan Balasan

Alamat email Anda tidak akan dipublikasikan. Ruas yang wajib ditandai *

This site uses Akismet to reduce spam. Learn how your comment data is processed.