An algorithm for solving the bi-objective median path-shaped facility on a tree network
Aboutahoun, A., El-Safty, F. (2020). An algorithm for solving the bi-objective median path-shaped facility on a tree network. EKB Journal Management System, 28(1), 1-16. doi: 10.1186/s42787-019-0063-4
Abdallah Aboutahoun; Fatma El-Safty. "An algorithm for solving the bi-objective median path-shaped facility on a tree network". EKB Journal Management System, 28, 1, 2020, 1-16. doi: 10.1186/s42787-019-0063-4
Aboutahoun, A., El-Safty, F. (2020). 'An algorithm for solving the bi-objective median path-shaped facility on a tree network', EKB Journal Management System, 28(1), pp. 1-16. doi: 10.1186/s42787-019-0063-4
Aboutahoun, A., El-Safty, F. An algorithm for solving the bi-objective median path-shaped facility on a tree network. EKB Journal Management System, 2020; 28(1): 1-16. doi: 10.1186/s42787-019-0063-4

An algorithm for solving the bi-objective median path-shaped facility on a tree network

Journal of the Egyptian Mathematical Society
Volume 28, Issue 1, June 2020, Pages 1-16    PDF (1.26 M)
DOI: 10.1186/s42787-019-0063-4
Authors
Abdallah Aboutahoun; Fatma El-Safty
Faculty of Science, Damanhour University, Damanhour, Egypt
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.

Keywords
Two-phase method; Pareto solution; Median path; k-best algorithm
Statistics
Article View: 54
PDF Download: 24