A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet
In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on max...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Springer
2017-01-01
|
| Ráidu: | Journal of King Saud University: Engineering Sciences |
| Fáttát: | |
| Liŋkkat: | http://www.sciencedirect.com/science/article/pii/S1018363914000348 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|