Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms
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 algorith...
| Main Authors: | , |
|---|---|
| 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 |