An algorithm for solving the bi-objective median path-shaped facility on a tree network-Reference-Cited by-同舟云学术

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

Published:2020-01-10 Issue:1 Volume:28 Page:
ISSN:2090-9128
Container-title:Journal of the Egyptian Mathematical Society
language:en
Short-container-title:J Egypt Math Soc

Author:

Aboutahoun Abdallah,El-Safty Fatma^ORCID

Abstract

AbstractIn 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.

Publisher

Springer Science and Business Media LLC

Link

http://link.springer.com/content/pdf/10.1186/s42787-019-0063-4.pdf

Reference34 articles.

1. Aboutahoun, A. W., El-Safty, F.: A linear algorithm for a minimax location of a path-shaped facility with a specific length in a weighted tree network. Int. J. Oper. Res. 1. https://doi.org/10.1504/IJOR.2021.10016889.

2. Alizadeh, B., Etemad, R.: Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization. 65, 2025–2036 (2016).

3. Averbakh, I., Berman, O.: Algorithms for path medi-centers of a tree. Comput. Oper. Res.26, 1395–1409 (1999).

4. Becker, R. I.: Inductive algorithms on finite trees. Quaest. Math.13, 165–181 (1990).

5. Becker, R. I., Chang, Y. I., Lari, I., Scozzari, A., Strochi, G.: Finding the ℓ-core of a tree. Discrete Appl. Math. 118, 25–42 (2002).