CN107943427A - A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service - Google Patents

A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service Download PDF

Info

Publication number
CN107943427A
CN107943427A CN201710984390.4A CN201710984390A CN107943427A CN 107943427 A CN107943427 A CN 107943427A CN 201710984390 A CN201710984390 A CN 201710984390A CN 107943427 A CN107943427 A CN 107943427A
Authority
CN
China
Prior art keywords
order
algorithm
assignment
print shop
print
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710984390.4A
Other languages
Chinese (zh)
Inventor
暴建民
李树强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201710984390.4A priority Critical patent/CN107943427A/en
Publication of CN107943427A publication Critical patent/CN107943427A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1202—Dedicated interfaces to print systems specifically adapted to achieve a particular effect
    • G06F3/1203—Improving or facilitating administration, e.g. print management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1223—Dedicated interfaces to print systems specifically adapted to use a particular technique
    • G06F3/1237—Print job management
    • G06F3/126—Job scheduling, e.g. queuing, determine appropriate device
    • G06F3/1264—Job scheduling, e.g. queuing, determine appropriate device by assigning post-processing resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1278—Dedicated interfaces to print systems specifically adapted to adopt a particular infrastructure
    • G06F3/1285—Remote printer device, e.g. being remote from client or server
    • G06F3/1287—Remote printer device, e.g. being remote from client or server via internet
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Abstract

The invention discloses a kind of auction algorithm of the belt restraining based on figure in cloud print service.The print shop information in backstage is divided into different figures according to different zones first to store, algorithm uses both of which：Idle pulley and busy pattern, correspond to slack and the busy period of business respectively.In idle pulley, there is printing order in backstage submission, the figure middle-range corresponding to the printer of storage this area can be automatically found according to the posting address of the order from suitable print shop, assignment calculating then is carried out to them, finds out optimal be allocated.Under busy pattern, assignment calculating first can be carried out to order collection from the background, obtain the matching value set of order, the print shop for then looking for the Optimum Matching of each order is allocated.The present invention is in the assignment of algorithm calculates, and during algorithm is designed, far and near by euclidean distance between node pair completes, apart from upper constraint, to simplify constraint generating process, reduce part assignment operation in auction algorithm, reaches the high efficiency for improving algorithm.

Description

A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service
Technical field
The invention belongs to cloud printing industry and task allocation technique field, and in particular to a kind of based on figure in cloud print service Band cut-off constraint auction algorithm.
Background technology
Cloud print service refers to by internet, integrates all printing device resources, and the shared printing of structure roaming is put down Platform, the print service of quality standardization anywhere or anytime is provided to the whole society.In recent years, both at home and abroad to the achievement in research of cloud printing It is more and more, and be embodied " cloud printing " technology based on " Google cloud printing " and " Hewlett-Packard's cloud prints " system, they are each Developed and be laid out to cloud printing, but unified standard and system has not yet been formed.Google's cloud printing has been enter into test run Row order section, implementation support cloud by the application program that can be run in ChromeOS using Application Programming Interface (API) Printing technique standard.ChromeOS user directly can perform print command by application program.Hewlett-Packard's cloud printing is only propped up at present The printing device of its own brand is held, its cloud printing concept is named as HP-ePrint, and this concept definition is provided for HP A service, it is allowed to by supporting printer that cloud prints to send Email and directly print.User can be from any Smart mobile phone or computer are printed, without installing any special driver or software.
Zhang Xuliang employs the dynamic data structure based on pond in the realization that print out task distributes, and introduces two-dimentional pond Concept, and task scheduling is carried out by priority.Han-Lim Choi propose that a kind of auction algorithm based on uniformity is used Carry out the task distribution between handling machine.Lead in consensus-based bundle algorithm (CBBA) algorithm of proposition Diminishing Marginal Gain (DMA) processes are crossed as scoring strategy, for the value of local optimum is added to machine In the task queue that may be performed, all robot reasonable distributions can be farthest dispatched.But task queue is not true It is qualitative so that DMA processes need to circulate the time complexity for repeatedly, increasing algorithm.Dong-Hyun Lee propose that one kind is based on The distributed auction algorithm (RODAA) of resource, in multi-hop auction process wherein, by the communication between machine, establishes one The tree quickly networking of kind breadth first traversal (BFS), solves the problems, such as to communicate in distributed algorithm well.But based on logical The auction algorithm of letter mode is in auction generating process, and robot repeatedly needs broadcast message and receives information so that algorithm Perform time lengthening.Lingzhi Lu add off period constraint in the research of auction algorithm, by the side for solving np problem Formula seeks optimal solution, but the drawback is that in cut-off constraint, consumes substantial amounts of assignment operation so that Algorithms T-cbmplexity About one times is added than common auction algorithm.
The content of the invention
The purpose of the present invention is for Algorithms T-cbmplexity existing in the prior art it is larger the problem of, propose a kind of profit With the new auction algorithm for being modeled and realizing to cloud print service, to complete optimal between user and print shop Match somebody with somebody.
To achieve the above object, the technical solution adopted by the present invention is that a kind of band based on figure ends about in cloud print service The auction algorithm of beam, comprises the following steps：
Step 1, check current print service state state, State=1, represents busy state, state=0, represents empty Not busy state；
If step 2, state=1, when store tasks quantity reaches N number of when order pond, the more machines of multiple orders are performed Distribution performs flow；If state=0, an order is often submitted, performs single Order splitting flow successively；
Step 3, check currently whether there is unappropriated order, if so, then repeating step 2-3；If it is not, Stop distribution.
Further, state states are a boolean value in step 1, are rule of thumb manually set.
Further, the N values in step 2 depend on the order numbers of backstage receiving per minute and the consideration of algorithm complex.
Preferably, the value of above-mentioned N is 100.
Further, the idiographic flow of single Order splitting is as follows in above-mentioned steps 2：
Step 1：By obtaining the positional information of order j, find and the corresponding figure G in this areak；
Step 2：Travel through all figure GkIn vertex set VkPositional information calculated, find the printing nearest from order j Shop vertex vclo；
Step 3：By above-mentioned assignment algorithm flow, according to vertex vcloCarry out searching the vertex adjacent with it, and be stored in collection Close pane1In, storage to set pane successivelyn, the value of n is to think to set, and the print shop of hypertelorism is directly excluded；
Step 4：There is auction qualification to all, the print shop in set carries out assignment calculating, then finds highest With value, then assignment is carried out.
Further, the idiographic flow of multiple more machine assignments of order is as follows in step 2：
Step 1：All orders in order collection O are divided into m set by ground, for order collection Ok, k=1 ..., m, lead to Corresponding figure G is found respectively in the area for crossing order collectionk；
Step 2：To order collection OkIn all vertexTraveled through, and in figure GkThe middle printing nearest with order j respectively Shop set Sclo；
Step 3：Travel through order collection OkIn all order, assignment algorithm flow is performed to them respectively, and reject each Time of order is upper and place on inappropriate print shop, finally for order collection OkIn each order, a corresponding assignment collection CloseCalculate and store respectively the matching value of the print shop of all suitable orders in this area；
Step 4：Traversal searches all assignment set successivelyThe highest print shop of matching value and order are carried out the One wheel matching, in this step, each print shop can only be assigned to an order, if the Optimum Matching of two orders is same Print shop, then highest one of value, if two matching values are identical, matches first in order；
Step 5：The order matched is excluded into order collection Ok, and generate new order collection Ok(τ), ordered for new Single collection Ok(τ), 2-4 steps are repeated, until all orders have all been assigned.
The present invention compared with prior art, has following technique effect using above technical scheme：
(1) cloud print service is modeled.Cloud print service modeling, it is necessary to consider the species of printer, Quantity and printing effect, while consider print service queuing time, the high latency of print out task etc., establish one Optimum Matching model between cloud printing user and print shop.
(2) a kind of new auction algorithm is proposed, for completing the Optimum Matching between user and print shop.The algorithm is A kind of auction algorithm of the network structure hierarchic sequence assignment based on figure, in the algorithm, each background task is considered as a bid Person, and each printing device unit is considered as a bidder.On the basis of model, by introducing improved auction algorithm, come Quickly accurately carry out the matching between user and print shop.
(3) foundation by model and new matching algorithm, solve traditional print service and dispatch in cloud print service, The problem of failing to fully understand the traffic handing capacity of all print shops in a region, and when towards a large number of services, meeting There are some areas and receive the excessive present situation of printing order.
Brief description of the drawings
Fig. 1 is the non-directed graph G of certain applicable block region memory storage print shop positional information of the present invention.
Fig. 2 is inventive algorithm substantially flow chart.
Fig. 3 is the single Order splitting algorithm flow chart of algorithm in present invention auction.
Fig. 4 is more more machine allocation algorithm flow charts of order in auction algorithm of the present invention.
Fig. 5 is the assignment flow chart based on constraint in inventive algorithm.
Fig. 6 is allocation algorithm task-deadline constrained generalized of the invention and traditional The loop iteration number of multi-robot linear assignment problem (TAD-GMRAP) compares figure.
Fig. 7 is inventive algorithm figure compared with the deadline of traditional allocation algorithm TAD-GMRAP.
Fig. 8 is inventive algorithm figure compared with the matching degree of traditional allocation algorithm TAD-GMRAP.
Embodiment
Technical scheme is described in further detail below in conjunction with the accompanying drawings.
The foundation and elaboration of Matching Model are carried out first：
Assuming that this area shares ntA printing order needs to distribute,Between wherein each task mutually solely It is vertical.Each order tjThere is the Estimated Time Of Completion ct of oneselfj, i.e., from order tjPrinting is printed to since printer to finish The required time, 30 calculating per minute of chart speed degree is averaged out with market printer,Wherein It is printing order tjNumber of pages, this parameter can be preserved from foreground when incoming data storehouse.Each printing is ordered at the same time It is single to have a limitation time dt at the latestj, specified by user, if user is not specified, default value is 1 day, i.e. 1440min.
At the same time, it is assumed that there is n in full areapA printing device unit,In cloud print system, each beat Printing apparatus unit does not imply that a printer, and refer to one can be with the unit of complete independently print out task, i.e., one A group of planes is printed, or is print shop.Each unit piThere is the task stack of oneselfDistributed for storing But also unfinished task, this parameter are allowed in print service peak hours/period, in the case that the time is very short, after Platform may can be to the printing order sub-distribution again of storage, and the task of upper sub-distribution may have not been completed, discounting for The task that each printing device unit does not complete, may be such that the situation of mistake occurs in task distribution.Wherein,For depositing Store up currently outstanding printing quantity on order, psfiRepresent the at most storable number of tasks of current stack,For storing pre- count Into all orders required time, wherein ctjThe required time is completed for individual task.
In addition, it is assumed that printing device unit has an identical parameter iti, for represent two neighboring print out task it Between execution interval time for switching, the i.e. time since a upper print out task terminates to next print out task.General feelings Under condition, it is setiValue be 0.5 minute.I-th machine execution of order j Estimated Time Of Completion be：
When carrying out task Order splitting flow, each task order tjCorresponding each printing device unit piThere is one Matching value payoff(i,j).The size of the value depends on two parameters：One is queuing of the order needs in this unit Time and the time of the limitation at the latest dt of the orderjIt is compared value tc(i,j)。
If tc(i,j)＞ 1, then it represents that the queuing time of the printing device unit is more than the limitation time at the latest of the task, Then remember payoff(i,j)=0, acquiescence loses auction qualification.
The other is distance of the print shop apart from user.Actual geographic distance in view of starting point distance objective point is difficult With (because the having crisscross road main line and the huge more lane of quantity) of calculating, therefore in the present system, user arrives The distance of print shop is not to be calculated by actual geographic distance, but is connected according to the user and target print shop Connect, the print shop number that intermediate demand redirects carrys out Fuzzy Calculation.First, all printing device units in a region can be used One is schemed G (V, E) to be stored, wherein set V becomes the vertex set of figure, set E is the side collection of figure.In set V, comprising The region all printing device units.In set V, it is assumed that v1∈V,v2∈ V, are two printing device units.If v1 And v2It is geographically neighbour, then remembers (v1,v2) ∈ E, becoming in figure G has one from v1To v2Arc, be denoted as v1→v2.If ReachShortest path needs, by n arc, to represent in G is schemedWithThe distance between dista (i,j)=n.The value of n is got over Greatly, represent that the distance between two printing device units are more remote.
Assuming that fijIndicate whether task order tjDistribute to printing device unit piIf fij＜ 1 then represents to distribute, and 0 Then represent not distribute.aij∈ R, wherein aijIt is to represent task order tjWith printing device unit piMatching value payoff (i,j), assignment problem can be expressed as：
S.t.0 ＜=TCij＜=1
On the distributed auction algorithm of the order assignment based on figure, the side of the hierarchic sequence assignment based on figure is introduced first Method：
Will be to ntA print out task and npA printing device unit is matched by market auction mechanism, wherein often A print out task plays the part of the identity of an auctioneer, and each printing device unit plays the part of the identity of a bidder.Each printing Task tjIn most long limitation time d for meeting oneselfjIn the case of, it may be adapted to match multiple printing device unit pi, can produce Conflict, is solved using matching value payoff herein.
In the background data base of cloud printing, the print shop information of all related cooperations, including geographical location letter store Breath.The print shop of all cooperations is separated by region, constructs multiple figures, respectively with every figure of place name naming, representing should The print shop in area.In figure G (V, E), any one print shop represents a vertex vi∈ E, if any two print shop vi, vjMutually adjoin, then use { vi,vj∈ E, represent a line.
When a user submits an order from website or app, the positional information of the user is recalled first, is obtained and is used The print shop figure G of family locationk∈G.Then the specific location latitude and longitude information of the user is called, first traversing graph GkInstitute There is print shop viThe latitude and longitude information of ∈ V, by calculating each viWith the distance of the user of issue order j, find out nearest from user A print shop vclo。
In the assignment incipient stage, the order j submitted for user, calculates the print shop v nearest from user firstclo With value distai.Then for scheming GkFor, from the vertex vcloThe vertex being connected with it is begun look for, is stored in set pane1, Then set pane is traveled through1, after to set pane1In all vertex search the vertex being connected with them, be placed on set pane2In, circulate successively, until panen.Pane is calculated in turn1In all print shop vertexWith user's order j'sAnd to set pane2In all vertex perform and set pane1The same operation, matching is calculated by level successively ValueCirculate successively.
In figure GkIn, set panenThe value of middle n is bigger, illustrates more remote from user., can be rule of thumb in practical application Design the maximum of n.When the value of n is excessive, because from user too far, then acquiescence abandons auction qualification.Being set in for the value of n is existing In real application, what is considered first is the patient distance of user, proposes a rational value.
Above, in each print out task tjDetermine the stage, can be for it into the assignment on row distanceTogether When complete to need on time for waiting from being submitted in order j, also have a corresponding matching value tc(i,j).Wherein tc(i,j) Value depend on the ratio of print shop intended print deadline and user's maximum tolerance time.It is the printing device unit PiIt is fully finished the order required time of current print out task stack, ctjIt is that single order j completes the required time；
Thus in conclusion
On the auction algorithm with time-constrain, in order to farthest save the time, which is divided into two kinds Situation, one kind are that print shop business idle period is in free states, and another situation is the busy period busy states of print shop.
When print service is in free states first, the order of submission is less, and backstage often receives an order j, will be right It performs the assignment algorithm of above-mentioned Part I, has reformed into the pattern of single task distribution.
The first step：By obtaining the positional information of order j, find and the corresponding figure G in this areak。
Second step：Travel through all figure GkIn vertex set VkPositional information calculated, find nearest from order j beat Print shop vertex vclo。
3rd step：By above-mentioned assignment algorithm flow, according to vertex vcloCarry out searching the vertex adjacent with it, and be stored in Set pane1In, storage to set pane successivelyn, the value of n is to think to set, and the print shop of hypertelorism is directly excluded.
4th step：There is auction qualification to all, the print shop in set carries out assignment calculating, then finds highest With value, then assignment is carried out.
When print service is in busy states, distribution can be carried out at the same time to the order collection O in order pond from the background.
The first step：All orders in order collection O are divided into m set by ground.For order collection Ok, k=1 ..., m. Corresponding figure G is found by the area of order collection respectivelyk。
Second step：To order collection OkIn all vertexTraveled through, and in figure GkMiddle difference nearest print shop therewith Set
3rd step：Travel through order collection OkIn all order, respectively they are performed with the assignment algorithm flow of upper trifle, and Reject each order time is upper and place on inappropriate print shop.Finally for order collection OkIn each order, corresponding one A assignment setCalculate and store respectively the matching value of the print shop of all suitable orders in this area.
4th step：Traversal searches all assignment set successivelyThe highest print shop of matching value and order are carried out the One wheel matching.In this step, each print shop can only be assigned to an order.If the Optimum Matching of two orders is same Print shop, then highest one of value.If two matching values are identical, first is matched in order.
5th step：The order matched is excluded into order collection Ok, and generate new order collection Ok(τ).For new Order collection Ok(τ), 2-4 steps are repeated, until all orders have all been assigned.
Fig. 1 is the non-directed graph G of certain applicable block region memory storage print shop positional information of the present invention, and this area shares printing 20, shop, specific distribution is as schemed in G.Each regional print shop cached location information is similar to figure G by print shop backstage One figure, the step of specific implementation be：
(1) when there is a user to print order submission, algorithm flow as shown in Fig. 2, inquire about current print service first State.
(2) if state is idle condition, single Order splitting flow can be entered, as shown in figure 3, filled according to user Posting address, finds the figure of corresponding this area.This example is just illustrated with scheming G.
(3) subsequently into assignment phase, as shown in figure 5, the print shop nearest from user's order can be searched first.It is specific real Now method is：From the background by the more specific location information location (x, y) of app positioning functions or network ip calling and obtaining users, and The positional information of all print shops in figure G is transferred, is stored in vertex set pane.
Pane=(x1, y1), (x2, y2), (x3, y3) ..., (x20, y20) }
Set pane is traveled through, calculates the distance of all vertex and customer location successively, and is stored in array a [20] In.
li=(x-xi)2+(y-yi)2
Array is traveled through, finds out minimum value, is the print shop vertex nearest from user.It is nearest from user in this example Vertex be v11 vertex.
(4) it is starting point with vertex v 11, searches the set for the point being connected with v11
pane1={ v8,v9,v10,v13,v14,v15}。
(5) to set pane1In each point traveled through, search all points being connected with them, be stored in set pane2={ v4,v5,v7,v6,v12,v17,v16, circulation successively obtains pane3={ v1,v2,v3,v6,v18,v19, just follow in this example Ring 3 times.
(6) to v11, pane1, pane2, pane3In all print shops calculate its matching value with the order, and by result It is stored in array bjIn.Matching value calculation formula is as follows：
(7), to array bjTraveled through, find out first highest print shop of matching value and be allocated, complete the order Distribution.
(8) if, when inquiring about busy during current print service state, the more machine allocation flows of more orders, such as Fig. 4 can be transferred to It is shown.First judge whether the quantity on order in order pond is more than N, waited if not.If current order quantity is big In N, then N number of order is extracted, carry out the auction algorithm of the more machines of multitask.N is set as 100 in this example, can be according to actual conditions Setting.
(9), all orders in order collection O are divided into m set by ground.For order collection Ok, k=1 ..., m.Pass through Corresponding figure G is found respectively in the area of order collectionk。
(10), to order collection OkIn all vertexTraveled through, and in figure GkThe middle printing nearest with order j respectively Shop vertex set Sclo。
(11), order collection O is traveled throughkIn all order, step 3-6 is performed to them respectively, and reject each order Inappropriate print shop on time and place.Finally for order collection OkIn each order, a corresponding assignment setPoint It and Ji Suan store the matching value of the print shop of all suitable orders in this area.
(12), traversal searches all assignment set successivelyThe highest print shop of matching value and order are carried out first Wheel matching.In this step, each print shop can only be assigned to an order.If the Optimum Matching of two orders is beaten same Print shop, then highest one of value.If two matching values are identical, first is matched in order.
(13) order matched is excluded into order collection Ok, and generate new order collection Ok(τ).For new order Ok(τ), repeat 10-12 steps.Until all orders have all been assigned.
In order to evaluate the performance of the present invention, two kinds of algorithms are realized using vs2013, consider quantity on order N values respectively 5, Under 10,15,20,30,50, the complexity of more more Order splitting algorithms of machine is emulated.In simulations, using Fig. 1 as printing Shop distribution map, the traversal of vertex set pane is 2 layers, and multiple printing order interval times are 0.2min, and print paper speed is set It is set to 30/minute.Since the auction algorithm with cut-off constraint is in graph traversal search, eliminate most of apart from upper Inappropriate print shop, into assignment flow, Fig. 6 display present invention subtracts than traditional TAD-GMRAP algorithms on iterations It is few.Fig. 7 display the present invention on the deadline, although quantity on order is less, be traditional TAD-GMRAP algorithms faster, But when quantity on order is larger, due to simplifying constraint generation and iterations, faster calculated on the time in traditional TAD-GMRAP Method.Fig. 8 displays present invention and TAD-GMRAP algorithms are in assignment problem, because rigid earlier eliminates on place position Inappropriate print shop node, matching degree higher.

Claims (6)

1. a kind of auction algorithm of the band cut-off constraint based on figure in cloud print service, it is characterised in that comprise the following steps：
Step 1, check current print service state state, State=1, represents busy state, state=0, represents idle shape State；
If step 2, state=1, when store tasks quantity reaches N number of when order pond, the more machine assignments of multiple orders are performed Perform flow；If state=0, an order is often submitted, performs single Order splitting flow successively；
Step 3, check currently whether there is unappropriated order, if so, then repeating step 2-3；If it is not, stop Distribution.
2. a kind of auction algorithm of the band cut-off constraint based on figure, its feature in cloud print service according to claim 1 It is, state states are a boolean value in step 1, are rule of thumb manually set.
3. a kind of auction algorithm of the band cut-off constraint based on figure, its feature in cloud print service according to claim 1 It is, the N values in step 2 depend on the order numbers of backstage receiving per minute and the consideration of algorithm complex.
4. a kind of auction algorithm of the band cut-off constraint based on figure, its feature in cloud print service according to claim 3 It is, the value of the N is 100.
5. a kind of auction algorithm of the band cut-off constraint based on figure, its feature in cloud print service according to claim 1 It is, the idiographic flow of single Order splitting is as follows in step 2：
Step 1：By obtaining the positional information of order j, find and the corresponding figure G in this areak；
Step 2：Travel through all figure GkIn vertex set VkPositional information calculated, find the print shop top nearest from order j Point vclo；
Step 3：By above-mentioned assignment algorithm flow, according to vertex vcloCarry out searching the vertex adjacent with it, and be stored in set pane1In, storage to set pane successivelyn, the value of n is to think to set, and the print shop of hypertelorism is directly excluded；
Step 4：There is auction qualification to all, the print shop in set carries out assignment calculating, then finds highest matching value , then carry out assignment.
6. a kind of auction algorithm of the band cut-off constraint based on figure, its feature in cloud print service according to claim 1 It is, the idiographic flow of multiple more machine assignments of order is as follows in step 2：
Step 1：All orders in order collection O are divided into m set by ground, for order collection Ok, k=1 ..., m, by ordering Corresponding figure G is found respectively in the area singly collectedk；
Step 2：To order collection OkIn all vertexTraveled through, and in figure GkThe middle print shop collection nearest with order j respectively Close Sclo；
Step 3：Travel through order collection OkIn all order, assignment algorithm flow is performed to them respectively, and reject each order Inappropriate print shop on time and place, finally for order collection OkIn each order, a corresponding assignment setPoint It and Ji Suan store the matching value of the print shop of all suitable orders in this area；
Step 4：Traversal searches all assignment set successivelyThe highest print shop of matching value and order are subjected to the first round Match somebody with somebody, in this step, each print shop can only be assigned to an order, if the Optimum Matching of two orders is in same printing Shop, then highest one of value, if two matching values are identical, matches first in order；
Step 5：The order matched is excluded into order collection Ok, and generate new order collection Ok(τ), for new order collection Ok(τ), 2-4 steps are repeated, until all orders have all been assigned.
CN201710984390.4A 2017-10-20 2017-10-20 A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service Pending CN107943427A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710984390.4A CN107943427A (en) 2017-10-20 2017-10-20 A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710984390.4A CN107943427A (en) 2017-10-20 2017-10-20 A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service

Publications (1)

Publication Number Publication Date
CN107943427A true CN107943427A (en) 2018-04-20

Family

ID=61935458

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710984390.4A Pending CN107943427A (en) 2017-10-20 2017-10-20 A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service

Country Status (1)

Country Link
CN (1) CN107943427A (en)

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282398A (en) * 2007-04-05 2008-10-08 佳能株式会社 Workflow executing apparatus and control method of the apparatus and program thereof
CN102117461A (en) * 2010-01-04 2011-07-06 北大方正集团有限公司 Digital printing order processing method and device
US20110317180A1 (en) * 2010-06-28 2011-12-29 Konica Minolta Systems Laboratory, Inc. Systems and methods for improving performance of trigonometric and distance function calculations during printing and display
US20130201522A1 (en) * 2012-02-08 2013-08-08 Canon Kabushiki Kaisha Network printer management system, network printer management apparatus, and method for controlling the same
US20140268211A1 (en) * 2013-03-13 2014-09-18 Xerox Corporation System and method for distributed cellular manufacturing with outsourcing group constraints
CN104503717A (en) * 2014-12-30 2015-04-08 深圳市七号科技有限公司 Network-based 3D (three-dimensional) printing control method
CN104780214A (en) * 2015-04-20 2015-07-15 河海大学常州校区 Cloud manufacturing system and method based on cloud computing and three-dimensional printing
CN104778571A (en) * 2015-04-17 2015-07-15 任天挺 Method and system capable of filling in bill and recording bill information without manual operation
CN105005455A (en) * 2015-06-26 2015-10-28 丁四涛 Printing control method and device of intelligent terminal
CN105302510A (en) * 2015-12-15 2016-02-03 李学聪 Cloud printing method and cloud printing system
CN105468371A (en) * 2015-11-23 2016-04-06 赣南师范学院 Business process chart combination method based on topic clustering
CN105573684A (en) * 2015-12-15 2016-05-11 广东工业大学 Two-dimensional code based cloud printing method and cloud printing system
US20160216923A1 (en) * 2014-03-28 2016-07-28 Xerox Corporation System and method for the creation and management of user-annotations associated with paper-based processes

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282398A (en) * 2007-04-05 2008-10-08 佳能株式会社 Workflow executing apparatus and control method of the apparatus and program thereof
CN102117461A (en) * 2010-01-04 2011-07-06 北大方正集团有限公司 Digital printing order processing method and device
US20110317180A1 (en) * 2010-06-28 2011-12-29 Konica Minolta Systems Laboratory, Inc. Systems and methods for improving performance of trigonometric and distance function calculations during printing and display
US20130201522A1 (en) * 2012-02-08 2013-08-08 Canon Kabushiki Kaisha Network printer management system, network printer management apparatus, and method for controlling the same
US20140268211A1 (en) * 2013-03-13 2014-09-18 Xerox Corporation System and method for distributed cellular manufacturing with outsourcing group constraints
US20160216923A1 (en) * 2014-03-28 2016-07-28 Xerox Corporation System and method for the creation and management of user-annotations associated with paper-based processes
CN104503717A (en) * 2014-12-30 2015-04-08 深圳市七号科技有限公司 Network-based 3D (three-dimensional) printing control method
CN104778571A (en) * 2015-04-17 2015-07-15 任天挺 Method and system capable of filling in bill and recording bill information without manual operation
CN104780214A (en) * 2015-04-20 2015-07-15 河海大学常州校区 Cloud manufacturing system and method based on cloud computing and three-dimensional printing
CN105005455A (en) * 2015-06-26 2015-10-28 丁四涛 Printing control method and device of intelligent terminal
CN105468371A (en) * 2015-11-23 2016-04-06 赣南师范学院 Business process chart combination method based on topic clustering
CN105302510A (en) * 2015-12-15 2016-02-03 李学聪 Cloud printing method and cloud printing system
CN105573684A (en) * 2015-12-15 2016-05-11 广东工业大学 Two-dimensional code based cloud printing method and cloud printing system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LINGZHI LUO ET.AL: "Distributed Algorithms for Multirobot Task Assignment With Task Deadline Constraints", 《IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING》 *

Similar Documents

Publication Publication Date Title
CN108764777B (en) Electric logistics vehicle scheduling method and system with time window
CN108762294B (en) Unmanned aerial vehicle path planning method and management system for aerial photography
CN106357739B (en) It is a kind of for batch cloud service request two stages combination and dispatching method
CN105183543B (en) A kind of gunz based on mobile social networking calculates online method for allocating tasks
CN105702017B (en) A kind of vehicle dispatching method and device
CN109819046A (en) A kind of Internet of Things virtual computing resource dispatching method based on edge cooperation
CN111757354A (en) Multi-user slicing resource allocation method based on competitive game
Cheng et al. Real-time cross online matching in spatial crowdsourcing
CN108846623A (en) Based on the complete vehicle logistics dispatching method and device of multiple target ant group algorithm, storage medium, terminal
CN111353840A (en) Order information processing method and device and electronic equipment
CN103546583B (en) Group intellectual perception system and group intellectual perception method
CN107066322B (en) A kind of online task allocating method towards self-organizing intelligent perception system
CN103997515B (en) Center system of selection and its application are calculated in a kind of distributed cloud
Cesarano et al. A real-time energy-saving mechanism in Internet of Vehicles systems
CN115392776A (en) Spatial crowdsourcing task allocation method based on multi-skill cooperation
CN100558071C (en) A kind of Link Resource Manager method and the transmission network and the network equipment
CN112631612B (en) Optimization method for kubernetes cloud platform configuration based on genetic algorithm
Nguyen et al. EdgePV: collaborative edge computing framework for task offloading
CN115168020A (en) Instance deployment method and device, cloud system, computing equipment and storage medium
CN110889738B (en) Order distribution method and device
CN107943427A (en) A kind of auction algorithm of the band cut-off constraint based on figure in cloud print service
CN106874108A (en) Thin cloud is minimized in mobile cloud computing use number technology
CN107437138A (en) Based on the production and transport coordinated dispatching method and system for improving gravitation search algorithm
CN111680860B (en) Deterministic cross online matching method in space-time crowdsourcing platform
CN110992123B (en) Order distribution method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20180420