Algorithms for time-dependent bicriteria shortest path problems
From MaRDI portal
Recommendations
- An empirical investigation of some bicriterion shortest path algorithms
- Shortest paths in piecewise continuous time-dependent networks
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- A parametric approach to solving bicriterion shortest path problems
- Time dependency in multiple objective dynamic programming
Cites work
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 53116 (Why is no real title available?)
- scientific article; zbMATH DE number 1488066 (Why is no real title available?)
- A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
- A finite-time algorithm for shortest path problems with time-varying costs
- A network flow approach to a city emergency evacuation planning
- An Appraisal of Some Shortest-Path Algorithms
- An empirical investigation of some bicriterion shortest path algorithms
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Continuous-Time Shortest Path Problems and Linear Programming
- Dynamic shortest paths minimizing travel times and costs
- Minimum weight paths in time-dependent networks
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- On a multicriteria shortest path problem
- On a routing problem
- Shortest paths in networks with vector weights
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The shortest route through a network with time-dependent internodal transit times
- Time dependency in multiple objective dynamic programming
Cited in
(18)- An empirical investigation of some bicriterion shortest path algorithms
- Bicriterion shortest paths in stochastic time-dependent networks
- A parametric approach to solving bicriterion shortest path problems
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
- An exact algorithm for the bi-objective timing problem
- A genetic algorithms to solve the bicriteria shortest path problem
- Bicriterion shortest hyperpaths in random time-dependent networks
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- Bi-directional search for robust routes in time-dependent bi-criteria road networks
- A critical survey on the network optimization algorithms for evacuation planning problems
- Dynamic journeying under uncertainty
- scientific article; zbMATH DE number 1858040 (Why is no real title available?)
- Non-additive shortest path in the context of traffic assignment
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- An exact method for the biobjective shortest path problem for large-scale road networks
This page was built for publication: Algorithms for time-dependent bicriteria shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465939)
