SU1649562A1 - Device to solve optimization problems - Google Patents

Abstract

The invention relates to computing and can be used to solve problems of optimizing the transport plan in the transport network. The aim of the invention is to expand the functionality of the device by solving the linear programming transport problem. The device contains a block of 1 set of transportation cost matrix, model 2 of the transport network, block 3 of synchronization, block 4 of priority, multichannel counter 5, input b of the initial installation of the device, input 7 of the start of the device and outputs 8 of the optimal transportation plan from departure points to destinations. Before the start of work, the counter 5 is set in the initial state. Block 1 and model 2. In block 1, the information on transportation costs during transportation between points of departure and destinations is entered. Model 2 lists information about the stock of departure points and the needs of destination points. After a potential unit level potential input to the start 7 of the device, the synchronization unit 3 forms at its output a sequence of pulses, under the control of which the optimum traffic plan is formed at the outputs 8 of the device. 4 il. fe

Description

The invention relates to computing and can be used to solve the problem of optimizing the transport plan in the transport network.

The aim of the invention is to expand the functionality of the device by solving the linear programming transport problem.

FIG. 1 shows a functional diagram of the proposed device; in fig. 2 is a functional block diagram of the task of the transportation cost matrix; in fig. 3 - functional diagram of the transport network model; in fig. 4 - the multi-channel counter is functional.

The device contains a block of 1 set of transportation cost matrix, model 2 of the transport network, block 3 of synchronization, block 4 of priority, multichannel counter 5, input 6 of the initial installation of the device, input 7 of the start of the device and outputs 8 of the optimal transportation plan from departure points to destinations.

The unit 1 for specifying the transportation cost matrix contains a matrix from the software x MON triggers 9. where software is the number of points of departure, and PN is the number of points of destination in the transport network, a matrix from the CIOR of the OR-NOT elements 10, a matrix from the software x monitors 11 a matrix of

TO

you ate

BY x Mon elements And 12, a group of Mon elements OR 13. Element OR 14 and Element 15, and the input 16 of blocking elements To-ro column of block 1 (, ... Mon) is connected to the first inputs of all elements OR NOT 10 To-ro column of the matrix, input 17 of blocking elements of the M-th row of block 1 is connected to the second inputs of all the elements of OR-NOT 10 M-th row of the matrix (, ... ON). the output of the (K, M) -th element of the OR-NOT 10 matrix is connected to the first input (K, M} of the 12th element and to the count resolution input (KM) of the 11th matrix counter, the overflow sign of which is connected to input installation in 1 (K, M) -th trigger 9 matrix, the output of which is connected to the second input (K, M) -th element And 12 matrix, the output of which is connected to the M-input of the K-ro element OR group, the output of which is the output of the attribute of the (K, M) -th element to the minimum set and is connected to the K input of the element OR 14, the output of which is connected to the first input of The element 15, the output of which is connected to the subtracting inputs of all counters AND matrix, the input 18 of the initial installation of block 1 is connected to the installation inputs in O of all the trigger 9 matrix, the clock input 19 of block 1 is connected to the second input of the element 15.

Model 2 of the transport network contains a group of software elements OR 20, a group of software meters 21, a group of software triggers 22, a group of PN elements OR 23, a group of MON counters 24, a group of MON triggers 25, two AND 26.27 elements and an OR element 28, the input 29 of the permission of the modeling of shipments from the M-th point of departure to the K-th destination point of block 2 is connected to the K-th input of the M-ro of the element IL VI of the 20th group and to the M-th entrance of the K-th element of the OR 23 group The output of which is connected to the enable input of the K-th counter of the group 24, the output of the overflow indication of which is connected to input of installation into 1 K-th trigger of group 25, the output of which is output 30 of the sign of satisfaction of the requirements of the destination point of block 2 and connected to the input of the element AND 27, the output of which is connected to the first input of the element OR 28, output M th element OR 20 is connected to the counting input input of the M-th counter of group 21, the output of the overflow indication of which is connected to the installation input of the 1 M-th trigger of group 22, the forward output of which is output 31 of the sign of exhaustion of the M-th stocks point of departure and is connected to the M-input element And 26, Exit is connected to the second input of OR gate 28 whose output is

the output 32 of the sign of exhaustion of stocks of all points of departure and / or the needs of all destinations of model 2, the initial installation input 33 of which is connected to the installation inputs in O of all triggers of 22 and 25 groups, the clock input 34 of model 2 is connected to the subtractive inputs of all counters 21 and 24 groups.

Multichannel counter 5 contains a matrix from software x monitors 35, and the input 36 of the operation resolution (K, M) of the channel of the counter 5 is connected to the input of the resolution resolution (K, M) of the counter 35 of the matrix, the information output of which is the information output 37 (K.M) -th channel of the multi-channel counter 5, the initial setup input 38 and the clock input 39 of which are connected to the installation inputs to O and the summing inputs, respectively, of all the counters 35 of the matrix.

The device works as follows.

Before working on the input 6 of the initial setup, a pulse of the level of a logical unit is applied. In this case, all channels of counter 5 are set to O and the block 1 assigns the transport cost matrix and model 2 of the transport network, is reset to the initial state. In block 1, the transport cost information is transferred in transit from the M-th point of departure to the K-th point destination. Model 2 lists information about the stock of departure points and the needs of destination points.

To the input 7 of the start-up of the device, a pulse of a level of logical unit is applied. In this case, the synchronization unit 3 forms at its output a sequence of pulses of the level of a logical unit. When the clock pulses arrive at its input, unit 1 selects the minimum element of the transportation cost matrix and forms the potential (or potentials, if there are several equal elements) of the level of the logical unit at the corresponding output. At the same time, block 5 selects the direction of transportation with the highest priority. When a clock pulse arrives at its input, model 2 simulates carriage in a defined direction. After the stocks of the point of departure and / or the needs of the point of destination are exhausted, the potentials of the level of the logical unit are applied at the corresponding outputs of the model 2. At the same time, unit 1 excludes from the analysis (blocks) those rows (columns) of the matrix of transportation costs that correspond to the transport directions, the modeling of which is completed. The operation of the device continues similarly to those

until the stocks of all points of departure and / or the needs of all points of destination have been exhausted. At the same time, unit 3 stops the formation of pulses at its exit and the information at the output of multichannel counter 5 corresponds to the optimal transportation plan from the departure point M to the K-th destination.

Unit 1 of the task of the matrix of transportation costs works as follows.

Before starting work, the initial unit input 18 serves as a pulse of the level of a logical unit. In this case, all matrix triggers 9 are set to O. Meters 1t are used to record transportation costs for shipments from the departure point to the K-th destination. When the pulses of the level of the logical unit of the counter 11 arrive at the clock input t9, the values contained in them are successively reduced by one. When going through zero, the counter 11 is set to 1 its corresponding trigger 9. At the same time, the flow of pulses to the inputs of the counters 11 is stopped, and the flow to the inputs 16 of the potential level of the logical unit continues.

Model 2 of the transport network works as follows.

Before starting work, an impulse level of logical unit is applied to the input 33. In this case, all the triggers 22 and 25 are set to O. Counters 21 and 24 record information about the stocks of the points of departure and the needs of the points of destination, respectively. When the pulses of the logical unit of the counter 21, 24, whose operation is allowed by the presence of the potential of the level of the logical unit from the outputs of the corresponding elements OR 20, 23, are received at the input, the values contained in the pulses are reduced by one (for each pulse). M-ro point of departure to the K-th destination). When counters 2t, 24 go over zero, the corresponding triggers 22, 25 are set to 1. At the same time, at outputs 30, 31, signs of satisfaction of needs and / or depletion of stocks are formed. After all the triggers 22 and / or 25 are set to 1, the potential of the level of the logical unit at exit 32 is a sign of the depletion of stocks of all departure points.

and / or the needs of all destinations.

Claims (1)

Invention Formula An apparatus for solving optimization problems, comprising a transport cost matrix setting unit, a transport network model, a multichannel counter and a synchronization unit, the start input of which is the start-up input of the device, the initial installation input of which is connected to the installation input on the multichannel counter and to the inputs of the initial installation of the transport network model and matrix setting unit transport costs, characterized in that, in order to expand the functionality of the device by solving the linear programming transport problem, a priority block is inserted into it, and the output of the synchronization unit is connected to the clock inputs of the multichannel counter, the task block of the transport cost matrix and the clock input of the transport model network output the sign of exhaustion of stocks of the M-th point of departure of which (, ..., software, where software is the number of points of departure in the transport network) is connected to the input of the sign of blocking elements of the M-th row of the matrix block assigning a matrix of transportation costs, the output of the sign of satisfying the needs of the K-th destination model of the transport network (, ..., MON, where MON is the number of destinations in the transport network) is connected to the input of the blocking attribute of elements K-ro of the block of the matrix of the transport matrix costs, the output of the attribute of belonging (K, M) of the th element to the minimum set of which connected to the (K.M) th input of the priority block, the output of the selection flag (the K.M} position of which is connected to the simulation enable input (K, M) of the transport model of the transport network and to the input permitting the (K, M) th channel of the multichannel counter, (K, M) whose information output is the output of the volume of the optimal transportation plan from the M-th point of departure to the K-th destination of the device, the output of the exhaustion sign of all, points of departure and / or needs of all destinations of the transport network model are connected to the stop input of the synchronization unit. . FSh.1 9T t Yes//  Mffff P / jupe # FIG. 2 29at Tpp J 36ts $ ipa1 $ 6 (2 Zbpag f / TOf 37th leg m Hfst No 1 30 pn Fig  / Zb / ln 36popn . -. Sv 39 -3№ $ G2PN 38 39 d- 35 / wrt Fy Z7 / 7OR #