Models and algorithms for dissimilar path routing problem

The dissimilar path routing problem is to find spatially dissimilar paths between two specific source and destination nodes for a given transportation network. Many decisions, in military logistics, hazardous materials transportation, and so on, especially in abnormal weather conditions, can be modelled as this problem. Three different models and algorithms for the problem are introduced in the paper. The merits and drawbacks of these models are analyzed and criticized. Based on the above analysis, a combined model was set up and an algorithm is given.