Comparative analysis of a metaheuristic based on a genetic algorithm versus a branch & cut method for a pickup and delivery problem with time windows constraints
In an attempt to sovle the combinatorics problems, it is important to evaluate the costbenefit ratio between obtaining solutions of high quality and the loss of the computational resources required. The problem presented is for the routing of a vehicle with pickup and delivery of products with time...
| Autor principal: | |
|---|---|
| Formato: | Artículo |
| Lenguaje: | spa |
| Publicado: |
Facultad de Contaduría Pública y Administración
2004
|
| Materias: | |
| Acceso en línea: | https://revistainnovaciones.uanl.mx/index.php/revin/article/view/16 |