CN113066279A - Method for subsequent optimization of network points in operation - Google Patents
Method for subsequent optimization of network points in operation Download PDFInfo
- Publication number
- CN113066279A CN113066279A CN202110285180.2A CN202110285180A CN113066279A CN 113066279 A CN113066279 A CN 113066279A CN 202110285180 A CN202110285180 A CN 202110285180A CN 113066279 A CN113066279 A CN 113066279A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- network
- user
- network points
- points
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000005457 optimization Methods 0.000 title claims abstract description 14
- 238000012423 maintenance Methods 0.000 claims abstract description 19
- 238000004590 computer program Methods 0.000 claims description 2
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/207—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles with respect to certain areas, e.g. forbidden or allowed areas with possible alerting when inside or outside boundaries
-
- 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
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0645—Rental transactions; Leasing transactions
-
- G06Q50/40—
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
- G07B15/00—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
- G07B15/02—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Entrepreneurship & Innovation (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computing Systems (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a method for subsequent optimization of a network point in operation, which comprises a step S1 of generating a forced vehicle returning vehicle when a vehicle in a certain network point reaches the upper limit of the number of available parking spaces and the vehicle requesting the vehicle returning enters an electronic fence of the network point; step S2, after a forced returning vehicle is generated, a red packet vehicle is generated; step S3, in a first preset time period, if the red packet vehicle is not taken away by the user, generating a vehicle dispatching work order, wherein the vehicle dispatching work order is used for indicating the operation and maintenance personnel to dispatch the vehicle of the network; and step S4, adjusting the network point attribute and the parking number in the current period according to how the vehicle is called out after the user forcibly returns the vehicle in the previous period and/or the forced returning time is equal to the user vehicle taking time interval and/or the average parking number of the network points. The invention solves the problem of how to refine the operation of the network in the operation, provides theoretical data support and a corresponding closed-loop solution for urban operation, and can solve the problem that some users cannot return vehicles due to full parking spaces.
Description
Technical Field
The invention relates to the field of shared automobile parking lots, in particular to a method for subsequent optimization of a network point in operation.
Background
The responsible person of the city network points signs the entity network points, adds and subtracts the number of the vehicles of the entity network points, adds and subtracts the number of the super parking points and opens the virtual network points according to experience.
When the net point reaches the upper limit of the number of available parking stalls, the APP displays that the number of parking stalls is full, the cars cannot be returned, but most of user processes generally do not check the APP, and the cars cannot be returned after the APP is found.
The network points reach the upper limit of the available parking spaces as follows:
and (5) signing a contract with a site party to stipulate a fixed number of vehicles.
And (3) turning on and over stopping of the entity network: and signing a contract with a site party to stipulate the fixed parking space number and the super parking space number of the system configuration.
Virtual net points: the system configures the number of vehicle seats (configurable without upper limit).
The prior art has the following disadvantages:
(1) in operation, the network points are started in a mode of an entity network point or a virtual network point, and whether the entity network point is started for overtime or not is short of data theoretical basis.
(2) The number of the stations matched by the network points in operation lacks a data theoretical basis.
(3) After the user arrives at the network point, the vehicle can not be returned because the number of the parked vehicles at the network point reaches the upper limit of the number of the available parking spaces.
Disclosure of Invention
In view of the above, the present invention has been developed to provide a method for subsequent optimization of an operating network point that overcomes or at least partially solves the above mentioned problems.
According to a first aspect, a method for subsequent optimization of a network node in operation is provided, which includes step S1, when a vehicle in a network node reaches an upper limit of available parking spaces and the vehicle requesting to return the vehicle enters the network node electronic fence, allowing a user to normally return the vehicle, and generating a forced vehicle returning; step S2, after a forced vehicle returning vehicle is generated, a red packet vehicle is generated, and the red packet vehicle is used for encouraging a user to order the vehicle of the website; step S3, in a first preset time period, if the red packet vehicle is not taken away by the user, generating a vehicle dispatching work order, wherein the vehicle dispatching work order is used for indicating the operation and maintenance personnel to dispatch the vehicle of the network; and step S4, adjusting the network point attribute and the parking number in the current period according to how the vehicle is called out after the user forcibly returns the vehicle in the previous period and/or the forced returning time is equal to the user vehicle taking time interval and/or the average parking number of the network points.
In a possible implementation, step S4 specifically includes: step S41, counting the average number A, the lowest average number L and the highest average number H of parked vehicles of the network points in the previous period; and step S42, for the entity network points which cannot be overstocked, adjusting the number of the rental cars in the current period to be A, for the entity network points which can be overstocked, adjusting the number of the rental cars to be L, opening the number of the overstocked car positions to be (H-L), and for the virtual network points, adjusting the number of the rental cars to be H.
In one possible embodiment, in step S42, when the distance between the time of picking up the car and the time of returning the car at the virtual website is less than the third time period, the number of cars is adjusted to have no upper limit.
In a possible embodiment, in step S42, when the distance between the time of taking the car and the time of returning the car of the physical website is less than the third time period, the physical website is adjusted to be the virtual website.
In a possible embodiment, before or after step 41, the method further includes: step S43, counting the proportion of the current network points taken away by the user and the proportion of the current network points taken away by the user; and step S44, for the network point whose ratio of the subsequent transportation, maintenance and removal is greater than the ratio of the network point removed by the user, the network point is adjusted to be a non-super-stop entity network point, and for the network point whose ratio of the subsequent transportation, maintenance and removal is less than the ratio of the network point removed by the user, the network point is adjusted to be a super-stop entity network point.
In a possible implementation, after step S44, the method further includes: and step S45, for the network points with the ratio of being transferred by the subsequent operation and maintenance being smaller than the ratio of being taken away by the user, if the network points do not allow the overtime, searching the parking lot capable of being overtimed around the network points, and selecting the network points as the entity network points capable of being overtimed.
In a possible implementation, after step S44, the method further includes: and step S46, for the network points with the proportion which are called by the subsequent operation and maintenance and are smaller than the proportion which is taken away by the user, searching virtual network points around the network points.
In one possible embodiment, one cycle is one week or one month.
According to a second aspect, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed on a computer, causes the computer to perform the method of the first aspect or the method of any one of the possible designs of the first aspect.
According to a third aspect, there is provided a computing device comprising a memory having stored therein executable code, and a processor which, when executing the executable code, implements the method of any of the first aspects or any one of the possible designs of the first aspects.
The invention solves the problem of how to refine the operation of the network in the operation, provides theoretical data support and a corresponding closed-loop solution for urban operation, and can solve the problem that some users cannot return vehicles due to full parking spaces.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for subsequent optimization of an operating node according to an embodiment of the present invention.
Detailed Description
The terms "first," "second," and the like in the description and in the claims and in the drawings of the present invention are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. Furthermore, the terms "comprises" and "comprising," as well as any variations thereof, are intended to cover a non-exclusive inclusion, such as a list of steps or elements. A method, system, article, or apparatus is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not explicitly listed or inherent to such process, system, article, or apparatus.
Before explaining the embodiments of the present application in detail, some abbreviations and terms referred to in the embodiments of the present application will be introduced.
And (3) a solid network point: and signing a leasing contract with a field party, and leasing a website with a fixed number of vehicle digits monthly.
Stopping in an overtaking mode: after the use of the fixed number of the vehicles at a certain entity network reaches the upper limit, the vehicles entering the network are charged according to the vehicles which are temporarily stopped.
Virtual net points: all vehicles enter the network points in a social vehicle mode, and the site side charges according to the temporary stop.
The technical solution of the present invention is further described in detail with reference to the accompanying drawings and embodiments.
The embodiment of the invention provides a method for subsequent optimization of a network point in operation, which comprises the following steps:
and step S1, when the vehicle in a certain network reaches the upper limit of the available parking space number and the vehicle requesting to return enters the electronic fence of the network, allowing the user to normally return the vehicle and generating a forced vehicle returning.
And when the vehicle in a certain network reaches the upper limit of the number of available parking spaces, if the user is judged to enter the electronic fence of the network and click the vehicle returning operation, allowing the user to normally return the vehicle.
And step S2, after the forced vehicle returning is generated, a red packet vehicle is generated, and the red packet vehicle is used for encouraging the user to order the vehicle of the website.
Specifically, after a forced vehicle returning vehicle is generated, a red-envelope vehicle is generated immediately, so that a user is encouraged to use the vehicle, and the number of vehicles at the website is reduced to be below the available number of vehicles as soon as possible.
And step S3, in a first preset time period, if the red packet vehicle is not taken away by the user, generating a vehicle dispatching work order, wherein the vehicle dispatching work order is used for indicating the operation and maintenance personnel to dispatch the vehicle of the network.
For example, a designated scheduling work order (the work order with the highest scheduling level) is generated 30 minutes after forced vehicle return, and if no user uses the vehicle in 30 minutes, the operation and maintenance personnel can be off-line to ensure that the vehicle is tuned away from the network within 1 hour.
And step S4, adjusting the network point attribute and the parking number in the current period according to how the vehicle is called out after the user forcibly returns the vehicle in the previous period and/or the forced returning time is equal to the user vehicle taking time interval and/or the average parking number of the network points.
And for the number of parking spaces (fixed parking spaces) which cannot be configured systematically, the number of the fixed parking spaces to be rented is calculated according to the big data of the system, and then the number of the fixed parking spaces to be rented is notified to a website administrator through short messages and mails.
The parking space number (super parking space number and virtual network point parking space number) which can be configured by the system can be dynamically changed according to different results.
In one example, step S4 specifically includes:
and step S41, counting the average number A of parked vehicles, the lowest average number L of parked vehicles and the highest average number H of parked vehicles of the website in the previous period.
And step S42, for the entity network points which cannot be overstocked, adjusting the number of the rental cars in the current period to be A, for the entity network points which can be overstocked, adjusting the number of the rental cars to be L, opening the number of the overstocked car positions to be (H-L), and for the virtual network points, adjusting the number of the rental cars to be H.
In one example, when the distance between the car taking time and the car returning time of the virtual website is less than the third time period in step S42, the number of cars is adjusted to have no upper limit. If the network is a virtual network, the proposal is directly converted into the number of parking spaces without upper limit, because the parking fee cost generated by the network with high parking fee is very low.
In one example, in step S42, when the distance between the time of taking a car and the time of returning the car of the entity website is less than the third time period, the entity website is adjusted to be the virtual website. If the network is an entity network, the network is directly converted into a virtual network, so that the network leasing cost is reduced.
In one example, before or after step 41, further comprising:
and step S43, counting the proportion of the current website taken away by the transport and maintenance vehicle and the proportion taken away by the user in the previous period.
And step S44, for the network point whose ratio of the subsequent transportation, maintenance and removal is greater than the ratio of the network point removed by the user, the network point is adjusted to be a non-super-stop entity network point, and for the network point whose ratio of the subsequent transportation, maintenance and removal is less than the ratio of the network point removed by the user, the network point is adjusted to be a super-stop entity network point.
The subsequent network points which are called by the operation and maintenance and account for a larger amount belong to the high car returning network points, the user has a lower car taking willingness, and the system can suggest network point managers to sign the entity network points to control the parking fee cost and the vehicle dispatching cost. And the subsequent network points with larger vehicle taking account by the user belong to high-vehicle-taking returning network points, if the network points negotiate with the site side to open the overtime, the system can recommend the network point manager to reasonably rent the number of the vehicles and open the overtime.
After step S44, the method further includes:
and step S45, for the network points with the ratio of being transferred by the subsequent operation and maintenance being smaller than the ratio of being taken away by the user, if the network points do not allow the overtime, searching the parking lot capable of being overtimed around the network points, and selecting the network points as the entity network points capable of being overtimed.
If the field does not allow the overtime to be opened, the system suggests to find a parking lot around the network site where the overtime can be opened to cooperate.
After step S44, the method further includes:
and step S46, for the network points with the proportion which are called by the subsequent operation and maintenance and are smaller than the proportion which is taken away by the user, searching virtual network points around the network points.
The virtual network point can be opened around according to the user requirement (the virtual network point does not need to negotiate with the site party in business).
In one example, the period is a week or a month, and the week or the month is only an example, and may be other time periods, which are adjusted according to the actual situation.
The above embodiments are provided to further explain the objects, technical solutions and advantages of the present invention in detail, it should be understood that the above embodiments are merely exemplary embodiments of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for subsequent optimization of an operator network site, comprising:
step S1, when the vehicle in a certain network reaches the upper limit of the available parking space number and the vehicle requesting to return enters the electronic fence of the network, allowing the user to normally return the vehicle and generating a forced vehicle returning;
step S2, after a forced vehicle returning vehicle is generated, a red packet vehicle is generated, and the red packet vehicle is used for encouraging a user to order the vehicle of the website;
step S3, in a first preset time period, if the red packet vehicle is not taken away by the user, generating a vehicle dispatching work order, wherein the vehicle dispatching work order is used for indicating the operation and maintenance personnel to dispatch the vehicle of the network;
and step S4, adjusting the network point attribute and the parking number in the current period according to how the vehicle is called out after the user forcibly returns the vehicle in the previous period and/or the forced returning time is equal to the user vehicle taking time interval and/or the average parking number of the network points.
2. The method for subsequent optimization by a website in operation according to claim 1, wherein the step S4 specifically includes:
step S41, counting the average number A, the lowest average number L and the highest average number H of parked vehicles of the network points in the previous period;
and step S42, for the entity network points which cannot be overstocked, adjusting the number of the rental cars in the current period to be A, for the entity network points which can be overstocked, adjusting the number of the rental cars to be L, opening the number of the overstocked car positions to be (H-L), and for the virtual network points, adjusting the number of the rental cars to be H.
3. The method of claim 2, wherein in step S42, when the distance between the time of picking up and the time of returning the car at the virtual network point is less than the third time period, the number of cars is adjusted to have no upper limit.
4. The method for subsequent optimization by a carrier dot in operation as claimed in claim 2, wherein in step S42, when the distance between the time of picking up the car and the time of returning the car of the entity dot is less than the third time period, the entity dot is adjusted to be a virtual dot.
5. The method of intra-operational mesh point subsequent optimization according to claim 2, further comprising, before or after step 41:
step S43, counting the proportion of the current network points taken away by the user and the proportion of the current network points taken away by the user;
and step S44, for the network point whose ratio of the subsequent transportation, maintenance and removal is greater than the ratio of the network point removed by the user, the network point is adjusted to be a non-super-stop entity network point, and for the network point whose ratio of the subsequent transportation, maintenance and removal is less than the ratio of the network point removed by the user, the network point is adjusted to be a super-stop entity network point.
6. The method for website subsequent optimization in operation as claimed in claim 5, wherein after step S44, further comprising:
and step S45, for the network points with the ratio of being transferred by the subsequent operation and maintenance being smaller than the ratio of being taken away by the user, if the network points do not allow the overtime, searching the parking lot capable of being overtimed around the network points, and selecting the network points as the entity network points capable of being overtimed.
7. The method for website subsequent optimization in operation as claimed in claim 5, wherein after step S44, further comprising:
and step S46, for the network points with the proportion which are called by the subsequent operation and maintenance and are smaller than the proportion which is taken away by the user, searching virtual network points around the network points.
8. The method of claim 1, wherein a period is one week or one month.
9. A computer-readable storage medium, on which a computer program is stored which, when executed in a computer, causes the computer to carry out the method of any one of claims 1-8.
10. A computing device comprising a memory and a processor, wherein the memory has stored therein executable code that, when executed by the processor, performs the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110285180.2A CN113066279B (en) | 2021-03-17 | 2021-03-17 | Method for subsequent optimization of network points in operation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110285180.2A CN113066279B (en) | 2021-03-17 | 2021-03-17 | Method for subsequent optimization of network points in operation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113066279A true CN113066279A (en) | 2021-07-02 |
| CN113066279B CN113066279B (en) | 2022-09-09 |
Family
ID=76560912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110285180.2A Active CN113066279B (en) | 2021-03-17 | 2021-03-17 | Method for subsequent optimization of network points in operation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113066279B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2015100866A4 (en) * | 2015-06-30 | 2015-09-24 | Bright, Rex Steven MR | An Electronic LED Yellow L plates that Lights up from a control switch inside the vehicle ( Leaner Driver Yellow L Plates ) An Electronic LED Red P Plate that Lights up from a control switch inside the vehicle ( Provisional Driver Red P Plates ) An Electronic LED Green P Plate that Lights up from a control switch inside the vehicle ( Provisional Driver Green P Plates ) All of these L and P Plates are transferable from Vehicle to Vehicle if needed. . |
| CN108346010A (en) * | 2018-04-23 | 2018-07-31 | 徐漫洋 | Shared Truck dispartching method based on user requirements analysis |
| CN108510729A (en) * | 2018-04-24 | 2018-09-07 | 徐漫洋 | Shared automobile scheduling system and dispatching method |
| CN108510730A (en) * | 2018-04-24 | 2018-09-07 | 徐漫洋 | Vehicle dispatching method and system between shared automobile site |
| CN109360413A (en) * | 2018-12-11 | 2019-02-19 | 北京首汽智行科技有限公司 | A kind of vehicle dispatching method and system |
| CN110288263A (en) * | 2019-07-03 | 2019-09-27 | 北京首汽智行科技有限公司 | It is a kind of that method is determined based on the shared parking of automobile site for being with garage |
| CN110309980A (en) * | 2019-07-09 | 2019-10-08 | 北京首汽智行科技有限公司 | A kind of fixed parking optimal monthly rent parking stall number in site determines method |
| CN110853374A (en) * | 2019-10-30 | 2020-02-28 | 中国第一汽车股份有限公司 | Shared automobile scheduling method and system based on unmanned technology |
| CN111815937A (en) * | 2019-11-22 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Control method and device for dispatching of super-parking vehicles, storage medium and electronic equipment |
| CN111815991A (en) * | 2019-05-30 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Shared automobile parking management and control method, electronic equipment and storage medium |
-
2021
- 2021-03-17 CN CN202110285180.2A patent/CN113066279B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2015100866A4 (en) * | 2015-06-30 | 2015-09-24 | Bright, Rex Steven MR | An Electronic LED Yellow L plates that Lights up from a control switch inside the vehicle ( Leaner Driver Yellow L Plates ) An Electronic LED Red P Plate that Lights up from a control switch inside the vehicle ( Provisional Driver Red P Plates ) An Electronic LED Green P Plate that Lights up from a control switch inside the vehicle ( Provisional Driver Green P Plates ) All of these L and P Plates are transferable from Vehicle to Vehicle if needed. . |
| CN108346010A (en) * | 2018-04-23 | 2018-07-31 | 徐漫洋 | Shared Truck dispartching method based on user requirements analysis |
| CN108510729A (en) * | 2018-04-24 | 2018-09-07 | 徐漫洋 | Shared automobile scheduling system and dispatching method |
| CN108510730A (en) * | 2018-04-24 | 2018-09-07 | 徐漫洋 | Vehicle dispatching method and system between shared automobile site |
| CN109360413A (en) * | 2018-12-11 | 2019-02-19 | 北京首汽智行科技有限公司 | A kind of vehicle dispatching method and system |
| CN111815991A (en) * | 2019-05-30 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Shared automobile parking management and control method, electronic equipment and storage medium |
| CN110288263A (en) * | 2019-07-03 | 2019-09-27 | 北京首汽智行科技有限公司 | It is a kind of that method is determined based on the shared parking of automobile site for being with garage |
| CN110309980A (en) * | 2019-07-09 | 2019-10-08 | 北京首汽智行科技有限公司 | A kind of fixed parking optimal monthly rent parking stall number in site determines method |
| CN110853374A (en) * | 2019-10-30 | 2020-02-28 | 中国第一汽车股份有限公司 | Shared automobile scheduling method and system based on unmanned technology |
| CN111815937A (en) * | 2019-11-22 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Control method and device for dispatching of super-parking vehicles, storage medium and electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 姚恩建等: "面向自组织平衡的共享电动汽车调度优化方法", 《交通运输系统工程与信息》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113066279B (en) | 2022-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108805660A (en) | Order processing method, apparatus and server | |
| CN107301573B (en) | Method and system for automatically acquiring electronic invoice | |
| EP2639752A2 (en) | Method and apparatus for providing late return detection of a shared vehicle | |
| CN105096183A (en) | Task-triggered public bicycle self-scheduling method and system based on Internet of Things | |
| CN108830504B (en) | Vehicle demand prediction method, system, server and computer storage medium | |
| CN105225521A (en) | Based on parking management system and the method for Internet of Things | |
| CN110111211A (en) | A kind of reserving method of charging pile, device, service terminal and storage medium | |
| CN105096187A (en) | Parking space renting system based on cloud platform and method thereof | |
| CN104933891A (en) | Information processing method, client and service platform | |
| CN107097666A (en) | The method and device of charging | |
| CN105513412A (en) | Bluetooth remote control parking space lock-based parking reservation fee collection system and method thereof | |
| CN109903580B (en) | Management system, management method, and non-transitory recording medium | |
| CN109190038A (en) | A kind of web-site recommendations method, terminal device and medium based on service appointment | |
| CN107301586B (en) | Rentable vehicle prediction method, rentable vehicle prediction device and server | |
| CN101661650A (en) | Digital urban parking method and digital urban parking system | |
| CN108777002A (en) | Parking fee collective system method, system and computer readable storage medium | |
| CN110598977A (en) | Shared automobile scheduling method and related device | |
| CN109670813A (en) | Account management method, device, computer installation and computer readable storage medium | |
| CN111915209A (en) | Shared vehicle scheduling method and device, computer equipment and storage medium | |
| CN112950041A (en) | Shared vehicle scheduling method, device, storage medium and computer program product | |
| CN111695711A (en) | Reservation method and device | |
| CN104735103B (en) | A kind of management of distributed data and method of reseptance, device | |
| CN110852851A (en) | Block chain-based vehicle sharing method and device and readable storage medium | |
| CN111445292B (en) | Method for automatically matching coupon touch users | |
| CN113066279B (en) | Method for subsequent optimization of network points in operation |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |