Geodesic
On constructing the shortest circuits on a~set of line segments
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 9 (2006) no. 3, pp. 241-252.

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper deals with the problem of defining the Hamiltonian cycle on segments by the ant colony algorithm. Parameters and properties of this algorithm as applied to the cutting chart for the NC machine and an arbitrary set of segments are studied. 
@article{SJVM_2006_9_3_a3,
     author = {N. D. Ganelina and V. D. Frolovskii},
     title = {On constructing the shortest circuits on a~set of line segments},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {241--252},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/}
}
TY  - JOUR
AU  - N. D. Ganelina
AU  - V. D. Frolovskii
TI  - On constructing the shortest circuits on a~set of line segments
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2006
SP  - 241
EP  - 252
VL  - 9
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/
LA  - ru
ID  - SJVM_2006_9_3_a3
ER  - 
%0 Journal Article
%A N. D. Ganelina
%A V. D. Frolovskii
%T On constructing the shortest circuits on a~set of line segments
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2006
%P 241-252
%V 9
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/
%G ru
%F SJVM_2006_9_3_a3
N. D. Ganelina; V. D. Frolovskii. On constructing the shortest circuits on a~set of line segments. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 9 (2006) no. 3, pp. 241-252. http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/

[1] Katangur A. K., Akkaladevi S., Pan Y., Fraser M., “Applying Ant Colony Optimization to Routing in Optical Multistage Interconnection Networks with Limited Crosstalk”, Proc. of the 18th International Parallel and Distributed Processing Symposium, 2004, 163a

[2] Leipala T., Nevalainen O., “A plotter sequencing system”, Comput. J., 4:22 (1979), 313–316 | DOI

[3] Mukhacheva E. A., Verkhoturov M. A., Martynov V. V., Modeli i metody rascheta raskroya-upakovki geometricheskikh ob'ektov, UGATU, Ufa, 1998

[4] Frolovskii V. D., Pushkareva G. V., “Avtomatizirovannoe proektirovanie optimalnykh traektorii dvizheniya ispolnitelnogo instrumenta teplovoi rezki metalla na oborudovanii s ChPU”, Tr. Mezhdunar. nauchno-tekhnicheskoi konf. “Informatsionnye sistemy i tekhnologii”, T. 1, Izd-vo NGTU, Novosibirsk, 2003, 149–152

[5] Frolovsky V., Pushkaryova G., “Metal cutting motion optimization for NC-programs design, using genetic algorithms”, Proc. of the 6th International Conference 3IA'2003 in Computer Graphics and Artificial Intelligence (May 2003), Limoges (France), 2003, 143–152

[6] Dorigo M., Gambardella Luca M., “Ant-Q: A reinforcement learning approach to the traveling salesman problem”, Proc. of ML-95. Twelfth International Conference on Machine Learning, Morgan Kaifmann, 1995, 252–260

[7] Colorni A., Dorigo M., Maniezzo V., “Distributed optimization by Ant Colonies”, Proc. of ECAL91. European Conference on Artificial Life, Elsevier Pulishing, Paris, 1992, 134–142

[8] Dorigo M., Maniezzo V., Colorni A., “The Ant System: optimization by a colony of cooperating agents”, IEEE Transactions on Systems. Man and Cybernetics. Part B, 26:1 (1996), 1–13 | DOI

[9] Pushkareva G. V., “Issledovanie i primenenie bionicheskikh metodov i modelei dlya avtomatizirovannogo proektirovaniya marshrutov obkhoda geometricheskikh ob'ektov”, Tr. 15-i Mezhdunar. konf. po kompyuternoi grafike i ee prilozheniyam. Grafikon-2005, ZAO RITs “Prais-kurer”, Novosibirsk, 2005, 255–262

[10] A. I. Galushkin, Ya. Z. Tsypkin, Neironnye seti: istoriya razvitiya teorii. Kn. 5: Ucheb. Posobie dlya vuzov, IPRZh, M., 2001