Abstract
The goal of this paper is to develop an algorithm that is capable to handle a slightly modified version of the minimal Traveling Salesman Problem in an efficient and robust way and produces high-quality solutions within a reasonable amount of time. The requirements of practical logistical applications, such as road transportation and supply chains, are also taken into consideration in this novel approach of the TSP. This well-known combinatorial optimization task is solved by a bacterial memetic algorithm, which is an evolutionary algorithm inspired by bacterial transduction. A new method is also proposed to deal with the time dependency in the cost matrix. The efficiency of the implementation, including time and space constraints, is investigated on a real life problem.
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
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem, A Computational Study. Princeton University Press, Princeton (2006)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: Solving Traveling Salesman Problems. Retrieved from: The Traveling Salesman Problem (2008), http://www.tsp.gatech.edu/
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamella, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (1999)
Baudry, B., Fleurey, F., Jézéquel, J.-M., Le Traon, Y.: Automatic Test Case Optimization: A Bacteriologic Algorithm. IEEE Software 22, 76–82 (2005)
Botzheim, J., Cabrita, C., Kóczy, L.T., Ruano, A.E.: Fuzzy Rule Extraction by Bacterial Memetic Algorithm. In: IFSA 2005, Beijing, China, pp. 1563–1568 (2005)
Botzheim, J.: Intelligens számítástechnikai modellek identifikációja evolúciós és gradiens alapú tanuló algoritmusokkal. Budapest: Ph.D. dissertation, Technical University of Budapest (2007) (in Hungarian)
Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1989)
Földesi, P., Kóczy, L.T., Botzheim, J., Farkas, M.: Eugenic Bacterial Memetic Algorithm for Fuzzy Road Transport Traveling Salesman Problem. In: International Symposium of Management Engineering (2009)
Goldberg, D.: Genetic Algorithms in Search, Optimisation, and Machine Learning. Addison-Wesley, Reading (1989)
Griffiths, A.J., Miller, J.H., Suzuki, D.T., Lewontin, C.R., Gelbart, M.W.: Gene Transfer in Bacteria and their Viruses. Retrieved from National Center for Biotechnology Information (2000), http://www.ncbi.nlm.nih.gov/books/bv.fcgi?rid=iga.section.1363
Holland, J.H.: Adaption in Natural and Artificial Systems. The MIT Press, Cambridge (1992)
Hoos, H.H., Stutzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2005)
Kann, V.: Minimum Traveling Salesperson. Retrieved from Network Design (2000), http://www.nada.kth.se/~viggo/wwwcompendium/node69.html
Karp, R.: Reducibility Among Combinatorial Problems. In: Symposium on the Complexity of Computer Computations, p. 14. Plenum Press (1972)
Kauffman, S., Levin, S.: Towards a General Theory of Adaptive Walks on Rugged Landscapes. Journal Theory of Biology 11, 128 (1987)
Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research 21, 498–516 (1973)
Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Caltech Concurrent Computation Program, Tech. Rep., California (1989)
Nawa, N.E., Hashiyama, T., Furuhashi, T., Uchikawa, Y.: Fuzzy Logic Controllers Generated by Pseudo-Bacterial Genetic Algorithm. In: IEEE Int. Conf. Neural Networks (ICNN 1997), Houston, pp. 2408–2413 (1997)
Nawa, N.E., Furuhashi, T.: Fuzzy System Parameters Discovery by Bacterial Evolutionary Algorithm. IEEE Tr. Fuzzy Systems 7, 608–616 (1999)
Orponen, P., Mannila, H.: On Approximation Preserving Reductions: Complete Problems and Robust Measures. Helsinki: Technical Report C-1987-28, Department of Computer Science, University of Helsinki (1987)
Rónyai, L., Ivanyos, G., Szabó, R.: Algoritmusok. Budapest: TypoTex (1998) (in Hungarian)
Ye, J., Tanaka, M., Tanino, T.: Eugenics-based Genetic Algorithm. IEICE Transactions on Information and Systems E79-D(5), 600–607 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Farkas, M., Földesi, P., Botzheim, J., Kóczy, L.T. (2009). Approximation of a Modified Traveling Salesman Problem Using Bacterial Memetic Algorithms. In: Rudas, I.J., Fodor, J., Kacprzyk, J. (eds) Towards Intelligent Engineering and Information Technology. Studies in Computational Intelligence, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03737-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-03737-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03736-8
Online ISBN: 978-3-642-03737-5
eBook Packages: EngineeringEngineering (R0)