New Algorithm Permitting the Construction of an Effective Spanning Tree

In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-chosen criterion. Consequently, our algorithm uses no...

Full description

Saved in:
Bibliographic Details
Published in:Foundations of computing and decision sciences 2023-09, Vol.48 (3), p.313-329
Main Authors: Belkacem, Salima Nait, Abbas, Moncef
Format: Article
Language:English
Subjects:
Bi-objective minimum cost flow problem
Efficient extreme point
Linear programming
Minimum spanning tree
Network flows
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-chosen criterion. Consequently, our algorithm uses notions of Bellman’s algorithm to determine the best path of the network, and Ford Fulkerson’s algorithm to maximise the flow value. The Simplex Network Method that permits to reach the optimality conditions manipulates the two algorithms. In short, the interest of our work is the optimization of many criteria taking into account the strong spanning tree, which represents the central angular stone of the network. To illustrate that, we propose to optimize a bi-objective distribution problem.
ISSN:2300-3405
2300-3405
DOI:10.2478/fcds-2023-0012