@inproceedings{47f86f71ff1940fcb97b2714b5b5f0a7,
title = "A lagrangian relaxation based heuristic for solving the length-balanced two arc-disjoint shortest paths problem",
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. {\circledC} Springer-Verlag Berlin Heidelberg 2005.",
author = "Yanzhi Li and Andrew Lim and Hong Ma",
year = "2005",
doi = "10.1007/11589990_196",
language = "English",
isbn = "3540304622",
volume = "3809 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1323--1326",
booktitle = "AI 2005: Advances in Artificial Intelligence",
address = "Germany",
}