Adapting PALS to solve VRP with Time Windows
In this article, we present a search technique based on metaheuristics for approximately solving the vehicle routing problem with time windows (VRPTW). The Problem Aware Local Search (PALS) is the metaheuristic selected, which proves to be a powerful technique for solving the DNA Fragment Assembly P...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/164874 |
| Aporte de: |
| Sumario: | In this article, we present a search technique based on metaheuristics for approximately solving the vehicle routing problem with time windows (VRPTW). The Problem Aware Local Search (PALS) is the metaheuristic selected, which proves to be a powerful technique for solving the DNA Fragment Assembly Problem. PALS performs a trajectory in the search space by improving a single solution using a specific move operator. A detailed description of the algorithmic design points and the operators for the VRPTW are carried out.
Furthermore, preliminary results are shown and analyzed. |
|---|