Jurnal Publikasi STMIK Pontianak

Optimasi Pemilihan Rute Transportasi Dengan Algoritma Simulated Annealing


This paper provides the problem-solving model of the shortest vehicle routing choice optimization, namely Vechile Routing Problem with Time Windows (VRPTW) applying Simulated Annealing (SA) algorithm in the case study of CV. Indo Makmur. SA algorithm has advantages such as giving solution approaching optimum in a short time, being easy in application, and having mechanism that can obviate the trap of local optima. The application design utilizes Object-Oriented Analysis and Design (OOAD) and the application modeling utilizes the use case diagram, sequence diagram and class diagram. The result of this research shows that SA algorithm can solve the problem of VRPTW at CV. Indo Makmur and reach an optimal result, namely the operational cost reduction of product distribution to consumers.

Keywords: distribution, vehicle routing problem with time windows, simulated annealing, object-oriented analysis and design

Jurnal Publikasi STMIK Pontianak By SANDY KOSASI