This program "OPTIMIST" solves the problem of network design and the
routine problem minimizing the cost or the total channels length
The network to be created is intended to transfer
information flows between subscribers. For every pair of
subscribers a route (path through the network
channels) is prescribed. The network channels can be commutated (switched) in
some points (nodes of the network) to join the pair of
subscribers. The number of switchings is restricted. A single
route or a pair of channel-independent routes can be constructed
for every pair of subscribers. We have to assign the number of
channels for every channel direction. The probability of fault
for single channel is restricted.
This program was designed for practical using. It allows to
estimate the consequences of the disrepair and planned network
modification. The program allows to vary network and to plan
future modification as well as to predict consequences of
general scaled information flows increase in the future.
The program is used in practical work of the government
organizations. It has operated with the real information on
telephone networks of the USSR and Russia. The program permits
to solve the problem of recommutation of the Soviet Union and
Russia telephone networks.
The program was written using 'C' and Assembler languages.
Specially designed network representation for calculations to
Special methods provide the calculations speed to increase and
round-off error to limit.
8000 arcs/pairs under 640K of conventional memory.
Interactive data input, correction.
Arbitrary choice of the permissible probability of fault for
Interactive results viewing.
Full results report.
Fast obtaining of rough results.
High speed calculations.
Round-off error level uniformly bounded independent upon
calculation complexity. The information flow calculation
round-off error does not exceed 0.000003 erlang.
Node information: name; code; latitude; longitude;
indicator of being in use; indicator for being used for
Direction/subscriber information: beginning node
code; ending node code; information flow; indicator of
being in use;
Probability of fault for channel.
Optimization function (cost or length).
Number of routes.
First to second route flow ratio (for two routes
Maximal number of channels in the route.
Maximal number of the algorithm iterations.
Total channels cost or total channels length.
Number of channel directions in use.
Average network transit ratio : ratio of the transit
information flows to the own information flows of nodes.
For every node::
Number of nodes, the communication required with.;
Own information flow - total required flow to the other
Transit ratio : ratio of the transit information flows to
the own information flows.
Number of channels directions in use.
Total number of channels for all the channels
For every channels direction in use:
Total information flow.
Number of channels.
Channel cost or length.
For every subscribers pair:
Required information flow.
Channels direction using mark.
The sequence of nodes to commutate through.
Probability of fault for pair.
Some additional features:
Designing of one route or two route without common channels.
Optimization of the cost or total channels length function.
Maximal number of channels in the route is from 2 to 15. There
is a special case of unrestricted channel number.
Easy and flexible data correction.
Input data preparation and correction with the help of the
program or import from the text file.
Temporary and permanent including/excluding of nodes/arcs. This
action does not require changes in data file.
Interruption of calculations and continuation of calculations.
Saving and restoring the calculated results. Repeated using
of the calculated results does not require the new calculation.
Viewing the results on screen. There are four kinds of results
Printing of pictures and results.
Programming languages - C and Assembler.
IBM-compatible personal computer XT/AT with follows type of monitor : EGA, VGA, MCGA
Any printer for getting hard copies;
Microsoft - compatible mouse;
Operational system MS-DOS version 3.0 or higher, Windows 95, Windows 98, Windows 2000 and futher;