Metrics transform based Multi-constrained Optimal Path selection

The problem of MCOP (Multi-Constrained Optimal Path) is known to be NP-complete. A few of heuristic algorithms have been presented to solve it. In (Wang et al., 2007), a new method integrating QoS metrics with BFS (Bread-First-Search) is used to solve the MCP (multi-constrained path) problem. The MCOP problem differs from the MCP problem in that the former has to find a least cost path except for the multi-QoS constraints. Therefore, the algorithm in (Wang et al., 2007) cannot be applied to the MCOP problem straightly. In this paper, we introduce ATC_MCOP (Additive-to-Concave for MCOP) to solve the MCOP problem. The ATC_MCOP first searches three paths, and then chooses an optimal path among the three paths. From the simulation results, ATC_MCOP shows efficient performances.