In this paper, the relationship between waiting at nodes and the path cost in a transport network is analysed. An exact solution algorithm for generating the shortest path with optimal waiting at the nodes is proposed. The general case is examined, considering a time-dependent network (time influences the cost). To develop a full application, the algorithm is applied in the case of a vehicle routing problem on a real network. © 2012 Springer Science+Business Media, LLC.
Polimeni, A., Vitetta, A. (2013). Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 156(3), 805-818 [10.1007/s10957-012-0121-7].
Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications
Polimeni A.
;
2013-01-01
Abstract
In this paper, the relationship between waiting at nodes and the path cost in a transport network is analysed. An exact solution algorithm for generating the shortest path with optimal waiting at the nodes is proposed. The general case is examined, considering a time-dependent network (time influences the cost). To develop a full application, the algorithm is applied in the case of a vehicle routing problem on a real network. © 2012 Springer Science+Business Media, LLC.| File | Dimensione | Formato | |
|---|---|---|---|
|
Optimising Waiting at Nodes in Time Dependent Networks Cost Functions and Applications.pdf
solo utenti autorizzati
Licenza:
Copyright dell'editore
Dimensione
626.56 kB
Formato
Adobe PDF
|
626.56 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
