Evolutionary-Fragmentary Model of the Routing Problem

One of the variants of the routing problem on a plane integer lattice is considered. It is shown that this problem can be represented as a problem of searching for words with certain properties over a finite alphabet. In turn, the problem of finding optimal words can be considered as a problem of fr...

Full description

Saved in:

Bibliographic Details
Published in:	Cybernetics and systems analysis Vol. 51; no. 3; pp. 432 - 437
Main Authors:	Kozin, I. V., Kryvtsun, O. V., Pinchuk, V. P.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2015 Springer Springer Nature B.V
Subjects:	Artificial Intelligence Combinatorial analysis Combinatorics Control Cybernetics Density Feasibility Lattices Lower bounds Mathematical analysis Mathematics Mathematics and Statistics Optimization Optimization algorithms Processor Architectures Routing Software Engineering/Programming and Operating Systems Studies Systems Theory combinatorial optimization routing density routing problem fragmentary structure evolutionary model
ISSN:	1060-0396, 1573-8337
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!