Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms
- 1 January 2021
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 12 (4), 441-456
- https://doi.org/10.5267/j.ijiec.2021.4.002
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- A meta-heuristic for capacitated green vehicle routing problemAnnals of Operations Research, 2017
- Optimization of Binder Jetting Using Taguchi MethodJOM, 2017
- A Discrete Hybrid Invasive Weed Optimization Algorithm for the Capacitated Vehicle Routing ProblemProcedia Computer Science, 2016
- Discrete Invasive Weed Optimization Algorithm for Graph Based Combinatorial Road Network Management ProblemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Using a modified invasive weed optimization algorithm for a personalized urban multi-criteria path optimization problemInternational Journal of Applied Earth Observation and Geoinformation, 2012
- An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problemScienceAsia, 2012
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- A novel numerical optimization algorithm inspired from weed colonizationEcological Informatics, 2006
- Advanced vehicle routing algorithms for complex operations management problemsJournal of Food Engineering, 2005
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999