Improved alternative route planning

DOI10.4230/OASICS.ATMOS.2013.108MaRDI QIDQ5397848zbMATH OpenOpenAlexFDO

Authors Andreas Paraskevopoulos, Christos Zaroliagis

Publication date 24 February 2014

Full work available at URL https://inria.hal.science/hal-00871739

zbMATH Keywords

alternative routenon-overlapping pathpenaltyplateaushortest pathstretch factor

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• Alternative Route Graphs in Road Networks
• Alternative routes in road networks
• Candidate sets for alternative routes in road networks
• An alternative approach to alternative routes: HiDAR
• Evolution and evaluation of the penalty method for alternative graphs

Cited in

(11)

• Generating constrained length personalized bicycle tours
• Candidate sets for alternative routes in road networks
• An alternative approach to alternative routes: HiDAR
• Scope-based route planning
• The all-to-all alternative route problem
• scientific article; zbMATH DE number 1870068 (Why is no real title available?)
• Alternative routes in road networks
• Alternative multicriteria routes
• Robust mobile route planning with limited connectivity
• Evolution and evaluation of the penalty method for alternative graphs
• Time-dependent alternative route planning

This page was built for publication: Improved alternative route planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397848)