A lagrangian relaxation based heuristic for solving the length-balanced two arc-disjoint shortest paths problem

Authors:
Yanzhi Li;Andrew Lim;Hong Ma
Affiliations:
Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong;Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong;Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 2
Cited 1

Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)

A hybrid genetic algorithm for solving the length-balanced two arc-disjoint shortest paths problem

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a HAZMAT transportation problem, which is modeled as the length-balanced two arc-disjoint shortest paths problem (LB2SP). The objective function of LB2SP is expressed as a weighted sum of two terms, i.e., the sum of the path lengths and the positive length difference between the paths. We demonstrate that LB2SP is NP-Hard, and formulate it as an Integer Programming (IP) model. We develop a Lagrangian relaxation based heuristic (LRBH) for LB2SP. Computational experiments are conducted to compare the performance of LRBH with the CPLEX solver, showing that the LRBH is efficient for LB2SP.