Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
In this article, we present heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches. These methods are constructed in a way that takes some basic driver requirements into consideration as well. We show the efficiency...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2013
|
| Sorozat: | Acta cybernetica
21 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.21.1.2013.5 |
| Online Access: | http://acta.bibl.u-szeged.hu/30849 |
| Tartalmi kivonat: | In this article, we present heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches. These methods are constructed in a way that takes some basic driver requirements into consideration as well. We show the efficiency of the methods on real-life and random data instances too. We also give an improved way of generating random input for the vehicle scheduling problem. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 53-73 |
| ISSN: | 0324-721X |