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

DOI10.1016/J.ADVENGSOFT.2009.03.003zbMATH Open1175.90294OpenAlexW2025223483MaRDI QIDQ833641FDOQ833641

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

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

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

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

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)