Benchmarking of optimisation techniques based on genetic algorithms, tabu search and simulated annealing

The airfreight forwarding business requires the application of stochastic search techniques to support the development of the industry. In the workflow of airfreight forwarding, the cargo loading process is believed to be the most probable step to find room for further improvement. How to carry cargoes efficiently needs to be taken into consideration to maximise the profit without any violation of the volume and weight constraints. Among those search techniques, Genetic Algorithms (GA), Tabu Search (TS) and Simulated Annealing (SA) are prevalently used to deal with the optimisation problems. As an illustration of the application of the three search techniques to the cargo loading problem, it is suggested that GA is the most appropriate method to apply in the optimisation of freight forwarding application. This paper begins with a glance at the cargo loading problem and the airfreight forwarding profit model. Then the working procedures of stochastic search techniques, including GA, TS and SA, are described as they are applied to the cargo loading problem. Subsequently, a qualitative comparison among these three approaches is made to suggest a search technique that is found to be suitable for optimising cargo loading plans in the airfreight forwarding business.

[1]  Henry C. W. Lau,et al.  Multi-agent modeling of dispersed manufacturing networks , 1999 .

[2]  Jacek Klinowski,et al.  Taboo Search: An Approach to the Multiple Minima Problem , 1995, Science.

[3]  Balram Suman,et al.  Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem , 2004, Comput. Chem. Eng..

[4]  Rong-Song He,et al.  Improving real-parameter genetic algorithm with simulated annealing for engineering problems , 2006, Adv. Eng. Softw..

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[6]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[7]  Li Ma,et al.  Reactive power optimization by GA/SA/TS combined algorithms , 2002 .

[8]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[9]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[10]  Alain Hertz,et al.  STABULUS: A technique for finding stable sets in large graphs with tabu search , 1989, Computing.

[11]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Albert Y. Zomaya Natural and simulated annealing , 2001, Computing in Science & Engineering.

[14]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[15]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[16]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[17]  Jae-Chul Kim,et al.  Application of simulated annealing and tabu search for loss minimization in distribution systems , 2004 .