A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem

Authors:
R. Mohammad Ebrahim;J. Razmi
Affiliations:
Industrial Engineering Department, College of Engineering, University of Tehran, Tehran, Iran;Industrial Engineering Department, College of Engineering, University of Tehran, Tehran, Iran
Venue:
Advances in Engineering Software
Year:
2009

Citing 4
Cited 2

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Efficient solutions for the bicriteria network flow problem

Computers and Operations Research - Special issue: implementing multiobjective optimization methods: behavioral and computational issues
Intelligence through simulated evolution: forty years of evolutionary programming

Intelligence through simulated evolution: forty years of evolutionary programming
Multiobjective Scheduling by Genetic Algorithms

Multiobjective Scheduling by Genetic Algorithms

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

The Journal of Supercomputing
A new high performance approach: merging optimal multicast sessions for supporting multisource routing

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the bi-objective minimum cost flow (BMCF) problem which can be categorized as multi objective minimum cost flow problems. Generally, the exact computation of the efficient frontier is intractable and there may exist an exponential number of extreme non-dominated objective vectors. Hence, it is better to employ an approximate method to compute solutions within reasonable time. Therefore, we propose a hybrid meta heuristic algorithm (memetic algorithm hybridized with simulated annealing MA/SA) to develop an efficient approach for solving this problem. In order to show the efficiency of the proposed MA/SA some problems have been generated and solved by both the MA/SA and an exact method. It is perceived from this evaluation that the proposed MA/SA outputs are very close to the exact solutions. It is shown that when the number of arcs and nodes exceed 30 (large problems) the MA/SA model will be more preferred because of its strongly shorter computational time in comparison with exact methods.