Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications

Antonio Polimeni () and Antonino Vitetta ()
Additional contact information
Antonio Polimeni: Università degli Studi di Reggio Calabria, DIMET
Antonino Vitetta: Università degli Studi di Reggio Calabria, DIMET

Journal of Optimization Theory and Applications, 2013, vol. 156, issue 3, No 14, 805-818

Abstract: 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.

Keywords: Time-dependent networks; Continuous link cost functions; Dynamic approach; Path design (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-012-0121-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:156:y:2013:i:3:d:10.1007_s10957-012-0121-7

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-012-0121-7

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().