Computing Pareto-optimal transit routes through mathematical algorithms

DOI10.1007/978-3-319-89920-6_62MaRDI QIDQ4685792zbMATH OpenOpenAlexFDO

Authors M. Fawad Zazai, Armin Fügenschuh

Publication date 9 October 2018

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-89920-6_62

zbMATH Keywords

Afghanistancomputational geometryDijkstra's algorithmgraph theoryshortest path problemtransit routes

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Programming involving graphs or networks (90C35)

Recommendations

• Computing the trajectories for the development of optimal routes
• Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized
• Computational aspects of the optimal transit path problem
• Routing with nonlinear multiattribute cost functions
• scientific article; zbMATH DE number 1848402

Cites work

• A note on two problems in connexion with graphs
• Multicriteria Optimization

Cited in

(5)

• Editorial. OPTE special issue on technical operations research (TOR)
• Computing the trajectories for the development of optimal routes
• scientific article; zbMATH DE number 3896662 (Why is no real title available?)
• Efficient algorithms to find optimal paths in a public transportation network
• Computational aspects of the optimal transit path problem

This page was built for publication: Computing Pareto-optimal transit routes through mathematical algorithms

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