Processing may take a few seconds...

Article


Title

An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem

Authors

Year of publication

2021

Published in

Foundations of Computing and Decision Sciences

Journal year: 2021 | Journal volume: vol. 46 | Journal number: no. 1

Article type

scientific article

Publication language

english

Keywords
EN
  • bi-objective minimum cost flow problem
  • network flows
  • network mathematical programming
  • efficient extreme point
Abstract

EN In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is << the gain cycles >>, applied on a bi-objective minimum cost flow problem. This algorithm permits us to have a good order of many criteria in a rapid and an efficient way; because this classification permits us to structure the optimal area, in which we can choose the best action among the others which exist in the objective space. From this one, we distinguish, that the resolution of this problem comes to find an under set of good actions, among which the decider can select an action of best compromise, or make a decision, in the case where reference indications of the deciders may change. A didactic example is done to illustrate our algorithm.

Pages (from - to)

11 - 26

DOI

10.2478/fcds-2021-0002

URL

https://sciendo.com/article/10.2478/fcds-2021-0002

License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Points of MNiSW / journal

40.0

Points of MNiSW / journal in years 2017-2021

40.0

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.