Multi-objective and multi-constrained non-additive shortest path problems

DOI10.1016/J.COR.2010.08.003zbMath1201.90035DBLPjournals/cor/ReinhardtP11OpenAlexW2052586037WikidataQ58826381 ScholiaQ58826381MaRDI QIDQ609807

David Pisinger, Line Blander Reinhardt

Publication date: 1 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/multiobjective-and-multiconstrained-nonadditive-shortest-path-problems(efd38f72-5cfc-4b14-a453-4f7937744755).html

zbMATH Keywords

dynamic programmingshortest path problemmulti objective programmingnon-additive objective

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (12)

Finding reliable shortest paths in road networks under uncertainty ⋮ Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ On an exact method for the constrained shortest path problem ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Liner Shipping Cargo Allocation with Repositioning of Empty Containers ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ Non-additive shortest path in the context of traffic assignment ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem ⋮ The multiple shortest path problem with path deconfliction

Cites Work

• The shortest path problem with forbidden paths
• On a multicriteria shortest path problem
• Generalized dynamic programming for multicriteria optimization
• Extended dominance and a stochastic shortest path problem
• An empirical investigation of some bicriterion shortest path algorithms
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A label correcting approach for solving bicriterion shortest-path problems
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
• Algorithms – ESA 2004
• Shortest Path Problems with Resource Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multi-objective and multi-constrained non-additive shortest path problems