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

DOI10.1016/j.advengsoft.2009.03.003zbMath1175.90294OpenAlexW2025223483MaRDI QIDQ833641

R. Mohammad Ebrahim, Jafar Razmi

Publication date: 14 August 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2009.03.003

zbMATH Keywords

simulated annealingmemetic algorithmbi-objective minimum cost flowhybrid meta heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Multiple objective minimum cost flow problems: a review
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• A method for convex curve approximation
• The biobjective minimum cost flow problem
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Performance comparison of memetic algorithms
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• Bicriteria Transportation Problem
• Sandwich approximation of univariate convex functions with an application to separable convex programming

This page was built for publication: A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem