A Lagarangian-based heuristic method for scheduling transportation network was proposed. The proposed algorithm could practically support the operators in defining the actual schedules by heuristically solving the transfer coordination problem. The transfer coordination problem consists in defining a timetable trying to guarantee the coordination among runs on different lines at the connecting stops. The solution procedure schedules a single line at a time, possibly correcting the previous decisions at each step.
Scheduling Multimodal Transportation System for Commuters
PESENTI, Raffaele;
2004-01-01
Abstract
A Lagarangian-based heuristic method for scheduling transportation network was proposed. The proposed algorithm could practically support the operators in defining the actual schedules by heuristically solving the transfer coordination problem. The transfer coordination problem consists in defining a timetable trying to guarantee the coordination among runs on different lines at the connecting stops. The solution procedure schedules a single line at a time, possibly correcting the previous decisions at each step.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ejor1551.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Accesso chiuso-personale
Dimensione
309.57 kB
Formato
Adobe PDF
|
309.57 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
