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

Advances in Engineering Software

Volumn 40, Issue 10, 2009, Pages 1056-1062

  Mohammad Ebrahim, R ^a   Razmi, J ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Bi objective minimum cost flow; Hybrid meta heuristic; Memetic algorithm; Simulated annealing

Indexed keywords

ANNEALING; COST ACCOUNTING; COSTS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PORTALS; PROBLEM SOLVING;

APPROXIMATE METHODS; BI-OBJECTIVE MINIMUM COST FLOW; COMPUTATIONAL TIME; EFFICIENT FRONTIERS; EXACT COMPUTATIONS; EXACT METHODS; EXACT SOLUTIONS; EXPONENTIAL NUMBERS; HYBRID META HEURISTIC; MEMETIC ALGORITHM; META-HEURISTIC ALGORITHMS; MINIMUM COST FLOW PROBLEMS; MULTI OBJECTIVES;

SIMULATED ANNEALING;

EID: 67349167439     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2009.03.003     Document Type: Article

References (18)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms and applications (1993), Prentic Hall Inc.,, Englewood Cliffs (NJ)
2. Aneja Y.P., and Nair K.P.K. Bi-criteria transportation problem. Manage Sci 25 1 (1979) 73-78
3. Bagchi T.P. Multiobjective scheduling by genetic algorithms (1999), Kluwer Academic Publishers, Boston
4. Burkard R.E., Hamacher H.W., and Rote G. Sandwich approximation of univariate convex functions with an application to separable convex programming. Naval Res Logis Quart 38 6 (1991) 911-924
5. Digalakis J., and Margaritis K. Performance comparison of memetic algorithms. Appl Math Comput 158 (2004) 237-252
6. Ehrgott M. Multi criteria optimization, lecture notes in economics and mathematical systems, vol. 491. Berlin: Springer-Verlag; 2000.
7. Fogel L.G., Owens A.J., and Walsh M.J. Artificial intelligence through simulated evolution (1966), Wiley, New York
8. Fruhwirth B., Burkard R.E., and Rote G. Approximation of convex curves with application to the bi-criteria minimum cost flow problem. Eur J Oper Res 42 (1989) 326-338
9. Hamacher H.W., Pederson Ch.R., and Ruzika S. multi objective minimum cost flow problems: a review. Eur J Oper Res 179 (2007) 1404-1422
10. Kirkpatrick S., Gellet C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
11. Lee H., and Pulat P.S. Bi-criteria network flow problems: continuous case. Eur J Oper Res 51 (1991) 119-126
12. Malhorta R., and Puri M.C. Bi-criteria network problem. Cahiers du Centre d' Etudes Recherche Operationelle 26 1/2 (1984) 95-102
13. Pulat P.S., Huarang F., and Lee H. Efficient solution for the bi-criteria network flow problem. Comput Oper Res 19 7 (1992) 649-655
14. Ruhe G. Complexity results for multi criteria and parametric network flows using a pathological graph of Zadeh. Z Oper Res 32 1 (1988) 9-27
15. Ruhe G. Flüsse in Netzwerken-komplexitat und algorithmen, PhD thesis, Tenchnische Hochschule Leipzig; 1988.
16. Sedeño-Noda A., and Gonzalez-Martín C. The bi-objective minimum cost flow problem. Eur J Oper Res 124 (2000) 591-600
17. Steuer R.E. Multi-criteria optimization: theory, computation and application (1986), John Willy & sons, New York
18. Yang X.Q., and Goh C.J. A method for convex curve approximation. Eur J Oper Res 97 (1997) 205-212