Distributed constraint optimization problem solving method based on ant colony inheritance and application thereof
A technology for constrained optimization and problem solving, applied in the field of distributed constrained optimization problem solving based on ant colony genetics, it can solve problems such as algorithm falling into local optimum, and achieve the effect of expanding search and good quality.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0096] Embodiment 1: see figure 2 , a method for solving distributed constraint optimization problems based on ant colony genetics, including the following steps:
[0097] S100: Use a quaternion to represent the distributed constraint optimization problem, wherein:
[0098] A={a 1 ,...,a n} is a collection of agents;
[0099] X={x 1 ,...,x m} is a set of variables, m≤n;
[0100] D = {D 1 ,...,D m} is a collection of ranges, each x i The value range is D i , each Agent starts from the range D i The value in the variable x i assignment, means x i The tth value of ;
[0101] F={f 1 ,...,f p} is a set of constrained cost functions, constrained is from any k variables assignments of to a map with non-negative cost;
[0102] Assuming that an agent only controls one variable and all constraint relations are binary relations, the solution of DCOP is expressed as:
[0103]
[0104] Express DCOP as a constraint graph. In the constraint graph, each node repre...
Embodiment 2
[0160] Embodiment 2: Application of the distributed constraint optimization problem solving method based on ant colony genetics, the distributed constraint optimization problem solving method based on ant colony genetics defined in embodiment 1 is applied to the emergency rescue problem of urban emergencies;
[0161] Considering that the traffic flow in the opposite direction of the same road section is not consistent, given the problem traffic road network G(C,E), C represents the node in the road network, and E represents the connection between the two nodes, that is, the road section. At the same time, the urban burst The event traversable path planning is constructed as a DCOP model, and then the proposed AG_DCOP algorithm is used to solve the model to find several optimal path sets that satisfy the constraints as the best path and alternative path for emergency rescue. The model is described in detail as follows:
[0162] A={car 1 ,..., car n} is a collection of agents,...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



