Um algoritmo híbrido para os problemas de roteamento de veículos estático e dinâmico com janela de tempo
=== 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 objective of the problem is to plan routes for vehicles, with no violated constraints, minimizing costs. The costs normally are...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | Portuguese |
| Published: |
Universidade Federal de Minas Gerais
2005
|
| Online Access: | http://hdl.handle.net/1843/RVMR-6EAKH8 |