Search

To address the issue of multiple closed circuits arising from applying the traditional Hungarian algorithm to the travelling salesman problem (TSP), a breaking mechanism was proposed, leading to the development of the Break-Cycle Hungarian Algorithm. By adopting the description method of the assignment problem for modeling the TSP and establishing the conversion relationship between them, it is demonstrated that a sufficient and necessary condition for a feasible solution to the TSP is that the feasible solution of the corresponding assignment problem, combined with auxiliary edges, contains only one cycle. The effectiveness of the algorithm was verified through testing and comparative analysis on six standard travelling salesmen, showing that the improved Hungarian algorithm can effectively solve the TSP across various datasets. [ABSTRACT FROM AUTHOR]

Due to cope with relying on controllers badly and lacking of quantitative models to assist decision-making in air traffic flow management, this paper studied the delay optimization model and its solving algorithm for route network. Firstly, it established a traffic flow assignment model with the objective function of minimum flight time and capacity constraints. Secondly, considering that classical Hungarian algorithm was only suitable for small and medium-sized operations, it made the improvement of the calculation of efficiency matrix by making the maximum probability of the number of zero elements in the circle equal to the order of the efficiency matrix. Next, it constructed the cost function of the en-route by using the MIMIC queuing theory model. The function, which replaced the constant efficiency value in the efficiency matrix with a variable cost, made the efficiency matrix change with time and flow. Finally,it took part airspaces of China and the actual operational data of 2016 as examples. The results show that the algorithm can increase the access capacity by 8. 372% and the departure capacity by 8. 999%; In terms of delay optimization,it can reduce the average delay of each aircraft. In terms of algorithm performance, it has less iterations and less solution time than the classical Hungarian algorithm, and is more suitable for actual control operation. [ABSTRACT FROM AUTHOR]

A model of equipment maintenance task allocation is established for lack of constraint conditions of existing wartime equipment maintenance task allocation. The model can be used for optimal decision of maintenance task allocation in the case of time constraint and maintainability limitation. And the equipment repair time, maneuver time and maintainability are comprehensively considered in the model. A two-stage heuristic algorithm, including genetic algorithm and neighborhood searching method, is designed to solve the model. The effectiveness of the proposed algorithm is verified through example analysis and comparison. [ABSTRACT FROM AUTHOR]

Copyright of China Sciencepaper is the property of China Sciencepaper and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)