A computational study of solution approaches for the resource constrained elementary shortest path problem

DOI10.1007/s10479-012-1162-xzbMath1260.90042DBLPjournals/anor/PuglieseG12OpenAlexW2027119735WikidataQ58921212 ScholiaQ58921212MaRDI QIDQ1945074

Luigi Di Puglia Pugliese, Francesca Guerriero

Publication date: 2 April 2013

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

Full work available at URL: https://doi.org/10.1007/s10479-012-1162-x

zbMATH Keywords

dynamic programmingresource constraintselementary shortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Efficient elementary and restricted non-elementary route pricing ⋮ A rollout algorithm for the resource constrained elementary shortest path problem ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ On the shortest path problem with negative cost cycles ⋮ A survey of resource constrained shortest path problems: Exact solution approaches

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Solving k-shortest and constrained shortest path problems efficiently
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A reoptimization algorithm for the shortest path problem with time windows
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Shortest paths algorithms: Theory and experimental evaluation
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Resource extension functions: properties, inversion, and generalization to segments
• The shortest route problem with constraints
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Flight String Models for Aircraft Fleeting and Routing
• Plus court chemin avec contraintes d'horaires
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Shortest chain subject to side constraints
• 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
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

This page was built for publication: A computational study of solution approaches for the resource constrained elementary shortest path problem