Heuristic solutions for general concave minimum cost network flow problems

Networks

Volumn 50, Issue 1, 2007, Pages 67-76

  Fontes, Dalila B M M ^a   Gonçalves, José Fernando ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Combinatorial optimization; Concave cost optimization; Genetic algorithms; Heuristics; Local search; Network flow

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COST REDUCTION; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS;

HYBRID METHODOLOGY; LOCAL SEARCH; NETWORK FLOW;

INFORMATION THEORY;

EID: 34547744032     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20167     Document Type: Article

References (35)

1. C. Bazlamaçci and K. Hindi, Enhanced adjacent extremepoint search and tabu search for the minimum concave-cost uncapacitated transshipment problem, J Oper Res Soc 47 (1996), 1150-1165.
2. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA J Comput 6 (1994), 54-160.
3. J.E. Beasley, Or-Library. http://www.brunel.ac.uk/depts/ma/research/jeb/ orlib/netflowccinfo.html.
4. R.E. Burkard, H. Dollani, and P.H. Thach, Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks, J Global Optimiz 19 (2001), 121-139.
5. E.K. Burke and A.J. Smith, Hybrid evolutionary techniques for the maintenance scheduling problem, IEEE Trans Power Syst 15 (2000), 122-128.
6. R.E. Erickson, C.L. Monma, and A.F. Veinott, Send-and-split method for minimum-concave-cost network flows, Math Oper Res 12 (1987), 634-664.
7. D.B.M.M. Fontes, Optimal network design using nonlinear cost flows, PhD Thesis, The Management School, Imperial College of Science Technology and Medicine, London, UK, 2000.
8. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christofides, Upper bounds for single source uncapacitated minimum concave-cost network flow problems, Networks 41 (2003), 221-228.
9. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christondes, A branch-and-bound for the minimum concave cost network flow problem, J Global Optimiz 34 (2006), 127-155.
10. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christofides, Lower bounds from state space relaxations for network routing problems, J Global Optimiz 34 (2006), 97-125.
11. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christofides, A new dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Eur J Oper Res 174 (2006), 1205-1219.
12. G. Gallo, C. Sandi, and C. Sodini, An algorithm for the min concave cost flow problem, Eur J Oper Res 4 (1980), 249-255.
13. G. Gallo and C. Sodini, Adjacent extreme flows and application to minimum concave cost flow problems, Networks 9 (1979), 95-121.
14. D.E. Goldberg, Genetic algorithms in search optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
15. J.F. Gonçalves and J.R. Almeida, A hybrid genetic algorithm for assembly line balancing, J Heuristics 8 (2002), 629-642.
16. J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende, A hybrid genetic algorithm for the job shop scheduling problem, Eur J Oper Res 167 (2005), 77-95.
17. J.F. Gonçalves and M.G.C. Resende, An evolutionary algorithm for manufacturing cell formation, Comput Indust Eng 47 (2004), 247-273.
18. G.M. Guisewite, "Network problems," Handbook of global optimization, R. Horst and P.M. Pardalos (Editors), Kluwer Academic, Dordrecht, 1994, pp. 609.
19. G.M. Guisewite and P.M. Pardalos, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, J Global Optimiz 3 (1991), 245-265.
20. R. Horst and N.V. Thoai, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, OR Spectrum 20 (1998), 45-53.
21. D. Kennedy, Some branch-and-bound techniques for nonlinear optimization, Math Program 42 (1988), 147-169.
22. D. Kim and P.M. Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Operat Res Lett 24 (1999), 195-203.
23. D. Kim and P.M. Pardalos, A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems, J Global Optimiz 17 (2000), 225-234.
24. D. Kim and P.M. Pardalos, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks 35 (2000), 216-222.
25. H.-J. Kim and J.N. Hooker, Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach, Ann Oper Res 115 (2002), 95-124.
26. A. Konak and A.E. Smithy, A hybrid approach for backbone design of communication networks, IEEE Proc 1999 Congress Evol Comput IEEE, Washington, DC, 1999, pp. 1817-1823.
27. B.W. Lamar, "A method for solving network flow problems with general nonlinear arc costs," Network optimization problems: Algorithms, Applications and Complexity, D.-Z Du and P.M. Pardalos (Editors), World Scientific, Singapore, 1993, pp. 147-167.
28. Z. Michalewicz, Genetic algorithms + data structures = Evolution programs, 3rd ed., Springer-Verlag, New York, 1996.
29. L-S. Oh, J.-S. Lee, and B.-R. Moon, "Local search-embedded genetic algorithms for feature selection," Proceedings of the 16th international conference on pattern recognition, Vol. 2, IEEE, Quebec, Canada, 2002, pp. 148-151.
30. F. Ortega and L.A. Wolsey, A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem, Networks 41 (2003), 143-158.
31. C.R. Reeves, Modern heuristic techniques for combinatorial problems, "Genetic algorithms," Blackwell Scientific Press, Oxford, 1993, pp. 151-196.
32. D.K. Smith and G.A. Walters, Evolutionary approach for finding optimal trees in undirected networks, Eur J Oper Res 120 (2000), 593-602.
33. W.M. Spears and K.A. Dejong, "On the virtues of parameterized uniform crossover," Proceedings of the fourth international conference on genetic algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1991, pp. 230-236.
34. H. Tuy, "The minimum concave-cost network flow problem with a fixed number of nonlinear arc costs: Complexity and approximation," Approximation and complexity in numerical optimization: Continuous and discrete problems, P.M. Pardalos (Editor), Kluwer Academic, Boston, 2000, pp. 383-402.
35. W.I. Zangwill, Minimum concave cost flows in certain networks, Manag Sci 14 (1968), 429-450.