Abstract
This paper describes a system, called eTransport to solve a transportation problem. The system was applied in experiments that test meta-heuristic algorithms for solving such optimization task. The engine of this system is based on a bee behavior based algorithm, called KAPI, designed by the authors. In order to make a comparison of the results obtained by KAPI, the Ants Colony System and Tabu Search algorithms were also applied. The eTransport simulator can generate real-life scenarios on Google Maps, while configuring and running tested algorithms, and finally, displaying the solutions found. Some illustrative examples of experiments are presented and discussed. The analysis of results of multi-scenario simulations shows the advantages of the KAPI algorithm, and justifies the conclusion that KAPI is much better and more effectiveat finding solutions to problems of this kind than other known algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gendreau, M., Iori, M., Laporte, G.: A Tabu Search Heuristic for the Vehicle Routing Problem with Two-dimensional Loading Constraints. Networks 51, 4–18 (2008)
Wagner, T.: Principles of Operations Research with Applications to Managerial Decisions, 2nd edn., Phi Learning (2009)
Mathirajan, M., Meenakshi, B.: Experimental Analysis of Some Variants of Vogel’s Approximation Method. Indian Institute of Science (2003)
Kakol, A., Grotowski, K., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A., Burnham, K.J.: Performance of Bee Behavior-Based Algorithm for Solving Transportation Problem. In: Proc. of 5th ICONS IARIA Conference, pp. 83–87 (2010)
Bullnheimer, Hartl, R.F., Strauss, C.: An Improved Ant System Algorithm for the Vehicle Routing Problem. Technical Report POM-10/97, Institute of Management Science, University of Vienna, Austria (1997)
Dorigo, M., Di Caro, G., Gambardella, L.M.: Algorithms for Discrete Optimization. University Libre de Bruxelles, Belgium (2003)
Uso del algoritmo de optimización de colonia de hormigas. Investigación e Innovación para Ingeniería Civil (2007) (in Spanish), http://www.peru-v.com/
Gutjahr, W.J.: A Graph–Based Ant System and Its Convergence. Future Generation Computing System 16, 873–888 (2000)
Abounacer, R., Bencheikh, G., Boukachour, J., Dkhissi, B., Alaoui, A.E.: Population Meta- heuristics to Solve the Professional Staff Transportation Problem. CERENE Laboratory, ISEL, Quai Frissard B.P. 1137 76063 Le Havre, Cedex, France (2003)
Miller, P.: Theory of Swarm. National Geographic (August 2007)
Kakol, A., Grotowski, K., Łobodziński, T., Koszalka, L., Pozniak-Koszalka, I.: CABI Algorithm for Solving Unbalanced Transportation Problem. In: Proc. of ICSE, Coventry, UK (2009)
Hayder, H.: Object Programming with PHP 5. Helion, Gliwice (2009) (in Polish)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Structured Networks Using Multistage Simulation. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Kasprzak, A.: Packet Switching Wide Area Networks. In: WPWR, Wroclaw (2001) (in Polish)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakol, A., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A., Burnham, K.J. (2011). An Experimentation System for Testing Bee Behavior Based Algorithm to Solving a Transportation Problem. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20042-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-20042-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20041-0
Online ISBN: 978-3-642-20042-7
eBook Packages: Computer ScienceComputer Science (R0)