scispace - formally typeset
Patent

Cloud manufacturing service combination optimization method based on k _ Dijkstra algorithm

TLDR
In this article, a cloud manufacturing service combination optimization method based on a k-Dijkstra algorithm is proposed, and the optimization of the combined service under the cloud manufacturing mode is realized, and by optimizing the service time, the service cost, the manufacturing capability and the comprehensive capability, the Cloud manufacturing enterprise can effectively helped to reduce the production cost and improve the production efficiency.
Abstract
The invention provides a cloud manufacturing service combination optimization method based on a k _ Dijkstra algorithm. According to the method, a cloud manufacturing service combination optimizationproblem is converted into a standard directed graph problem; for a standard directed graph, according to a sub-short path theorem, a path extension method and a Dijkstra algorithm, first k shortest path algorithms under a cloud manufacturing mode are provided, namely the k _ Dijkstra algorithm; an algorithm of the first k longest paths is provided; the first k shortest path algorithms and the first k longest path algorithms under the cloud manufacturing mode are provided by combining the first k shortest path algorithms and the first k longest path algorithms. The optimization of the combinedservice under the cloud manufacturing mode is realized, and by optimizing the service time, the service cost, the manufacturing capability and the comprehensive capability, the cloud manufacturing enterprise can be effectively helped to reduce the production cost and improve the production efficiency.

read more

References
More filters
Patent

Cooperative path planning method of multi-AGV combined navigation

Huang Peng, +1 more
TL;DR: In this paper, a cooperative path planning method of multi-AGV combined navigation is proposed, which comprises that the coordinate of an intermediate node and the node relation in a production workshop are extracted from layout of the workshop to generate a shortest path library online; a shortest operation path is generated online on the basis of a micro genetic algorithm; and online path planning is carried out in real time.
Patent

Cloud manufacturing service optimization method

TL;DR: In this article, a cloud manufacturing service optimization method is presented, which includes the following steps: first, according to a structure of a manufacturing task, optional manufacturing services and manufacturing service combinations, randomly generating an initial population as a current population for subsequent iteration, and representing each manufacturing service combination scheme in the current population with a two-dimensional code.
Patent

Digital microfluidic chip fault repair method based on combination of improved Dijkstra algorithm and IPSO

TL;DR: In this paper, the authors proposed a digital microfluidic chip fault repair method based on the combination of improved Dijkstra algorithm and IPSO. The method comprises the following steps: first, calculating the shortest path between two droplets to be mixed, and then calculating a moving path based on IPSO, so as to realize the shortest moving distance of droplets and complete fault repair under the condition of ensuring the completion of mixing.
Patent

Method and apparatus for instantiating a path with the minimum number of segments

TL;DR: In this article, a shortest path directed cyclic graph (SPDAG) algorithm is proposed for computing minimum segment labeling of a given path on a segment cover graph, the method includes receiving a connection request for a connection between a source node and a destination node.
Patent

An XML_RPC service-based cloud resource retrieval method and system

TL;DR: In this article, an XML-RPC service-based cloud resource retrieval method and system is presented. But the method comprises the steps that a cloud management network performs p2p communication on each node via XML_RPC services, in which each node tracks an adjacent node to which it belongs; each node acquires the weight information of the adjacent node and feeds the weighted information back to an initial node; a processer calculates the values of the shortest paths from the initial node to the other nodes in the connectable node net type diagram according to the Dijkstra algorithm