Point-to-point shortest paths on dynamic time-dependent road networks

DOI10.1007/s10288-010-0121-0zbMath1201.90033OpenAlexW2101556618MaRDI QIDQ607878

Giacomo Nannicini

Publication date: 6 December 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0121-0

zbMATH Keywords

integer programmingshortest pathstime-dependent graphs

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (2)

Decremental algorithm for adaptive routing incorporating traveler information ⋮ A recipe for finding good solutions to MINLPs

Uses Software

• Bonmin
• FEASPUMP
• AlphaECP

Cites Work

• A note on two problems in connexion with graphs
• Local branching
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Engineering Route Planning Algorithms
• Variable neighborhood search: Principles and applications

This page was built for publication: Point-to-point shortest paths on dynamic time-dependent road networks