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

Concave cost transhipment problems are difficult to optimally solve for large-scale problems within a limited period of time. Recently, some modern meta-heuristics have been employed for the development of advanced local search based or population-based stochastic search algorithms that can improve the conventional heuristics. Besides these meta-heuristics, the ant colony system algorithm is a population-based stochastic search algorithm which has been used to obtain good results in many applications. This study employs the ant colony system algorithm, coupled with some genetic algorithm and threshold accepting algorithm techniques, to develop a population based stochastic search algorithm for efficiently solving square root concave cost transhipment problems. The developed algorithms are evaluated with a number of problem instances. The results indicate that the proposed algorithm is more effective for solving square root concave cost transhipment problems than other recently designed local search based algorithms and genetic algorithm.

[1]  Shangyao Yan,et al.  Global and Local Search Algorithms for Concave Cost Transshipment Problems , 2005, J. Glob. Optim..

[2]  Cüneyt F. Bazlamacci,et al.  Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem , 1996 .

[3]  Shangyao Yan,et al.  Probabilistic local search algorithms for concave cost transportation network problems , 1999, Eur. J. Oper. Res..

[4]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[5]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[6]  Panos M. Pardalos,et al.  A polynomial time solvable concave network flow problem , 1993, Networks.

[7]  Fred W. Glover,et al.  Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks , 2005, J. Heuristics.

[8]  Paolo Venini,et al.  On some applications of ant colony optimization metaheuristic to plane truss optimization , 2006 .

[9]  Bertrand M. T. Lin,et al.  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..

[10]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[11]  Phan Thien Thach.  A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure , 1992, Math. Program..

[12]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[13]  Luca Maria Gambardella,et al.  A Study of Some Properties of Ant-Q , 1996, PPSN.

[14]  H. Kuhn,et al.  An approximative algorithm for the fixed‐charges transportation problem , 1962 .

[15]  Nicos Christofides,et al.  A Branch-and-Bound Algorithm for Concave Network Flow Problems , 2006, J. Glob. Optim..

[16]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[17]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Faruk Güder,et al.  A restricted-entry method for a transportation problem with piecewise-linear concave costs , 1994, Comput. Oper. Res..

[20]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[21]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Null Null,et al.  A comparison between Ant colony and Tabu search algorithms for job shop scheduling with sequence-dependent setups , 2006 .

[23]  Masoud Tahani,et al.  An ant colony optimization approach to multi-objective optimal design of symmetric hybrid laminates for maximum fundamental frequency and minimum cost , 2009 .

[24]  Moshe Ben-Akiva,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1985 .

[25]  José Fernando Gonçalves,et al.  Heuristic solutions for general concave minimum cost network flow problems , 2007, Networks.

[26]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[27]  Nicos Christofides,et al.  A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..

[28]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[29]  Shangyao Yan,et al.  A TABU-SEARCH BASED ALGORITHM FOR CONCAVE COST TRANSPORTATION NETWORK PROBLEMS , 1998 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .

[32]  H. Pirkul,et al.  New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[33]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[34]  Pascale Kuntz,et al.  Emergent colonization and graph partitioning , 1994 .

[35]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[36]  José Fernando Gonçalves,et al.  Heuristic solutions for general concave minimum cost network flow problems , 2007 .

[37]  Rainer E. Burkard,et al.  Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks , 2001, J. Glob. Optim..

[38]  Shangyao Yan,et al.  A decision support framework for handling schedule perturbation , 1996 .

[39]  Mikael Rönnqvist,et al.  A Lagrangean heuristic for the capacitated concave minimum cost network flow problem , 1994 .