Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem
This chapter presents the best-known heuristics and metaheuristics that are applied to solve the capacitated vehicle routing problem (CVRP), which is the generalization of the TSP, in which the nodes are visited by more than one route. To find out which algorithm obtains better results, there are 30...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2020
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/72140 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem
- An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem
- Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem
- Metaheuristics for vehicle routing problems /
- Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
- Instance space analysis of the capacitated vehicle routing problem
- Hybrid Metaheuristic Vehicle Routing Problem for Security Dispatch Operations