Route Determination for Capacitated Vehicle Routing Problem with Two Different Hybrid Heuristic Algorithm

Authors : Erhan BARAN

Pages : 41-46

View : 40 | Download : 14

Publication Date : 2018-06-30

Article Type : Research Paper

Abstract :In today`s competitive environment, time is very important. Companies that use time effectively always outperform others. Each area has specific methods to use the time effectively. In delivering the goods, it is possible to use the time effectively by carrying out the shipment with appropriate route and vehicle. Proper routing is the most important step of a consignment. In this study, routes were determined for the capacity vehicle locating problems. The tour developers in the literature are compared to each other by making applications for the main ones of the heuristic methods. Comparisons of two different hybrid solution methods have been made. First, the initial solution was developed with the KTA Algorithm, a new algorithm developed in recent years for the determination of routes, and then the route was developed with Van Breedam heuristic methods. In the other hybrid solution, an initial solution was first created with the saving algorithm and a solution was developed using the Kinderwater-Savelsbergh method. Finally, comparison of these two hybrid methods has been done to determine which is more effective in this type of problem.
Keywords : Capacitated Vehicle Routing, Kinderwater Savelsbergh Heuristic, KTA Algorithm, Van Breedam Heuristic, Saving Algorithm

ORIGINAL ARTICLE URL