Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms

• Main Authors: Yıldırım, Ümit, Kuvvetli, Yusuf
• Format: Article
• Language: English
• Published: Growing Science 2021-01-01
• Series: International Journal of Industrial Engineering Computations
• Online Access: http://www.growingscience.com/ijiec/Vol12/IJIEC_2021_10.pdf

The vehicle routing problem is widespread in terms of optimization, which is known as being NP-Hard. In this study, the vehicle routing problem with capacity constraints is solved using cost- and time-efficient metaheuristic methods: an invasive weed optimization algorithm, genetic algorithm, savings algorithm, and hybridized variants. These algorithms are tested using known problem sets in the literature. Twenty-four instances evaluate the performance of algorithms from P and five instances from the CMT data set group. The invasive weed algorithm and its hybrid variant with savings and genetic algorithms are used to determine the best methodology regarding time and cost values. The proposed hybrid approach has found optimal P group problem instances with a 2% difference from the best-known solution on average. Similarly, the CMT group problem is solved with about a 10% difference from the best-known solution on average. That the proposed hybrid solutions have a standard deviation of less than 2% on average from BKS indicates that these approaches are consistent.