A Comparison of Computation Times for Various Starting Procedures, Basis Change Criteria, and Solution Algorithms for Distribution Problems

1971 ◽  
Author(s):  
D. Karney ◽  
D. Klingman ◽  
Fred Glover ◽  
A. Napier
Keyword(s):  
Solution Algorithms ◽  
Basis Change ◽  
Distribution Problems

A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems

1974 ◽  
Vol 20 (5) ◽  
pp. 793-813 ◽  
Author(s):  
Fred Glover ◽  
D. Karney ◽  
D. Klingman ◽  
A. Napier
Keyword(s):  
Transportation Problems ◽  
Solution Algorithms ◽  
Basis Change

Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time

1998 ◽  
Vol 1645 (1) ◽  
pp. 170-175 ◽  
Author(s):  
Ismail Chabini
Keyword(s):  
Large Scale ◽  
Shortest Paths ◽  
Transportation Systems ◽  
Solution Algorithm ◽  
Shortest Path Problems ◽  
Discrete Dynamic ◽  
Solution Algorithms ◽  
Dynamic Network Models ◽  
Early Results ◽  
Run Time

A solution is provided for what appears to be a 30-year-old problem dealing with the discovery of the most efficient algorithms possible to compute all-to-one shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models that arise in dynamic transportation systems, such as intelligent transportation systems (ITS) applications. The all-to-one dynamic shortest paths problem and the one-to-all fastest paths problems are studied. Early results are revisited and new properties are established. The complexity of these problems is established, and solution algorithms optimal for run time are developed. A new and simple solution algorithm is proposed for all-to-one, all departure time intervals, shortest paths problems. It is proved, theoretically, that the new solution algorithm has an optimal run time complexity that equals the complexity of the problem. Computer implementations and experimental evaluations of various solution algorithms support the theoretical findings and demonstrate the efficiency of the proposed solution algorithm. The findings should be of major benefit to research and development activities in the field of dynamic management, in particular real-time management, and to control of large-scale ITSs.

SELECTION OF CONTROLLABLE PARAMETERS OF THE BINARY DATA ARRAY DETECTION ALGORITHM IN THE INTEGRATED MANAGEMENT SYSTEM

2021 ◽  
Vol 4 (3) ◽  
pp. 11-18
Author(s):  
Khakimjon Zaynidinov ◽  
◽  
Odilbek Askaraliyev
Keyword(s):  
Management System ◽  
Binary Data ◽  
Integrated Management ◽  
Research Work ◽  
Hash Functions ◽  
Experimental Tests ◽  
Detection Algorithm ◽  
Identification Algorithm ◽  
Solution Algorithms ◽  
Selection Of

The article discusses the selection of parameters for the algorithm for determining binary data arrays included in the control system, developed by the authors using independent substitution methods. Based on the analysis of the algorithms of non-cryptographic hash functions, the hash function based on the linear matching method was selected as the basis for independent substitution methods. Simplified schemes of algorithms developed for creating and comparing identifiers using a set of basic hash functions are given. An array of binary data was selected and based on the appropriate values for the size of the divisible blocks and the number of basic hashfunctions used for independent substitutions. The selection of binary data arrays in information systems integrated into the management system was done for the purpose of intellectual processing of incoming data. The properties of the array of data entering integrated systems are studied. The authors conducted experimental tests in the selected direction and presented the results of similarity assessment measurements for various parameters of the identification algorithm. In addition, the article conductedexperiments on the object of study using the selected mathematical model, based on the analytical conclusions. Initiator elements are studied and analyzed using a set of hash functions. An algorithm for comparison of selected identifiers has been developed. A generation algorithm has been developed to demonstrate and test the proposed solution. Algorithms based on analysis and experiments, and methods for selecting binary data arrays using the ash function have been experimentally tested. Based on the results, the indicators are shown. Based on the results obtained, the analytical conclusions and problem solutions of the research work were recognized

scholarly journals Professional competence development when teaching computational informatics.

2021 ◽  
Vol 16 (5) ◽  
pp. 2575-2585
Author(s):  
Makhabbat Revshenova ◽  
Esen Bidaibekov ◽  
Victor Kornilov ◽  
Guldina Kamalova ◽  
Shirinkyz Shekerbekova ◽  
...  
Keyword(s):  
Graduate Students ◽  
Differential Equations ◽  
Professional Competence ◽  
Finite Difference Methods ◽  
Computational Thinking ◽  
Computational Algorithms ◽  
Mathematics Methods ◽  
Computational Mathematics ◽  
Solution Algorithms ◽  
Mathematical Problems

Bachelors and graduate students are offered in the course of teaching computational informatics, the ability to solve non-standard mathematical problems, which, as a rule, are not included in the content of teaching computational informatics. The article aimed to analyze the application effectiveness of non-standard mathematical problems in the course of teaching computational informatics, elaboration of constructive computational solution algorithms of inverse problems for differential equations, during which the bachelors and graduate students develop own professional competencies. The research conducted a review of previous literature on the topic. Formulation of the inverse problem for differential equations for the investigation of which the computational mathematics finite difference methods are applied, is presented. In the course of investigation, it was revealed that at elaborating the constructive computational algorithms of its solution, the bachelors and graduate students develop not only fundamental knowledge in the field of applied and computational mathematics, computational informatics methods, but also develop the professional competences, including computational thinking. Key words: professional competence; computational informatics; computational mathematics methods; non-standard.

scholarly journals An Airline Scheduling Model and Solution Algorithms

2011 ◽  
Vol 18 (2) ◽  
pp. 257-266
Author(s):  
Ahmed Thanyan AL-Sultan ◽  
Fumio Ishioka ◽  
Koji Kurihara
Keyword(s):  
Airline Scheduling ◽  
Solution Algorithms ◽  
Scheduling Model
Sign in / Sign up

Export Citation Format

Share Document