Time dependency in multiple objective dynamic programming
The paper presents a theoretical and algorithmic development for the problem of path planning in networks including multiple time dependent costs on the links. The goal is to compute all nondominated paths in an efficient computational procedure. A general network, not assumed to be acyclic is considered. It consists of a (finite) set of nodes and a (finite) set of links. Each link carries one or more attributes. The cost functions are assumed to be positive vector-valued functions of time and are not assumed to be continuous. The study contains theoretical results and two algorithms solving time dependent multiple criteria routing problems. The first applies backward dynamic programming and solves the routing problem generating all nondominated paths which lead from every node in the network to the destination node. The second is an adoption of forward dynamic programming and solves the routing problem for the set of feasible paths from the origin node to all other nodes in the network. The relationship between the forward and backward case is explored. Numerical examples that apply the two introduced algorithms are also included.
- scientific article; zbMATH DE number 1858040
- Some multiple objective dynamic programs
- scientific article; zbMATH DE number 853731
- Multitime dynamic programming for multiple integral actions
- Time–cost trade-off in a multi-choice assignment problem
- scientific article; zbMATH DE number 6003201
- Dynamic programming multi-objective combinatorial optimization
- Determining time-dependent minimum cost paths under several objectives
- scientific article; zbMATH DE number 3963589
- scientific article; zbMATH DE number 1086957
- Optimal building evacuation time considering evacuation routes
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Uncertain programming models for multi-objective shortest path problem with uncertain parameters
- Dynamic journeying under uncertainty
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- Dynamic programming and minimum risk paths
- Algorithms for time-dependent bicriteria shortest path problems
- A survey of recent developments in multiobjective optimization
- The role of time in multi-component efficiency analysis: an application
- A constructive algorithm for max-min paths problems on energy networks
- On computing Pareto optimal paths in weighted time-dependent networks
- Time dependent multiobjective best path for multimodal urban routing
- How to find good night train connections
- scientific article; zbMATH DE number 4174360 (Why is no real title available?)
- Minimum weight paths in time-dependent networks
- A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
- scientific article; zbMATH DE number 1858040 (Why is no real title available?)
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- scientific article; zbMATH DE number 7312765 (Why is no real title available?)
- A critical survey on the network optimization algorithms for evacuation planning problems
- Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- A time-dependent multiple criteria single-machine scheduling problem
- Multitime dynamic programming for multiple integral actions
- Routing with nonlinear multiattribute cost functions
- Discrete dynamic programming with outcomes in random variable structures
- Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic c-games on networks
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
This page was built for publication: Time dependency in multiple objective dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367667)
