Abstract
The container transshipment problem involves scheduling a fleet of lorries to collect and deliver containers of various sizes while minimizing the total distance travelled. The problem originates in the need for logistics companies to solve the problem on a regular basis as part of their daily operations. In this paper, we compare two genetic algorithms tailored to solve this problem based on permutation and bin-packing inspired encodings. Results are presented and analysed in order to evaluate the validity and robustness of the two approaches. As part of the analysis, bounds were calculated to determine how well both GAs perform in absolute terms as well as relative to each other. Of the two GA there is one clear winner, although it is not the one that would have been indicated by previous research. Whilst the winning GA is able to generate significant savings in practice, compared to the optimum there remains room for further improvement.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Transport of Goods by Road in Britain 1999, Great Britain Department of the Environment, Transport and the Regions, Annual Report of the Continuing Survey of Road Goods Transport, 2000. ISBN 1-85112-389-X.
A New Deal for Transport: Better for Everyone, Great Britain Department of the Environment, Transport and the Regions, The Government's White Paper on the Future of Transport, 1998. ISBN 0-10139-502-7.
Orlin, J. B. and Ahuja, R. K.: New scaling algorithms for the assignment and minimum mean cycle problems. Math. Program. 54 (1992), 41–56.
Falkenauer, E. and Delchambre, A.: A genetic algorithm for bin packing and line balancing, in Proceedings of the IEEE 1992 International Conference on Robotics and Automation, Wiley & Sons, Nice, France 1992, pp. 1186–1192.
Ahuja, R. K., Magnanti, T. L. and Orlin, J. B.: Network Flows: Theory, Algorithms and Application, Prentice Hall, 1993.
Rogers, A.: Statistical Analysis of Spatial Dispersion, Pion, London, 1974.
Scott, D.: Genetic Algorithms for the Efficient Transshipment of Container Loads. MSc. Dissertation, School of Mathematical and Information Systems, Coventry University, UK, 2002.
Reeves, C. R., Scott, D. and Harrison, S. A.: Applying genetic algorithms to container transshipment, in Proceedings of the International Conference on Artifical Neural Networks and Genetic Algorithms (ICANNGA 2003), Springer, Berlin Heidelberg New York, April, 2003, pp. 23–25.
Reeves, C. R.: Genetic algorithms for the operations researcher. INFORMS J. Comput. 9 (1997), 231–250.
Falkenauer, E.: Genetic Algorithms and Grouping Problems, Wiley & Sons, Chichester, 1998.
Reeves, C. R.: Hybrid genetic algorithms for bin-packing and related problems. Ann. Oper. Res. 63 (1996), 371–396.
Reeves, C. R. and Höhn, C.: Integrating local search into genetic algorithms, in Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA), Springer, Berlin Heidelberg New York, 1995, pp. 214–217.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Scott, D., Verity-Harrison, A. & Reeves, C.R. The Container Transshipment Problem: Searching Representation Landscapes with Metaheuristic Algorithms. J Math Model Algor 5, 273–289 (2006). https://doi.org/10.1007/s10852-005-9009-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-005-9009-y