An ant colony system-based hybrid algorithm for square root concave cost transhipment problems

References

• Abachizadeh , M. and Tahani , M. 2009 . An ant colony optimization approach to multi-objective optimal design of symmetric hybrid laminates for maximum fundamental frequency and minimum cost . Structural and Multidiscipline Optimization , 37 : 367 – 376 .
   Web of Science ®Google Scholar
• Ahuja , R. K. , Maganti , T. L. and Orlin , J. B. 1993 . Network flows, theory, algorithms, and applications , Englewood Cliffs : Prentice Hall .
   Google Scholar
• Amiri , A. and Pirkul , H. 1997 . New formulation and relaxation to solve a concave cost network flow problem . Journal of the Operational Research Society , 48 : 278 – 287 .
   Web of Science ®Google Scholar
• Balakrishnan , A. and Graves , S. C. 1989 . A composite algorithm for a concave-cost network flow problem . Networks , 19 : 175 – 202 .
   Web of Science ®Google Scholar
• Bazlamacci , C. and Hindi , K. 1996 . Enhanced adjacent extreme-point search and tabu search for the minimum concave cost uncapacitated transhipment problem . Journal of the Operational Research Society , 47 : 1150 – 1165 .
   Web of Science ®Google Scholar
• Beckers , R. , Deneubourg , J. L. and Goss , S. 1992 . Trails and U-turns in the selection of the shortest path by the ant Lasius Niger . Journal of Theoretical Biology , 159 : 397 – 415 .
   Web of Science ®Google Scholar
• Ben-Akiva , M. and Lerman , S. R. 1985 . Discrete choice analysis: theory and application to travel demand , Cambridge, Massachusetts : The MIT Press .
   Google Scholar
• Bullnheimer , B. , Hartl , R. F. and Strauss , C. 1999 . “ Applying the ant system to the vehicle routing problem ” . In Meta-heuristics: advances and trends in local search paradigms for optimization , Edited by: Voss , S. , Martello , S. , Osman , I. H. and Roucairol , C. Boston : Kluwer .
   Google Scholar
• Burkard , R. E. , Dollani , H. and Thach , P. H. 2001 . Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks . Journal of Global Optimization , 19 : 121 – 139 .
   Web of Science ®Google Scholar
• Costa , D. and Hertz , A. 1997 . Ants can colour graphs . Journal of the Computer Science , 34 : 39 – 53 .
   Google Scholar
• Di Caro , G. and Dorigo , M. 1998 . AntNet: Distributed stigmergetic control for communications networks . Journal of Artificial Intelligence Research , 9 : 317 – 365 .
   Web of Science ®Google Scholar
• Dorigo , M. and Gambardella , L. M. A study of some properties of ant-Q . Proceedings of PPSN IV – 4th international conference on parallel problem solving from nature . September 22–27 , Berlin, Germany. pp. 656 – 665 . Berlin : Springer-Verlag .
   Google Scholar
• Dorigo , M. and Gambardella , L. M. 1997a . Ant colony system: A cooperative learning approach to the traveling salesman problem . IEEE Transactions on Evolutionary Computation , 1 ( 1 ) : 53 – 66 .
   Google Scholar
• Dorigo , M. and Gambardella , L. M. 1997b . Ant colonies for the traveling salesman problem . BioSystems , 43 : 73 – 81 .
   PubMed Web of Science ®Google Scholar
• Dorigo , M. , Maniezzo , V. and Colorni , A. 1996 . The ant system: Optimization by a colony of cooperating agents . IEEE Transactions on Systems, Man, and Cybernetics – Part B , 26 ( 1 ) : 29 – 41 .
   PubMed Web of Science ®Google Scholar
• Dorigo , M. , Maniezzo , V. and Colorni , A. 1991 . The ant system: An autocatalytic optimizing process . Technical report no. 91–016 revised. Politecnico di Milano, Italy
   Google Scholar
• Fontes , D. B.M.M. and Goncalves , J. F. 2007 . Heuristic solutions for general concave minimum cost network flow problems . Networks , 50 ( 1 ) : 67 – 76 .
   Web of Science ®Google Scholar
• Fontes , D. B.M.M. , Hadjiconstantinou , E. and Christondes , N. 2006a . A branch-and-bound for the minimum concave cost network flow problem . Journal of Global Optimization , 34 : 127 – 155 .
   Google Scholar
• Fontes , D. B.M.M. , Hadjiconstantinou , E. and Christofides , N. 2006b . A new dynamic programming approach for solving single source uncapacitated concave minimum cost network flow problems . European Journal Operational Research , 174 : 1205 – 1219 .
   Web of Science ®Google Scholar
• Glover , F. , Amini , M. and Kochenberger , G. 2005 . Parametric ghost image processes for fixed-charge problems: A study of transportation networks . Journal of Heuristics , 11 ( 4 ) : 1381 – 1231 .
   Google Scholar
• Gallo , G. , Sandi , C. and Sodini , C. 1980 . An algorithm for the min concave cost flow problem . European Journal of Operational Research , 4 : 248 – 255 .
   Web of Science ®Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and intractability: A guide to the theory of NP-completeness , San Francisco : W.H. Freeman and Co .
   Google Scholar
• Guisewite , G. M. and Pardalos , P. M. 1993 . A polynomial time solvable concave network flow problems . Networks , 23 : 143 – 147 .
   Web of Science ®Google Scholar
• Jordan , W. C. 1986 . Scale economies on multi-commodity networks GMR-5579, Operating Systems Research Department, GM Research Laboratories
   Google Scholar
• Kolahan , F. , Abachizadeh , M. and Soheili , S. 2006 . A comparison between ant colony and tabu search algorithms for job shop scheduling with sequence-dependent setups . WSEAS Transportation Systems , 12 ( 5 ) : 2819 – 2824 .
   Google Scholar
• Kuhn , H. W. and Baumol , W. J. 1962 . An approximate algorithm for the fixed-charge transportation problem . Naval Research Logistics Quarterly , 9 : 1 – 16 .
   Google Scholar
• Kuntz , P. and Snyers , D. Emergent colonization and graph partitioning . Proceedings of the 3th international conference on simulation of adaptive behavior: From animals to animate 3 . August 8–12 1994 , Brighton, UK. pp. 494 – 500 . Cambridge, MA : The MIT Press .
   Google Scholar
• Larsson , T. , Migdalas , A. and Ronnqvist , M. 1994 . A Lagrangian heuristic for the capacitated concave minimum cost network flow problem . European Journal of Operational Research , 78 : 116 – 129 .
   Web of Science ®Google Scholar
• Montemanni , R. , Gambardella , L. M. , Rizzoli , A. E. and Donati , A. V. 2005 . Ant colony system for a dynamic vehicle routing problem . Journal of Combinatorial Optimization , 10 : 327 – 343 .
   Web of Science ®Google Scholar
• Nourie , F. J. and Guder , F. 1994 . A restricted-entry method for a transportation problem with piecewise-linear concave cost . Computer & Operations Research , 21 : 723 – 733 .
   Web of Science ®Google Scholar
• Serra , M. and Venini , P. 2006 . On some applications of ant colony optimization metaheuristic to plane truss optimization . Structural and Multidiscipline Optimization , 32 ( 6 ) : 499 – 506 .
   Web of Science ®Google Scholar
• Shyu , S. J. , Yin , P. Y. and Lin , B. M.T. 2004 . An ant colony optimization algorithm for the minimum weight vertex cover problem . Annals of Operations Research , 131 : 283 – 304 .
   Web of Science ®Google Scholar
• Stützl , T. and Dorigo , M. 1999 . “ ACO algorithms for the quadratic assignment problem ” . In New ideas in optimization , Edited by: Corne , D. and Glover , F. 33 – 50 . Maidenhead, , UK : McGraw-Hill .
   Google Scholar
• Thach , P. T. 1992 . A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure . Mathematical Programming , 53 : 339 – 359 .
   Google Scholar
• Yan , S. and Luo , S. C. 1998 . A tabu search-based algorithm for concave cost transportation network problems . Journal of the Chinese Institute of Engineers , 21 : 327 – 335 .
   Web of Science ®Google Scholar
• Yan , S. and Luo , S. C. 1999 . Probabilistic local search algorithms for concave cost transportation network problems . European Journal of Operational Research , 117 : 511 – 521 .
   Web of Science ®Google Scholar
• Yan , S. and Yang , D. H. 1996 . A decision support framework for handling schedule perturbation . Transportation Research Part B , 30 : 405 – 419 .
   Google Scholar
• Yan , S. , Juang , D. H. , Chen , C. R. and Lai , W. S. 2005 . Global and local search algorithms for concave cost transhipment problems . Journal of Global Optimization , 33 ( 1 ) : 123 – 156 .
   Web of Science ®Google Scholar