Algorithms for non-linear and stochastic resource constrained shortest path

DOI10.1007/S00186-018-0649-XzbMath1415.90020arXiv1504.07880OpenAlexW2963104335MaRDI QIDQ2417959

Axel Parmentier

Publication date: 31 May 2019

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07880

zbMATH Keywords

risk measuresstochastic shortest pathresource constrained shortest pathlattice ordered monoid

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (3)

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ A generic exact solver for vehicle routing and related problems

Uses Software

• Kiss FFT
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Finding reliable shortest paths in road networks under uncertainty
• On an exact method for the constrained shortest path problem
• Optimal routing for maximizing the travel time reliability
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A stochastic dynamic traveling salesman problem with hard time windows
• Linear and combinatorial optimization in ordered algebraic structures
• Algebraic structures for transitive closure
• Constructive versions of Tarski's fixed point theorems
• Combining constraint programming and linear programming on an example of bus driver scheduling
• Lattices and ordered algebraic structures
• Solving VRPTWs with constraint programming based column generation
• Graphs, dioids and semirings. New models and algorithms.
• Resource extension functions: properties, inversion, and generalization to segments
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• The shortest route problem with constraints
• Coherent Measures of Risk
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions
• Routing Optimization Under Uncertainty
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Stochastic Shortest Path Problem with Delay Excess Penalty
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Speedup Techniques for the Stochastic on-time Arrival Problem
• Optimal paths in graphs with stochastic or multidimensional weights
• High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems
• Maximal Flow Through a Network
• On a routing problem
• Vehicle routing with soft time windows and Erlang travel times
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• An algorithm for the resource constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• Regular Algebra Applied to Path-finding Problems
• Finding the k Shortest Paths
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• 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
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• The Variance-Constrained Shortest Path Problem
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Robust Adaptive Routing Under Uncertainty
• Precomputation techniques for the stochastic on-time arrival problem
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Algorithms – ESA 2004
• Shortest Path Problems with Resource Constraints
• Shortest Paths in Probabilistic Graphs
• An Algebra for Network Routing Problems
• Constraint programming-based column generation
• Constraint programming based column generation for crew assignment
• A Vehicle Routing Problem with Stochastic Demand

This page was built for publication: Algorithms for non-linear and stochastic resource constrained shortest path