Resource constrained shortest path problems in path planning for fleet management

DOI10.1023/B:JMMA.0000026675.50719.CEMaRDI QIDQ1876595zbMATH OpenOpenAlexFDO

Authors Pasquale Avella, Maurizio Boccia, Antonio Sforza

Publication date 20 August 2004

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:jmma.0000026675.50719.ce

zbMATH Keywords

fleet managementpath planningresource constrained shortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 1670670
• An algorithm for the resource constrained shortest path problem
• Solving resource constrained shortest path problems with LP-based methods
• A penalty function heuristic for the resource constrained shortest path problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Cited in

(8)

• A shortest-path algorithm for solving the fleet management problem in underground mines
• A penalty function heuristic for the resource constrained shortest path problem
• An exact reduction technique for the k-colour shortest path problem
• Resource extension functions: properties, inversion, and generalization to segments
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
• Solving resource constrained shortest path problems with LP-based methods
• Vehicle Routing Problems with Inter-Tour Resource Constraints
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm

This page was built for publication: Resource constrained shortest path problems in path planning for fleet management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876595)