AN IMPROVED SIMULATED ANNEALING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)

• DOI: 10.28961/kursor.v9i3.178
• Publication Date: 2019-02-28T08:56:25Z
• Authors: Farhanna Mari; Wayan Firdaus Mah...; Purnomo Budi Santoso
• Keywords: Vehicle Routing Problem

In the industrial sector, in order to increase company's competitive profit and ratio, must be able suppress as much expenditure possible. Product distribution is one of logistics processes industry which consumes most costs. Products distributed customers different locations also with varying requests. The problem belongs Capacitated Vehicle Routing Problem (CVRP) that considered complex combinatorial optimization problems included NP-Hard category, a requires difficult computation lot time along increasing size data. So, this study improvisation will carried out form modifying simulated annealing method solve so optimal distance case obtained. addition, comparison made between basic improved annealing. Based on results research it proven Improved Simulated Annealing can provide better solution.