CN113869743A - Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty - Google Patents
Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty Download PDFInfo
- Publication number
- CN113869743A CN113869743A CN202111152225.5A CN202111152225A CN113869743A CN 113869743 A CN113869743 A CN 113869743A CN 202111152225 A CN202111152225 A CN 202111152225A CN 113869743 A CN113869743 A CN 113869743A
- Authority
- CN
- China
- Prior art keywords
- lossless
- conditions
- come
- met
- resource allocation
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000013468 resource allocation Methods 0.000 title claims abstract description 21
- 241000544076 Whipplea modesta Species 0.000 title claims abstract description 5
- 230000032683 aging Effects 0.000 claims description 5
- 230000008901 benefit Effects 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 5
- 238000011144 upstream manufacturing Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 2
- 208000019901 Anxiety disease Diseases 0.000 description 2
- 230000036506 anxiety Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Images
Classifications
-
- 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
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Primary Health Care (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a method and a system for realizing the principle of resource allocation of first-come-first-served resources by lossless modesty. The method comprises the following steps: acquiring position information and individual information uploaded by a user terminal in real time; judging whether the user terminal reaches a waiting area or not according to the position information acquired in real time; judging whether lossless modest conditions are met or not for the user terminals arriving at the waiting area according to the individual information uploaded in real time; if the loss-free modest conditions are met, the user terminal meeting the loss-free modest conditions is instructed to temporarily release the occupied service authority; and after waiting for the specified number of other user terminals to obtain the service, the user terminal temporarily releasing the service authority acquires the service authority again. The method and the system for realizing the resource allocation principle can realize overall better resource utilization efficiency without loss and modestly improve the first-come-first-come resource allocation principle.
Description
Technical Field
The invention relates to the technical field of online queuing, in particular to a method and a system for realizing the principle of resource distribution from first to first in a lossless manner and improved in a courtesy way.
Background
In the current production life, the conditions related to resource use and allocation are filled with the accepted judgment standard of 'first come first obtained', such as the use of crossroads in traffic; the ship passes through the ship lock; the vehicle is weighed using a wagon balance, etc. In the passing process of the crossroad, vehicles which preferentially arrive at the crossroad have the right of using the crossroad to pass as long as the vehicles accord with the traffic signal lamp under the current condition. However, when the road in the north section is congested, the signal lamps do not intelligently control the vehicles driving north and south to stop passing through the intersection, control the vehicles driving east and west not to pass through the intersection for left turning, and most intersections are not provided with the right turn signal lamps for east and west. Therefore, games of using rights of vehicles in 3 directions, namely, vehicles driving to the left turn from the south to the north, vehicles driving to the left turn from the west to the east and vehicles driving to the right turn from the east to the west, can be played, and the vehicles in the 3 directions can be used maliciously (subjectively or objectively) at intersections to cause that the vehicles in the east and west can not run straight, so that traffic paralysis is formed. The method is characterized in that a relatively global overall scheduling role is lacked, individual information used by each participating resource (crossroads) is collected and then decision feedback is carried out on the individual information, and the problem that other parts (east-west-going straight) are affected by the problem that one part (north road congestion) is difficult to avoid in the actual operation process, and then the global situation is affected.
Another common resource allocation principle is "reservation" or "shaking", which causes the individual to intervene in the application of resource usage in advance due to anxiety without considering the actual situation of the individual, and the resource allocation may be abandoned or hastily used due to insufficient preparation.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a method and a system for realizing the principle of resource allocation before getting improved without loss, so that global and better resource utilization efficiency can be realized.
To solve the above technical problems, the present invention provides a method for implementing the principle of resource allocation to get first in advance without loss of courtesy, the method comprising: acquiring position information and individual information uploaded by a user terminal in real time; judging whether the user terminal reaches a waiting area or not according to the position information acquired in real time; judging whether lossless modest conditions are met or not for the user terminals arriving at the waiting area according to the individual information uploaded in real time; if the loss-free modest conditions are met, the user terminal meeting the loss-free modest conditions is instructed to temporarily release the occupied service authority; and after waiting for the specified number of other user terminals to obtain the service, the user terminal temporarily releasing the service authority acquires the service authority again.
In some embodiments, the loss-free courtesy is the chance that the served user will occupy the service right, giving other users no loss of their own benefits, and at the same time the overall efficiency of the system can be improved.
In some embodiments, the user terminal is carried with the user at a different location.
In some embodiments, the location information is obtained via GPS information or short-range wireless communication technology.
In some embodiments, the waiting area comprises: one or more spatially combined regions.
In some embodiments, for a user terminal that arrives at a waiting area, according to individual information uploaded in real time, whether lossless courtesy conditions are met is determined, including: determining a vehicle passing area of the intersection according to the passing direction indicated by the intersection traffic light; and judging whether lossless modest conditions are met according to whether the vehicle is currently in the vehicle passing area or not and the specific position in the vehicle passing area.
In some embodiments, for a user terminal that arrives at a waiting area, according to individual information uploaded in real time, whether lossless courtesy conditions are met is determined, including: predicting the treatment timeliness of the vehicle according to the quantity of goods carried by the vehicle and the loading and unloading difficulty; and determining whether lossless modest conditions are met according to the processing aging of the vehicle.
In some embodiments, for a user terminal that arrives at a waiting area, according to individual information uploaded in real time, whether lossless courtesy conditions are met is determined, including: and for the ship waiting for passing the ship lock, determining whether lossless modest conditions are met according to the upstream and downstream services of the ship.
In some embodiments, for a user terminal that arrives at a waiting area, according to individual information uploaded in real time, whether lossless courtesy conditions are met is determined, including: for the inbound ship, whether lossless courtesy conditions are met is determined according to whether a valid dispatch token is held.
Furthermore, the present invention provides a system for implementing the first-come-first-come resource allocation principle without loss of courtesy, the system comprising: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement a method according to the foregoing to modernize the precedent resource allocation philosophy without loss.
After adopting such design, the invention has at least the following advantages:
by the technical scheme, the full utilization of global resources can be benefited, and the idle state that other resource nodes cannot be reached in time by individuals due to congestion of a certain resource node is reduced. The improvement of the resource use judgment basis is beneficial to reducing the vicious resource occupation condition triggered by anxiety of the individual.
Drawings
The foregoing is only an overview of the technical solutions of the present invention, and in order to make the technical solutions of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and the detailed description.
FIG. 1 is a flow chart of a method.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
A more optimized resource distribution system is set up, malicious (subjective or objective) occupation of public resources is reduced, and overall better resource utilization efficiency is achieved.
Lossless courtesy, that is to say the chance that the user being served will be served, that is to say the chance of occupying the service authority, gives other users, does not have too big influence to the benefit of self, and the global efficiency of system can be promoted simultaneously.
The physical area to be defined around the public resource can be one or a plurality of discontinuous areas and support packet processing, and an individual entering the area and needing to use the resource needs to wait for a clear signal to use the resource, otherwise, the individual needs to wait in the waiting area.
The individual should be equipped with intelligent terminal equipment for uploading the location signal and the individual information. The position information is used for judging whether to enter a resource waiting area, and GPS information or a short-distance wireless communication technology can be used; the individual information is used for assisting in calculating the executable condition of the subsequent service and judging whether the individual is in a lossless state, namely, the current resource is suspended from being used, and the whole time consumption of the subsequent multi-stage service processing of the latter in the subsequent stage is not influenced when the latter is used after the latter is used. The terminal device is also configured to receive an instruction of the server resource use permission.
In some scenes, an individual does not need to be equipped with an intelligent terminal, and the individual, a connection server and a device for issuing an instruction are identified by resource configuration.
The server is responsible for collecting individual information entering the waiting area and time-consuming calculation of subsequent services related to the individual, and the server is used for dispatching instructions for resource allocation.
When the resource has the available condition, the server searches the first individual in the waiting area to set the use right of the current resource, calculates whether the individual is in a lossless state, if not, sends a resource using instruction, and if so, calculates the next individual state to find the individual which is not in the lossless state, and modestly gives the current use right to the individual in the lossless state. And if no qualified individual exists in the waiting area, issuing a resource using instruction to the individual which arrives firstly.
The improvement of the invention is that the resource allocation is carried out by adopting the condition of individual subsequent service aging rather than the current resource, and the individual who performs courteous service still keeps the top priority of the next resource allocation, and is most easily accepted by the individual in the actual implementation process.
Traffic intersection application
The intersection is used as a current resource, an undetermined area is planned according to the driving lines, grouping processing is carried out according to target driving routes, each group points to the same driving route passing through the intersection, and each driving line only keeps the position of one parking space. Taking a congestion scene of driving from south to north after passing through an intersection as an example: when the traffic signal lamp allows the vehicles to go straight to the north and south, the vehicles going straight to the north and the vehicles turning right to the east and west may use the intersection resources, the two vehicles in the pending area are judged to be in the modest order by using a lossless modest order principle, the intersections are used in other grouping areas, and the sequence of the two vehicles is determined by the time for reaching the waiting area, so that the vehicles going straight are prevented from worrying about that the vehicles turning right continuously occupy the intersection resources and then enter the intersections in advance. Therefore, meaningless congestion at the traffic intersection can be effectively avoided.
Use of the wagon balance resources
The wagon balance is used for weighing vehicles, is commonly used in large commodity transportation scenes such as factories, mines, high-speed intersections and the like, and has different destinations after the vehicles are weighed by the wagon balance. A waiting area is also set in front of the wagon balance, a plurality of vehicles can be parked in the waiting area, and the individual information is uploaded to the server when the vehicles enter the waiting area. When the local pound resources are idle, the individual is not used according to the principle of first arrival and first arrival, but the server calculates according to the subsequent service aging calculation of each individual and the current resource aging, if the vehicles arrived first accord with the lossless modest principle, the right of using the weighbridge firstly is given out, but the right of sending the weighbridge most preferentially when the next resource is sent out is reserved. Therefore, the global resource utilization efficiency can be improved without damaging the individual benefits.
Scheduling of the ship lock
The ship lock is a hydraulic building which can make ships pass between channels with water level difference on the upstream and the downstream of a lock dam. Setting a waiting area in front of a ship lock, and not using the waiting areas in sequence in the order of first arrival and first arrival, so that the upstream and downstream services corresponding to the ships need to be combined to make a lossless modest judgment, and it is an equivalent result that a modest ship waits before the ship lock or behind the ship lock, but the modest ship is beneficial to quickly finish the services.
Fourth port vehicle arrival dispatching
The port is a comprehensive scene that a plurality of vehicles correspond to a plurality of ships, and congestion on a service resource chain is easily formed by singly adopting a first-come-first-obtained resource allocation strategy, such as a traffic trunk in front of the port and various inspection nodes required for entering the port. Corresponding waiting areas are set at all resource nodes, and resource use is effectively distributed and managed by a lossless modest principle, so that congestion can be effectively relieved, and ship transportation can be efficiently utilized.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the present invention in any way, and it will be apparent to those skilled in the art that the above description of the present invention can be applied to various modifications, equivalent variations or modifications without departing from the spirit and scope of the present invention.
Claims (10)
1. A method for implementing a first-come-first-serve resource allocation principle with lossless modesty, comprising:
acquiring position information and individual information uploaded by a user terminal in real time;
judging whether the user terminal reaches a waiting area or not according to the position information acquired in real time;
judging whether lossless modest conditions are met or not for the user terminals arriving at the waiting area according to the individual information uploaded in real time;
if the loss-free modest conditions are met, the user terminal meeting the loss-free modest conditions is instructed to temporarily release the occupied service authority;
and after waiting for the specified number of other user terminals to obtain the service, the user terminal temporarily releasing the service authority acquires the service authority again.
2. The method according to claim 1, which implements the principle of resource allocation first to the first in lossless courtesy improvement, characterized in that lossless courtesy is the chance that the served user will occupy the service right, giving other users no loss of their own benefits, while the global efficiency of the system can be improved.
3. Method to achieve the modernization of the first-come-first-come resource allocation principle without loss according to claim 2, characterized in that the user terminals are carried around by users at different locations.
4. Method to achieve the modernization of the first-come-first-come resource allocation principle without loss according to claim 2, characterized in that the location information is obtained by means of GPS information or short-range wireless communication technology.
5. The method according to claim 2, wherein the waiting area includes: one or more spatially combined regions.
6. The method according to claim 2, wherein the determining, for the ue arriving at the waiting area, whether lossless courtesy conditions are met according to individual information uploaded in real time includes:
determining a vehicle passing area of the intersection according to the passing direction indicated by the intersection traffic light;
and judging whether lossless modest conditions are met according to whether the vehicle is currently in the vehicle passing area or not and the specific position in the vehicle passing area.
7. The method according to claim 2, wherein the determining, for the ue arriving at the waiting area, whether lossless courtesy conditions are met according to individual information uploaded in real time includes:
predicting the treatment timeliness of the vehicle according to the quantity of goods carried by the vehicle and the loading and unloading difficulty;
and determining whether lossless modest conditions are met according to the processing aging of the vehicle.
8. The method according to claim 2, wherein the determining, for the ue arriving at the waiting area, whether lossless courtesy conditions are met according to individual information uploaded in real time includes:
and for the ship waiting for passing the ship lock, determining whether lossless modest conditions are met according to the upstream and downstream services of the ship.
9. The method according to claim 2, wherein the determining, for the ue arriving at the waiting area, whether lossless courtesy conditions are met according to individual information uploaded in real time includes:
for the inbound ship, whether lossless courtesy conditions are met is determined according to whether a valid dispatch token is held.
10. A system for implementing the principles of first-come-first-serve resource allocation with lossless modesty, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement a method according to any of claims 1 to 9 to improve the first-come resource allocation principle without loss of courtesy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111152225.5A CN113869743A (en) | 2021-09-29 | 2021-09-29 | Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111152225.5A CN113869743A (en) | 2021-09-29 | 2021-09-29 | Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113869743A true CN113869743A (en) | 2021-12-31 |
Family
ID=79000555
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111152225.5A Pending CN113869743A (en) | 2021-09-29 | 2021-09-29 | Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113869743A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1904935A (en) * | 2005-07-26 | 2007-01-31 | 同济大学 | System and method for implementing traffic information service by network technology |
| CN107845283A (en) * | 2016-09-21 | 2018-03-27 | 菜鸟智能物流控股有限公司 | Vehicle control method and related device |
| CN107958600A (en) * | 2017-11-21 | 2018-04-24 | 武汉理工大学 | A kind of real-time control system and method for improving orientation lane capacity |
| CN108616565A (en) * | 2018-03-13 | 2018-10-02 | 北京邮电大学 | A kind of vehicle data communication means and system |
| CN108932563A (en) * | 2018-07-03 | 2018-12-04 | 江苏海事职业技术学院 | One kind interconnects formula harbour information platform Intelligent Dispatching System |
| CN112396216A (en) * | 2020-11-02 | 2021-02-23 | 交通运输部规划研究院 | Port planning big data processing method and system based on ship dynamic information |
-
2021
- 2021-09-29 CN CN202111152225.5A patent/CN113869743A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1904935A (en) * | 2005-07-26 | 2007-01-31 | 同济大学 | System and method for implementing traffic information service by network technology |
| CN107845283A (en) * | 2016-09-21 | 2018-03-27 | 菜鸟智能物流控股有限公司 | Vehicle control method and related device |
| CN107958600A (en) * | 2017-11-21 | 2018-04-24 | 武汉理工大学 | A kind of real-time control system and method for improving orientation lane capacity |
| CN108616565A (en) * | 2018-03-13 | 2018-10-02 | 北京邮电大学 | A kind of vehicle data communication means and system |
| CN108932563A (en) * | 2018-07-03 | 2018-12-04 | 江苏海事职业技术学院 | One kind interconnects formula harbour information platform Intelligent Dispatching System |
| CN112396216A (en) * | 2020-11-02 | 2021-02-23 | 交通运输部规划研究院 | Port planning big data processing method and system based on ship dynamic information |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10440679B2 (en) | Passenger load prediction systems and methods for predicting passenger load | |
| JP7311438B2 (en) | Event dispatch device, event dispatch method, and program | |
| Ahmane et al. | Modeling and controlling an isolated urban intersection based on cooperative vehicles | |
| CN105405285B (en) | Automatically switch and rob the vehicle dispatching method and scheduling system of monotype and distribute leaflets pattern | |
| WO2018000931A1 (en) | Small passenger car intensive scheduling method for multi-constraint networks | |
| CN112561379A (en) | Regional network taxi appointment-oriented scheduling method | |
| CN107170271B (en) | Regional management scheduling method and system for Internet of vehicles | |
| CN110991817B (en) | Route planning method and device and server | |
| CN113393137B (en) | Scheduling sharing system based on Internet of vehicles | |
| CN110782694A (en) | Internet bus arrival and stop management optimization method | |
| CN105702017A (en) | Vehicle scheduling method and device | |
| CN115762229B (en) | Multi-vehicle-type vehicle arrival guiding method, system, equipment and medium for dynamic berth allocation | |
| CN108806235B (en) | Intelligent public transportation scheduling method for on-demand service | |
| CN107105413A (en) | A kind of port vehicle intelligent network contact system based on reliable news broadcast mechanism self-organizing network | |
| CN111771224A (en) | Emergency traffic control system using mobile device | |
| JPWO2019243883A1 (en) | Commercial vehicle operation system | |
| CN112991783A (en) | Bus priority control method and device based on real-time position of internet public transport | |
| CN113869743A (en) | Method and system for realizing resource allocation principle of first-come first-serve by lossless modesty | |
| CN110111600B (en) | Parking lot recommendation method based on VANETs | |
| CN113936496B (en) | Passenger identification-based intelligent interactive traffic scheduling method and system | |
| JP7395717B2 (en) | Vehicle dispatch system, vehicle dispatch method and vehicle dispatch device | |
| JP7333227B2 (en) | Traffic communication system, base station, and traffic management method | |
| KR102136307B1 (en) | Hotel shuttle bus sharing platform operating system and Free transportation service providing method for guest in a hotel using the same | |
| CN116543587B (en) | Station display screen intelligent information release method, device, equipment and storage medium | |
| CN113807796B (en) | Collaborative method for establishing collaborative waiting area to optimize different transportation routes between 2 points |
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 |