Beta
ManageSearchChatDiscover
384567

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

Article

Last updated: 29 Dec 2024

OverviewSimilar Items

Subjects

-

Tags

-

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.

DOI

10.1186/s42787-019-0063-4

Keywords

Two-phase method, Pareto solution, Median path, k-best algorithm

Authors

First Name

Abdallah

Last Name

Aboutahoun

MiddleName

-

Affiliation

-

Email

atahoun@zewailcity.edu.eg

City

-

Orcid

-

First Name

Fatma

Last Name

El-Safty

MiddleName

-

Affiliation

Faculty of Science, Damanhour University, Damanhour, Egypt

Email

-

City

-

Orcid

-

Volume

28

Article Issue

1

Related Issue

50535

Issue Date

2020-06-01

Receive Date

2024-10-07

Publish Date

2020-06-01

Page Start

1

Page End

16

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 28_Issue 1_Pages 1-16.pdf

PDF . 1.3MB

Link

https://joems.journals.ekb.eg/article_384567.html

Detail API

https://joems.journals.ekb.eg/service?article_code=384567

Order

384,567

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

https://joems.journals.ekb.eg/

MainTitle

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

Details

Type

Article

Created At

21 Dec 2024