In this paper, an algorithm for the bi-objective median path (BMP) problem on a tree network is considered. The algorithm is based on the two-phase method which can compute all Pareto solutions for the BMP problem. The first phase is applied to find supported Pareto solutions by solving the uni-objective problem D(P,λ). The second phase is used to compute the unsupported Pareto solutions by applying a k-best algorithm which computes the k-best Pareto solutions in order of their objective values.

中文翻译：

---

一种求解树状网络双目标中值路径形设施的算法

在本文中，考虑了树网络上的双目标中值路径（BMP）问题的算法。该算法基于两阶段方法，可以计算 BMP 问题的所有帕累托解。第一阶段用于通过解决单目标问题 D(P,λ) 来寻找支持的帕累托解。第二阶段用于通过应用 k-best 算法计算不受支持的 Pareto 解，该算法按其目标值的顺序计算 k-best Pareto 解。