![](bg6.png)
funded by the Ministry of Science and Higher
Education, Poland, Grant No. N N516 265835.
Authors would like to thank Dr Bożena Małysiak-
Mrozek and Dr Dariusz Mrozek from the Institute of
Informatics, Silesian University of Technology,
Gliwice, Poland for the possibility to perform
calculations on this computer.
REFERENCES
Angéniol, B., de la Croix Vaubois, G., Le Texier, J.Y.,
1988. Self-organizing feature maps and the travelling
salesman problem. In Neural Networks 1(4). Elsevier.
Aras, N., Oommen, B.J., Altinel, I.K., 1999. Kohonen
network incorporating explicit statistics and its
application to the travelling salesman problem. In
Neural Networks 12(9). Elsevier.
Bai, Y., Zhang, W., Jin, Z., 2006. A new self-organizing
maps strategy for solving the traveling salesman
problem. In Chaos, Solitons & Fractals. Elsevier.
Burke, L.I., Damany, P., 1992. The guilty net for the
traveling salesman problem. In Computers &
Operations Research 19(3-4). Elsevier.
DePuy, G.W., Moraga, R.J., Whitehouse G.E., 2005.
Meta-RaPS: a simple and effective approach for
solving the traveling salesman problem. In
Transportation Research Part E. Elsevier.
DePuy, G.W., Moraga, R.J., Whitehouse G.E., 2002.
Using the Meta-RaPS approach to solve combinatorial
problems. In Proceedings of the 2002 Industrial
Engineering Research Conference.
Fort, J.C., 1988. Solving combinatorial problem via self-
organizing process: An application of the Kohonen
algorithm to the traveling salesman problem. In
Biological Cybernetics 59(1). Springer.
Golden, B.L., Stewart, W.R., 1985. Empirical analysis of
heuristics. In Lawler, E.L., Lenstra, J.K., Rinnooy
Kan, A.H.G., Shmoys, D.B., 1985. The Traveling
Salesman Problem: A Guided Tour of Combinatorial
Optimization. John Wiley & Sons.
Herdy, M., 1991. Application of the Evolution Strategy to
Discrete Optimization Problems. In Lecture Notes in
Computer Science 496. Springer.
Hueter, G.J., 1988. Solution to the travelling salesman
problem with an adaptive ring. In Proceedings of the
IEEE International Conference on Neural Networks.
Kostrzewa, D., Josiński, H., 2011. Verification of the
Search Space Exploration Strategy Based on the
Solutions of the Join Ordering Problem. In Advances
in Intelligent and Soft Computing. Springer.
Krasnogor, N., Moscato, P., Norman, M.G., 1995. A new
hybrid heuristic for large geometric traveling salesman
problems based on the Delaunay triangulation. In
Anales del XXVII Simposio Brasileiro de Pesquisa
Operacional.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.,
Shmoys, D.B., 1985. The Traveling Salesman
Problem: A Guided Tour of Combinatorial
Optimization. John Wiley & Sons.
Mak, K.T., Morton, A.J., 1993. A modified Lin-Kernighan
traveling salesman heuristic. In Operations Research
Letters 13(3). Elsevier.
Mallahzadeh, A. R., Oraizi, H., Davoodi-Rad, Z., 2008.
Application of the Invasive Weed Optimization
Technique for Antenna Configurations. In Progress in
Electromagnetics Research.
Mehrabian, R., Lucas, C., 2006. A novel numerical
optimization algorithm inspired from weed
colonization. In Ecological Informatics 1(4), Elsevier.
Michalewicz, Z., Fogel, D. B., 2004.
How to Solve It:
Modern Heuristics. Springer.
Padberg, M., Rinaldi, G., 1991. A branch-and-cut
algorithm for the solution of large-scale traveling
salesman problems. In SIAM Review 33(1).
Rego, C., 1998. Relaxed tours and path ejections for the
traveling salesman problem. In European Journal of
Operational Research 106(2-3). Elsevier.
Reinelt, G., 1991. TSPLIB – traveling salesman problem
library. In ORSA Journal on Computing 3(4).
Renaud, J., Boctor, F.F., Laporte, G., 1996. A fast
composite heuristic for the symmetric traveling
salesman problem. In INFORMS Journal on
Computing 8(2).
Sahraei-Ardakani, M., Roshanaei, M., Rahimi-Kian, A.,
Lucas C., 2008. A Study of Electricity Market
Dynamics Using Invasive Weed Colonization
Optimization. IEEE Symposium on Computational
Intelligence and Games.
Sepehri Rad, H., Lucas, C., 2007. A Recommender
System based on Invasive Weed Optimization
Algorithm. IEEE Congress on Evolutionary
Computation.
Tao, G., Michalewicz, Z., 1998. Inver-over Operator for
the TSP. In Lecture Notes In Computer Science 1498.
Springer.
Vieira, F.C., Neto, A.D.D., Costa, J.A.F., 2003. An
efficient approach to the travelling salesman problem
using self-organizing maps. In International Journal
of Neural Systems 13(2).
ICAART2013-InternationalConferenceonAgentsandArtificialIntelligence
456