Time dependency in multiple objective dynamic programming
From MaRDI portal
Publication:2367667
DOI10.1006/jmaa.1993.1067zbMath0805.90113OpenAlexW2017598274MaRDI QIDQ2367667
Malgorzata M. Wiecek, Michael M. Kostreva
Publication date: 18 August 1993
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1993.1067
nondominated pathsbackward dynamic programmingpath planning in networkstime dependent multiple criteria routing
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)
Related Items (19)
A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set ⋮ Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks ⋮ Uncertain programming models for multi-objective shortest path problem with uncertain parameters ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Discrete dynamic programming with outcomes in random variable structures ⋮ Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach ⋮ Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ A survey of recent developments in multiobjective optimization ⋮ Routing with nonlinear multiattribute cost functions ⋮ Dynamic journeying under uncertainty ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ A constructive algorithm for max-min paths problems on energy networks ⋮ How to find good night train connections ⋮ Optimal building evacuation time considering evacuation routes ⋮ A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
This page was built for publication: Time dependency in multiple objective dynamic programming
