A penalty function heuristic for the resource constrained shortest path problem

DOI10.1016/S0377-2217(02)00262-XzbMath1082.90572OpenAlexW2017597147MaRDI QIDQ1848355

Aantonio Sforza, Maurizio Boccia, Pasquale Avella

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00262-x

zbMATH Keywords

Constrained shortest pathPenalty function heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ A simulated annealing for multi-criteria network path problems ⋮ Maximum probability shortest path problem ⋮ A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems ⋮ A second-order cone programming approach for linear programs with joint probabilistic constraints ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Two engineering applications of a constrained shortest-path model
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• The shortest route problem with constraints
• Algorithms for finding paths with multiple constraints
• Shortest chain subject to side constraints
• Implementation of algorithms forK shortest loopless paths
• An algorithm for the resource constrained shortest path problem
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• An exponential‐function reduction method for block‐angular convex programs
• Approximate max-flow min-(multi)cut theorems and their applications
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: A penalty function heuristic for the resource constrained shortest path problem