Abstract
The asymmetric traveling salesman problem (ATSP) is an NP-hard problem. The Bayesian network structure which describes conditional independence among subsets of variables is useful in reasoning uncertainty. The ATSP is formed as the Bayesian network structure and solved by the ant colony optimization (ACO) in this study. The proposed algorithm is tested in different sample size. The exam case is finding customer preference’s city sequence. Results show the proposed algorithm has a higher joint probability than random selected case. More applications such as the sequential decision, the variable ordering or the route planning can also implement.
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
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)
Jensen, F.V.: Introduction to Bayesian Networks. Springer, Berlin (1996)
Pearl, J.: Probabilistic Reasoning in Intelligent System: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)
Shukla, A., Tiwari, R., Kala, R.: Real Life Applications of Soft Computing. CRC press, Taylor & Francis, Boca Raton, FL (2010)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Sci. 220(4598), 671–680 (1983)
Holland, J.H.: Adaptation in Natural and Artificial Systems. U. of Michigan Press (1975)
Dorigo, M.: Optimization, Learning and Natural Algorithms (Ph.D Thesis). Politecnico di Milano, Italie (1992)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc. of IEEE Intl. Conf. on Neural Networks IV, pp. 1942–1948 (1995)
Öncan, T., Altinel, I.K., Laporte, G.: A comparative analysis of several asymmetric traveling salesman problem formulations. Comp. & Oper. Res. 36, 637–654 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, NH. (2012). An Ant Colony Optimization and Bayesian Network Structure Application for the Asymmetric Traveling Salesman Problem. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28493-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-28493-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28492-2
Online ISBN: 978-3-642-28493-9
eBook Packages: Computer ScienceComputer Science (R0)