A Constructive Algorithm for the Split Delivery Vehicle Routing Problem (SDVRP)
Keywords: heuristic, problem, vehicle routing problem, Split Delivery Vehicle Routing, Representation Problem
Abstract
Vehicle routing is a classic of operations research. The objective is to contribute with heuristic knowledge emphasizing the complexity of the divided delivery vehicle problem. A homogeneous vehicle fleet is considered, where the demand of all clients must be covered, being able to visit clients more than once. The preliminary results are encouraging because they allow the identification of several lines of research regarding implementing practical solutions for last-mile logistics problems. Furthermore, when comparing the response times of the heuristics (0.043Â s.) with the LocalSolver application (1Â s and 5Â s), managing to solve large instances, constantly navigating in the space of feasible solutions.
Más información
| Título según WOS: | A Constructive Algorithm for the Split Delivery Vehicle Routing Problem (SDVRP) |
| Título según SCOPUS: | A Constructive Algorithm for the Split Delivery Vehicle Routing Problem (SDVRP) |
| Título de la Revista: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volumen: | 13956 |
| Editorial: | Springer Science and Business Media Deutschland GmbH |
| Fecha de publicación: | 2023 |
| Página de inicio: | 245 |
| Página final: | 259 |
| Idioma: | English |
| DOI: |
10.1007/978-3-031-36805-9_17 |
| Notas: | ISI, SCOPUS |