A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting eac...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/16197 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/16197 |