8 results about "Sorting problem" patented technology

A k-parallel row sorting problem solving method considering multiple channels relates to the technical field of disassembly line layout, and mainly comprises the following steps: determining an objective function, calculating channel coordinate information in a region, generating a population P1 and randomly generating a population P2 by using a greedy strategy, combining the population P1 and the population P2 into an initial population P, calculating the fitness of all solutions in the initial population, and obtaining a k-parallel row sorting problem; screening an elite solution, selecting solutions except the elite solution in the initial population based on the fitness by using a roulette mechanism to execute genetic circulation, sequentially carrying out crossover and mutation operation based on Q-learning, combining the population with the elite solution after mutation with the population P1 and the population P2 to update the population, according to the maximum number of iterations, it is judged that iterative calculation continues or a result is output; according to the variable domain genetic algorithm based on Q-learning, an optimal solution for solving kPROPP can be provided in a short time, the solving efficiency of the variable domain genetic algorithm is greatly superior to that of a conventional accurate solver, the solving effect of the variable domain genetic algorithm is superior to that of other methods, and reliable support is provided for solving the problem of parallel layout planning.

The invention discloses a heterogeneous cascade target system key node strike sorting method and system oriented to fuzzy conditions. The method specifically comprises the steps that firstly, a heterogeneous cascade target system key node strike sorting model is constructed; then key node strike sorting based on fuzzy conditions is carried out; carrying out key node strike sorting of the heterogeneous cascade target system based on an optimization algorithm; and finally, striking key nodes in the heterogeneous cascade target system based on the determined network. According to the method, the strike sequence of the key nodes in the large-scale target system can be efficiently and accurately determined, the uncertainty problem can be converted into the node strike sorting problem of the known environment, the problem of breaking of the uncertain target system is effectively solved, and a basis is provided for networked analysis of a military information system.

The invention relates to the technical field of program testing, in particular to a seed scheduling method and system for multi-objective optimization in grey box fuzzy testing, and the method comprises the steps: dividing related indexes of seeds into state related indexes and state independent indexes; modeling a priority ranking problem of the seeds into a multi-objective optimization problem according to state related indexes, calculating Pareto leading edges of the seeds based on a non-dominated ranking algorithm, and screening out the seeds with high priorities; selecting seeds according to a seed selection basic principle; determining the weight of each index by using an analytic hierarchy process according to the state-independent indexes, evaluating the quality of the seeds through an approximate ideal solution algorithm, and distributing reasonable energy for the seeds; and based on the priority and the energy distribution result, selecting the seeds for mutation to generate a new test case. According to the method, seed priority division and energy distribution are optimized, so that the seed scheduling efficiency in grey-box fuzzy testing is remarkably improved, and accurate testing is realized at a higher code coverage rate and a faster vulnerability discovery speed.

The present invention provides a search engine-based reference material and standard product retrieval and sorting, which relates to the technical field of data processing, and includes: obtaining search keywords input by a user, constructing a reference material and standard product knowledge base, mapping to a low-dimensional semantic space, calculating the semantic relevance of the search keywords and reference material knowledge, constructing a heterogeneous information network, generating a comprehensive relevance measure, performing multi-granularity semantic matching, and obtaining candidate search results; assigning adaptive feature weights to structured features corresponding to the candidate search results, performing independent clustering, obtaining subspace clustering results, performing optimization, obtaining a global optimal clustering result, mining high-order semantic association features and performing cross-category semantic association, and generating high-quality search results; performing low-rank decomposition, obtaining an initial comprehensive score, modeling the sorting problem as a Markov decision process, determining an action space and a state space, constructing a reward function and determining a sorting position, and obtaining an optimal sorting result.

The application discloses a multi-aircraft multi-site delivery scheduling planning method, a storage medium and equipment, and belongs to the technical field of aircraft delivery scheduling planning.The application solves the problem that the existing method cannot obtain an optimal scheduling scheme for a large-scale aircraft to visit multiple sites.The application considers a scheduling planning problem of multiple aircrafts successively arriving at multiple sites, considers processes such as unloading, loading, refueling and maintenance, optimizes the visiting sequence of the aircrafts to each site, establishes a multi-aircraft multi-site delivery scheduling model, proposes a discrete data iterative sorting algorithm based on a neural network for a large number of aircraft sorting complex problems, solves the sorting problem of high-dimensional input through layer-by-layer decomposition iteration, realizes the target of the shortest total time consumption of material delivery, and obtains a better delivery scheduling scheme.The method can be applied to multi-aircraft multi-site delivery scheduling planning.

The invention relates to the technical field of computers, in particular to an intelligent processor-oriented circuit automatic generation method for solving a sorting problem, which comprises the following steps of: determining three types of structures of TPU, LPU and NPU of a target intelligent processor; three sets of automatic design modes for automatically designing and sequencing circuits are developed for TPU, LPU and NPU; determining index constraints of the target sorting module, including area, power consumption, frequency, bandwidth, capacity, throughput and a weight ratio among the index constraints; and automatically generating a netlist of the circuit, actual parameters of each index and instructions of generated sequencing circuit module interfaces according to given constraints by utilizing an automatic design program. Aiming at TPU, a sorting structure taking a systolic array sorter as a main body is adopted; aiming at the NPU, searching an optimal sorting structure by adopting a search algorithm; for the LPU, an original LUT-based lookup tree is adopted to complete a partial sorting task, so that the workload and financial cost of manual design are greatly reduced.

Some embodiments of the disclosure provide systems and methods for improving sorting and routing of objects, including in sorting systems. Characteristic dimensional data for one or more objects with common barcode information can be compared to dimensional data of another object with the common barcode information to evaluate a classification (e.g., a side-by-side exception) of the other object. In some cases, the evaluation can include identifying the classification as incorrect (e.g., as a false side-by-side exception).

The invention discloses a modular man-machine collaborative express sorting system and method based on an iterative algorithm. The system comprises an annular main conveying line, a plurality of standardized sorting modules arranged along the annular main conveying line and a system control center. And each sorting module comprises a cache region, a man-machine cooperation station and a rotatable turntable with a plurality of sorting grooves. The core of the method is that a system control center operates a set of iterative sorting optimization algorithm. According to the algorithm, containers to be processed are dynamically distributed to all stations through multi-round iterative calculation according to global scanning express data, the current station of the system and the number of sorting grooves, and target delivery areas are dynamically distributed or combined for the sorting grooves of all the stations. Through the iterative process of'distribution-sorting-transfer-redistribution ', the problem of complex sorting when the number of delivery areas is far greater than the number of physical sorting grooves is efficiently solved. According to the method, the scale of the sorting system is flexible and adjustable, the sorting strategy is intelligently and dynamically optimized, and excellent balance is achieved among cost, efficiency and flexibility.