Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Abstract EN

The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered.

Nonlinear optimization model is developed to model constrained robust shortest path problem.

The dual nature of the proposed problem is deduced based on the Lagrangian duality theory.

An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem.

An extension problem that considers multiple constraints is discussed.

Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close-to-optimal solutions within reasonable computational times.