Iterated local search algorithm for the vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls and soft time windows contains two disjoint sets of customers: those that receive goods from the depot, who are called linehauls, and those that send goods to the depot, named backhauls. To each customer is associated an interval of time (time window), duri...
| Autor principal: | |
|---|---|
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.5/15983 |
| País: | Portugal |
| Oai: | oai:www.repository.utl.pt:10400.5/15983 |