A Comparative Analysis of Search Algorithms for Solving the Vehicle Routing Problem
The Vehicle Routing Problem (VRP) is an extensively studied optimization challenge in operations research, applicable to logistics, transportation, and supply chain management. Its goal is to find optimal routes for vehicles, minimizing distance and maximizing customer satisfaction. Genetic algorith...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2023
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/87515 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: A Comparative Analysis of Search Algorithms for Solving the Vehicle Routing Problem
- Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem
- Solving Timetable Problem by Genetic Algorithm and Heuristic Search Case Study: Universitas Pelita Harapan Timetable
- A Comparative Study on Meta Heuristic Algorithms for Solving Multilevel Lot-Sizing Problems
- Improvements in Simulated Quenching Method for Vehicle Routing Problem with Time Windows by Using Search History and Devising Means for Reducing the Number of Vehicles
- Hybrid Quantum Tabu Search for Solving the Vehicle Routing Problem
- Dynamic Vehicle Routing Problem for Medical Emergency Management