haku: @indexterm goal programming / yhteensä: 121
viite: 16 / 121
| Tekijä: | Sinclair, M. Oudheusden, D. L. van |
| Otsikko: | A103 (1997) 18-27 in heavily congested cities |
| Lehti: | European Journal of Operational Research
1997 : NOV, VOL. 103:1, p. 18-27 |
| Asiasana: | VEHICLE SCHEDULING NETWORKS GOAL PROGRAMMING MODELS CITIES |
| Kieli: | eng |
| Tiivistelmä: | This paper proposes a minimum cost network flow model to deal with the problem of bus trip scheduling in heavily congested cities. Real instances of scheduling problems are analyzed and solved by means of a particular network formulation, and the producted solutions are at least as good as those generated by known procedures. Very fast solution times, the ease with which the approach can be explained to managment, flexibility, and the possibility of doing sensitivity analysis are the characterisations which make the network approach superior. The technique can be extended to situations more complex than a single bus route. |
SCIMA