Algorithms for time-dependent bicriteria shortest path problems

DOI10.1016/j.disopt.2006.05.006zbMath1149.90165OpenAlexW2020257725MaRDI QIDQ2465939

Horst W. Hamacher, Stevanus A. Tjandra, Stefan Ruzika

Publication date: 11 January 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.05.006

zbMATH Keywords

label setting algorithmmultiple criteria optimizationbicriteria shortest path problemtime-dependent shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Dynamic journeying under uncertainty ⋮ Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
• A finite-time algorithm for shortest path problems with time-varying costs
• An empirical investigation of some bicriterion shortest path algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Time dependency in multiple objective dynamic programming
• The shortest route through a network with time-dependent internodal transit times
• On a routing problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Continuous-Time Shortest Path Problems and Linear Programming
• Dynamic shortest paths minimizing travel times and costs
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• A network flow approach to a city emergency evacuation planning
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Algorithms for time-dependent bicriteria shortest path problems