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

DOI10.1016/J.ADVENGSOFT.2009.03.003MaRDI QIDQ833641zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An alternative method to solve the biobjective minimum cost flow problem
• The biobjective minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• An algorithm for the biobjective integer minimum cost flow problem
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach

Cites work

• scientific article; zbMATH DE number 3845309 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3240118 (Why is no real title available?)
• A method for convex curve approximation
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Bicriteria Transportation Problem
• Bicriteria network flow problems: Continuous case
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• Efficient solutions for the bicriteria network flow problem
• Multiobjective scheduling by genetic algorithms.
• Multiple objective minimum cost flow problems: a review
• Network flows. Theory, algorithms, and applications.
• Optimization by simulated annealing
• Performance comparison of memetic algorithms
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• The biobjective minimum cost flow problem

Cited in

(1)

• An algorithm for the biobjective integer minimum cost flow problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833641)