Faculty of Science, Damanhour University, Damanhour, Egypt
https://doi.org/10.1186/s42787-019-0063-4
Abstract
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.
Aboutahoun, A., & El-Safty, F. (2020). An algorithm for solving the bi-objective median path-shaped facility on a tree network. Journal of the Egyptian Mathematical Society, 28(1), 1-16. doi: https://doi.org/10.1186/s42787-019-0063-4
MLA
Abdallah Aboutahoun; Fatma El-Safty. "An algorithm for solving the bi-objective median path-shaped facility on a tree network", Journal of the Egyptian Mathematical Society, 28, 1, 2020, 1-16. doi: https://doi.org/10.1186/s42787-019-0063-4
HARVARD
Aboutahoun, A., El-Safty, F. (2020). 'An algorithm for solving the bi-objective median path-shaped facility on a tree network', Journal of the Egyptian Mathematical Society, 28(1), pp. 1-16. doi: https://doi.org/10.1186/s42787-019-0063-4
VANCOUVER
Aboutahoun, A., El-Safty, F. An algorithm for solving the bi-objective median path-shaped facility on a tree network. Journal of the Egyptian Mathematical Society, 2020; 28(1): 1-16. doi: https://doi.org/10.1186/s42787-019-0063-4
)
