A Hybrid Algorithm for the Vehicle Routing Problem with Window
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2004
|
| Assuntos: | |
| Texto completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87 |
| País: | Brasil |
| Oai: | oai:infocomp.dcc.ufla.br:article/87 |