Аннотации:
© 2019, Institute of Advanced Scientific Research, Inc.. All rights reserved. The algorithm is implemented in accordance with three stages: data entry, the formation of position and movement matrixes, and the selection of the optimal transport flow option. At the first stage, the initial and final coordinates of movement, coordinates of vehicles are introduced. According to the coordinates of vehicles, vehicle position matrices are formed between points of a flexible production system (FPS). The matrix of travel times is based on data on the movement of vehicles within the FPS. Then, alternately for each vehicle, transportation time is calculated. To do this, alternative transportation times, selected by the initial and final coordinate of movement, are multiplied by the corresponding elements of the position matrixes of the remaining vehicles. At the end of the cycle, the minimum value is selected from the obtained set of transportation times corresponding to the analyzed vehicles (respectively, and flows). Accordingly, for a given initial and final coordinate of movement, optimized traffic flow, vehicle and transportation time are determined. In FPS, with a large range of manufactured products and an ever-changing package of orders, it is necessary to create the discipline of servicing the package of orders and choosing the technological route option from possible alternative ones.
