67results about How to "Improve solution quality" patented technology

The invention discloses an optimization method for solving an omni-channel logistics distribution problem. In a first stage, a Lagrange relaxation technology is used to solve a LAP (Location-allocation Problem) problem. In a second stage, adaptive large-scale neighborhood search is used for solving a multi-vehicle-type vehicle path problem, a feasible solution can be searched in a large range in a solution space through one group of simple destruction and reconstruction algorithms, and a situation of falling into local optimum can be effectively avoided. Meanwhile, a simulated annealing acceptance criteria realized in the adaptive large-scale neighborhood search can guarantee the quality of a solution and the convergence of the algorithm, a result is output after the algorithm is executed for an appointed iteration number, a time constraint requirement can be met, and a good vehicle distribution scheme is solved for enterprises in limiting time. The simpleness of the Lagrange relaxation technology is combined with the efficiency of the adaptive large-scale neighborhood search, so that the integral solving efficiency of a mixed algorithm is high, and the problem of omni-channel logistics distribution can be effectively solved.

A method for server allocation in a Web server "farm" is based on limited information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach of "discounting the future". Specifically, when the policy faces the choice between a guaranteed benefit immediately and a potential benefit in the future, the decision is made by comparing the guaranteed benefit value with a discounted value of the potential future benefit. This discount factor is exponential in the number of time units that it would take a potential benefit to be materialized. The future benefits are discounted because by the time a benefit will be materialized, things might change and the algorithm might decide to make another choice for a potential (even greater) benefit.

An airplane flight path planning method based on the pigeon-inspired optimization algorithm includes steps of establishing an uncertainty track prediction model, determining the path to be optimized within the specified area, and obtaining an optimal path using the pigeon-inspired optimization algorithm. The pigeon-inspired optimization algorithm uses map and compass operators and performs landmark operations to obtain the optimal path. The device that performs the path planning includes an access module for getting the regional path information; a building module for setting up the trajectory prediction model including uncertainties; a determining module, which utilizes the regional path information and the trajectory prediction model to determine the trajectories which need optimization; and an optimization module, which uses the pigeon-inspired optimization algorithm to optimize the trajectories.

The invention discloses a large-scale operation workshop scheduling method based on bottleneck equipment decomposition. The large-scale operation workshop scheduling method based on the bottleneck equipment decomposition comprises the following steps of (1) acquiring data and modeling; (2) carrying out recognition on bottleneck equipment based on a key path method; (3) sorting and encoding the bottleneck equipment and non-bottleneck equipment; (4) generating an initial chromosome population; (5) carrying out cross and mutation operations on the chromosome population; (6) inoculating an immune operator to the chromosome population; (7) carrying out decoding and fitness value calculation operations on chromosomes; (8) updating an optimal chromosome and an optimal fitness value of an algorithm; (9) judging whether a method ending rule is achieved or not, starting a step (10) if the method ending rule is achieved, and otherwise, jumping to the step (5) to carry out the next iteration; (10) finding out the optimal chromosome from the step (9) to decode, and obtaining a scheduling command to schedule. According to the large-scale operation workshop scheduling method based on the bottleneck equipment decomposition, which is disclosed by the invention, a satisfactory scheduling scheme can be obtained in a shorter time, the production efficiency of an operation workshop can be improved, and the large-scale operation workshop scheduling method based on the bottleneck equipment decomposition can be applied to scheduling management and optimization of the production process of the workshop.

A computer-based airplane flight path planning method based on the pigeon-inspired optimization (PIO) algorithm includes steps of establishing an uncertainty prediction model, determining the path to be optimized, and obtaining an optimal path using the PIO algorithm for a flight controller onboard to execute. The PIO algorithm treats a pigeon flock as a scale-free network, applies map and compass operators to the scale-free network, and performs landmark operations to obtain the optimal path. The device that performs the path planning includes an access module for obtaining the regional environment information and a flight controller onboard the airplane. The flight controller includes a building module for setting up the trajectory prediction model including uncertainties; a determining module to determine the trajectories which need optimization; an optimization module, which uses the PIO algorithm to optimize the flight path; and a computer memory module.

The invention relates to a multi-population simulated annealing hybrid genetic algorithm based on similarity expelling. The multi-population simulated annealing hybrid genetic algorithm includes the following steps: coding is carried out; initialization parameters are set; initial populations are created; fitness values are calculated; selecting operation is carried out; interlace operation is carried out; mutation operation is carried out; gene overturning operation is carried out; simulated annealing Metropolis rules are judged; migration operation based on similarity expelling is carried out; optimal storage is carried out; judgment is ended. The migration operation based on similarity expelling particularly includes the following steps: calculating the fitness values of individuals in a source population and a target population; selecting the individual with the largest fitness value from the source population to serve as the individual to be immigrated; conducting similarity calculation; conducting expelling replacement. The multi-population genetic algorithm with simulated annealing operation can improve the local search capability of the multi-population genetic algorithm, and the algorithm can search for approximate solutions even though optimal solutions to a larger extent. The individual similarity judgment is additionally carried out, attention is paid to differences between the individuals, the diversity of populations is maintained, premature convergence of the genetic algorithm is avoided, the solving quality of the algorithm is improved, and the algorithm is closer to the optimal solutions.

The invention discloses a two-stage initiative separation method based on normalized spectral clustering and constrained spectral clustering. The method comprises the steps of: in the first stage, recognizing coherent generator groups by using normalized spectral clustering and forming pairwise constraints by using the coherent generator groups; and in the second stage, finding separation sections satisfying the pairwise constraints and with the minimum active power flow shock by using constrained spectral clustering. When a system needs to be separated into a plurality of islands, a recursive bisection method can be adopted. The algorithm provided by the invention takes two factors, i.e., generator coherency and the minimum active power flow shock, into account, and the initiative separation problem can be calculated in real time without simplifying system topology.

The invention relates to a control method for solving a flexible job shop scheduling problem based on a genetic algorithm, which is divided into six parts such as encoding and decoding, initial population generation, crossover, mutation, fitness calculation and selection. The control method is characterized in that a segmented encoding method is adopted, chromosome encoding is divided into a machine selection part and a procedure selection part, and chromosomes are decoded according to a certain mode so as to acquire corresponding manufacturing procedures and corresponding manufacturing machines; an initial population is generated by adopting a mode of combining various search modes; and fitness calculation aims to solve a problem of how to solve the execution time of certain legal scheduling and judge the quality of the scheduling. The control method provided by the invention not only has great advantages in solving quality, but also has the same excellent performance in improving the solving speed and processing a large-scale flexible job shop scheduling problem.

The invention discloses a hybrid ant colony algorithm for a VRP problem and an implementation system thereof. The algorithm comprises the steps of (S1) allowing all ants in an ant colony to independently construct a solution of the VRP problem and optimizing the solution by using a local search operation, (S2) performing a pheromone perturbation strategy to adjust a pheromone matrix if an iterative optimal solution remains unchanged in successive iterations, wherein the iterative optimal solution is an optimal solution in solutions constructed by all ants in a single time of iteration, (S3) starting a simulated annealing algorithm to search for a better solution if the optimal solution remains unchanged in the successive iterations so far and taking an optimal solution so far of the ant colony algorithm as an initial solution, (S4) updating the pheromone matrix according to the quality of an ant solution and updating the optimal solution so far, (S5) repeating the steps (S1), (S2), (S3) and (S4) until an obtained optimal solution satisfies a termination condition. According to the hybrid ant colony algorithm for a VRP problem and the implementation system thereof, the purposes of high-quality solution and strong robustness for the VRP problem can be achieved.

The invention belongs to the technical field of network communication, and discloses a network reliability model and a hybrid intelligent optimization method. According to the invention, the network reliability model adds related evaluation indexes of the network invulnerability, optimization design is performed from the two aspects of survivability and invulnerability, a node is allowed to lose effectiveness with a certain probability in the optimization design, optimization design is performed on the a network topology structure, and a defect of single limiting condition of an existing reliability model is overcome, thereby being more perfect and confirming to an actual application scenario. The optimization method disclosed by the invention provides a hybrid intelligent algorithm combining a generic algorithm and an ant colony algorithm in allusion to the characteristics that the generic algorithm is poor in local search ability but high in overall search ability and that the ant colony algorithm is poor in total search ability but high in local search ability, thereby making the best of the two algorithms, overcoming intrinsic defects of the single intelligent algorithm, and improving the solving quality of a solution.

The invention discloses a multi-target urban logistics distribution path planning method. The method comprises the following steps: decomposing a three-target vehicle path problem with a time window into a plurality of single-target sub-problems through a group of uniformly distributed weight vectors; initializing the sub-problems by adopting a heuristic strategy; generating a filial generation for the sub-problem by using an evolutionary operator, and designing a target-oriented neighborhood operator to be combined with a variable neighborhood descent algorithm to serve as a local search strategy so as to improve the solving quality of the sub-problem; updating the solution of the sub-problem by adopting a Chebyshev aggregation function; optimizing a non-dominated solution in the archivesby adopting an external archive strategy based on a sorting and congestion degree mechanism; and S3, repeating the steps S3 to S4 until the set maximum number of iterations is reached, and providinga group of feasible vehicle distribution schemes for multi-target urban logistics distribution. Compared with single-target optimization, the method can provide richer decision information for a decision maker, and considers the quality of the solution on the premise of ensuring the convergence and diversity of the algorithm.

The invention discloses an upper multi-objective test case priority sorting method aiming at the multi-objective test case priority sorting problem in regression testing. Firstly, the ordered sequenceof test case numbers is used as particle code, and the set of test case number sequences is used as particle swarm to generate initial population randomly. The average branch coverage and effective execution time of the test case sequence are used as fitness evaluation functions. Then a new individual is generated by using the method of epistatic crossover, and the particles in the non-dominatedsolution set are used as the global optimal particles. Finally, when the number of iterations reaches the maximum number of iterations, the individual in the non-dominated solution set is the optimalmulti-objective ranking result. Compared with the existing method, the invention provides a multi-objective test case priority sorting method with wide distribution range of non-dominated solution sets and higher fitness value. The method is conducive to discovering software defects as early as possible in the regression test process and reducing test cost.

The invention discloses a structure-from-motion method for multi-video sequences, comprising the following steps of: 1) using a continuous characteristic tracking algorithm and a non-continuous characteristic matching algorithm on the basis of SIFI characteristic description values, and matching SIFT characteristic points which are corresponding to a same scene point and distributed in different images; 2) using a structure-from-motion algorithm on basis of matching of the SIFT characteristic points which are corresponding to the same scene point and distributed in different images, recovering corresponding sub-images of video sequences, and registering the corresponding sub-images of the video sequences in a unified coordinate system; and 3) using a segment-based progressive optimization algorithm to iteratively spread and eliminate errors existing in the corresponding sub-images of the video sequences. The structure-from-motion method for the multi-video sequences can efficiently match characteristic locuses distributed in non-adjacent sub-sequences, improve the solving quality of each sub-image, break through the memory and efficiency bottleneck of the traditional solving method for large-scale scenes, and globally and efficiently optimize the three-dimensional structure of the entire scene and camera variables in a limited memory environment.

A method for optimizing public traffic network features that the simulated annealing algorithm is used as a frame, and the whole-day total operation cost of operation company is minimized as an objective to obtain initial line network under the frame. The initial line network is scattered to form the line network unit, which is used as the input network, and the genetic algorithm is embedded to optimize it. The public transportation line network optimization model is constructed to minimize the total travel time of all travelers, and the simplified new line network is formed. The change of operation cost is compared to determine whether the convergence condition is reached. The invention combines the simulated annealing algorithm with the genetic algorithm, which ensures the global searching ability of the optimization process and avoids the algorithm from falling into the local optimal solution, thereby improving the solution quality. At the same time, the design concept of 'element'is proposed to promote the combination of multi-objective optimization process, and the convergence condition of sub-heuristic algorithm is improved by two-temperature cooperative control iteration, thus overcoming the common shortcomings of sub-heuristic algorithm that the convergence condition is difficult to define.

The invention provides an optimization method for real-time energy management of a multi-energy building. The method comprises the following steps: establishing a multi-energy building management optimization model; dividing upper and lower limit intervals of the historical electricity price into a plurality of sub-intervals, extracting data points from the plurality of sub-intervals to form a source task input sample, and obtaining an initial memory matrix corresponding to the source task input sample; Machine learning is carried out on the source task input samples and the corresponding initial memory matrixes, and an optimal memory matrix corresponding to each source task input sample is obtained according to the multi-energy building management optimization model; obtaining the currentreal-time electricity price, calculating the similarity between the current real-time electricity price and the source task input sample, calculating to obtain the initial memory matrix of the current real-time electricity price according to the optimal memory matrix corresponding to the source task input sample with the highest similarity, carrying out machine learning, and calculating to obtainthe output scheme of the multi-energy building management optimization system. According to the method, the output scheme of the multi-energy building system can be quickly obtained under the mechanism of real-time electricity price.

The invention discloses a software and hardware partitioning method on the basis of improved brainstorming algorithms. The software and hardware partitioning method includes initializing parameters; initializing cluster centers; starting iteration updating and ranking individuals from small to large according to fitness values; sequentially starting to compute the distance from each individual toeach cluster center from the first ranked individuals; updating optimal individuals in each cluster; randomly selecting an individual from the clusters and generating a new individual; shifting the randomly selected individual towards global optimal individuals by random lengths randomly generating a new individual meeting hardware area constraint conditions and replacing the randomly selected individual with the new individual; completing an iteration updating process; outputting the optimal individuals to be used as optimal software and hardware partitioning schemes. First-rank individuals sorted according to the fitness values are the global optimal individuals. The software and hardware partitioning method has the advantages that cluster modes and individual updating modes are improved, accordingly, the efficiency of each iteration process can be effectively enhanced, premature convergence can be prevented, the global optimization ability can be omitted, the solution quality can beeffectively enhanced, and the convergence speeds can be effectively increased.

The invention discloses a flexible job shop self-adaptive batch scheduling method with a preparation process, which considers a batch problem and a flexible job shop scheduling problem at the same time, and adjusts and optimizes a job process scheduling mode of a job process by means of dynamic adjustment greedy decoding through internal circulation in a genetic algorithm iterative processing process. A scheduling optimization result is used as a basis of self-adaptive batching, and batches and a batch division mode of the operation process are adjusted and optimized through external circulation by means of a self-adaptive batching strategy, so that simultaneous optimization of a batching problem and a flexible operation workshop scheduling problem is realized; by means of the method, the utilization rate of the machining equipment in the interval period can be effectively increased, the solving quality of the genetic algorithm is improved, the problems of large search space, low efficiency and the like existing in batching are solved, feasibility and effectiveness are achieved for solving and considering preparation procedures and unequal-batch and batched flexible job shop batch scheduling problems, and the method is suitable for batch scheduling of flexible job shops. And the batch scheduling efficiency can be optimized.

Internet web server based method / system for providing confidential, moderated, crowdsourced problem solving resources to solve various problems. A crowdsource database of various skilled individuals interested in acting as problem solvers and team facilitators is provided, along with a database of client proposed problems, divided into non-confidential and confidential problem statement sections, key skills needed, and other criteria. These criteria are used as an index to the crowdsource database, and potential matches found. An administrator uses a server provided dashboard GUI, and the non-confidential problem statements, to pick among the various proposed matches, determine interest, and form small facilitator moderated teams. After suitable NDA, the confidential problem statement is revealed, and the teams interact confidentially with the client through the server. Facilitator moderation, problem restatement, and other methods reduce burden on the client and improve solution quality. Client accepted solutions, optionally after team release of IP, result in team member payment.

The invention discloses an optimal scheduling method for a take-out distribution process, and belongs to the technical field of vehicle scheduling intelligent optimal scheduling. According to the invention, a scheduling model and an optimization objective of the take-out distribution process are provided, so that the expression of the scheduling process is clear and definite; Initial pheromone intensity is obtained by adopting algorithm steps, an improved path selection mode and a mechanism of self-adaptive correction parameters are provided, and an algorithm is instructed to carry out effective global search; And a variable neighborhood local search strategy is executed on all vehicles serving the client, so that the local development capability of the algorithm is further improved, and the solution quality is remarkably improved.

The invention discloses a fluid machinery parallel simulation program process mapping method based on genetic algorithm, includes such steps as linking process communication stake library when fluid mechanical parallel simulation program is compiled, capturing communication information of MPI communication during program running, and obtaining log file with message size and communication frequencyof inter-process transmission; Constructing a process communication mode matrix according to the communication log file; constructing a communication distance matrix of computing unit to test the communication cost of computing resources applied by users; Defining the communication overhead model of parallel simulation programs for fluid machinery; using hybrid parallel genetic algorithm to solvethe optimal process mapping strategy; according to the optimal process mapping strategy obtained from the hybrid parallel genetic algorithm, statically binding the MPI process to the specified compute node, and rerunning the fluid mechanical parallel simulation program.

The invention provides a combined heat and power scheduling method based on convex relaxation, and the method builds a simplified thermodynamic model to describe the water temperature change in a regional heat supply system; non-convex equality constraints and bilinear constraints in the model are relaxed by using cone relaxation and polyhedron relaxation methods, so that a convex CHPD model is obtained, a relaxed solution obtained based on the model is further projected to a feasible solution space, and finally, the CHPD solving quality and calculation performance can be improved. According to the invention, the simplified thermodynamic model about the temperature change of the heat supply network is established, and the mathematical complexity of a node method used in a traditional heatsupply network modeling method is reduced; a convex CHPD model is constructed by utilizing second-order cone relaxation and polyhedron relaxation, and the hydraulic and thermal conditions of DHS are fully simulated. The invention further provides a self-adaptive boundary tightening strategy to improve the quality of the relaxation solution, and the local optimal solution of the combined heat and power scheduling problem can be quickly and effectively found.

The invention belongs to the technical field of general control or adjustment systems, and particularly relates to a deviation rectification control method and device for shield tunneling postures. The deviation rectification control method comprises the steps that a deviation rectification principle model of a shield tunneling machine is constructed; the deviation rectification principle model comprises a deviation rectification track curve; the minimum deviation rectification radius of the deviation rectification principle model is determined; the minimum deviation rectification radius of the deviation rectification principle model is the curvature radius of the deviation rectification track curve; preset shield tunneling machine parameters are processed by using an artificial ant colony algorithm to obtain an optimal feature subset; according to the minimum deviation rectification radius and the optimal feature subset, a deviation rectification mathematical model of the shield tunneling machine is constructed; based on the deviation rectification mathematical model, the optimal feature subset is optimized through an artificial bee colony algorithm to obtain control parameters; and a tunneling posture of the shield tunneling machine is controlled to rectify deviation according to the control parameters. The optimal feature subset can be screened out by introducing the ant colony algorithm, and the optimal feature subset is used as an initial population of the artificial bee colony algorithm, so that the solving quality can be improved, the deviation rectification precision can be improved, and a better deviation rectification effect can be achieved.

The invention discloses a photovoltaic cell parameter identification method based on an improved balance optimizer algorithm. The method comprises the following steps: step 1, establishing a PV cell model and a fitness function; step 2, based on the measured output IV data, predicting output data of the PV cell through a BP neural network; and step 3, identifying the parameters of the PV cell by using an IEO algorithm until the convergence condition of the IEO algorithm is reached, and finally outputting the identified optimal parameters. The technical problems that in the prior art, optimal parameter recognition cannot be achieved, and local optimum is likely to happen are solved.

The invention discloses a Web service crowdsourcing test task allocation method based on a heuristic algorithm. The Web service crowdsourcing test task allocation method comprises the following stepsthat S1, a requester submits a plurality of crowdsourcing work to a crowdsourcing platform in the form of a test task; S2, the task distribution optimization system establishes a task distribution model at least comprising test task attributes, test worker attributes and distribution factors, and confirms a target function and constraint conditions according to the task distribution model; S3, thetask allocation optimization system adopts an HE algorithm to perform optimal allocation between the test tasks and the test workers based on the task allocation model, issues the tasks according totask issuing conditions set by the crowdsourcing platform, and displays task information to the test workers; and S4, results are fed back to the crowdsourcing platform after the testing worker completes corresponding tasks, and completion results of the tasks are summarized and arranged by the crowdsourcing platform.

The invention relates to an iterative learning control method based on a balanced single evolution cuckoo algorithm. a novel equilibrium single evolution evaluation strategy is given; each generationof evolution only randomly updates the single dimension of the target function; the dimensionality of random updating obeys integer uniform distribution; combining with other dimensions to form a newcandidate solution; evaluating the candidate solution, if the candidate solution is superior to the fitness value of the previous generation of function, keeping the updated candidate solution and continuing to evolve until an algorithm stop condition is met, and only receiving an update value capable of improving the current candidate solution by adopting a greedy rule, so that the targeted adjustment of a search direction in an optimization process is ensured, and the efficiency is not influenced. According to the method, the global search capability and the local optimization capability ofthe cuckoo algorithm can be effectively balanced, the hysteresis phenomenon appearing at the end of execution of the optimization algorithm is avoided, and therefore the global search speed and the convergence precision of the algorithm are improved.

A method is described for generating an undisturbed signal out of an audio signal including a disturbing signal. The method comprises the steps of: estimating auto-correlation matrices and cross-correlation vectors of the equation of the Wiener filtering problem, calculating the coefficients of the solution vector of the equation of the Wiener filtering problem, evaluating the quality of the calculated coefficients, controlling the estimation step depending on the quality of the calculated coefficients, generating a correction signal out of the disturbing signal depending on the calculated coefficients, and correcting the audio signal depending on the correction signal.

The invention relates to a bi-phase anisotropic medium reservoir parametric inversion method based on a niche master-slave parallel genetic algorithm. According to the method, the niche master-slave parallel genetic algorithm is used for solving bi-phase anisotropic medium reservoir parameters, the core ideology includes that a system comprises a master processor and a plurality of slave processors, the master processor monitors a whole population, at a fitness calculation stage, the master processor distributes calculation of the fitness to all slave processors, collects results after calculation and then performs operations such as niche elimination, selection, cross and variation to generate a new generation of population so as to finish one circulation, and the calculation efficiency of reservoir parametric inversion is improved greatly. According to the method, a concept of sharing degree is introduced in the reservoir parameter evolution solving process, substantial growth of some individuals are limited through adjustment of the fitness of each individual, niche evolution environments are created, and the capacity for solving multiple-peak reservoir parametric inversion optimization problems and the solving quality through the genetic algorithm are improved. The bi-phase medium parametric inversion method is widely applied to parametric inversion processes of oil and gas reservoirs.

The invention provides a feasible label continuing network-based crew affair route planning method, which comprises the following steps of combining and calculating feasible routes to obtain a feasible label continuing network, and integrating and calculating according to the feasible label continuing network and a preset rule to obtain a planning model; and carrying out iterative solution on theplanning model by utilizing a Lagrange relaxation algorithm to obtain an optimal solution, namely the intersection plan. According to the method, the computer memory occupation scale required by calculation can be greatly reduced, so that a result can be obtained in a short time, and the method is particularly suitable for large-scale route planning; the lower bound value and the upper bound valueobtained by the Lagrange relaxation algorithm are converged to the optimal value, the difference between the upper bound value and the lower bound value is small, the solving quality is high, and a high-quality crew traffic plan can be compiled for a railway system. Various crew rules are comprehensively considered, so that the method is closer to reality, and the feasibility and authenticity ofa crew route plan are ensured.

A method for determining an alternative representation of an optimization model reduces model input through compact representation of model parameters. Model generation is performed at varying levels of complexity (approximation) depending on pre-defined, business approved thresholds.