CN108154250A - A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms - Google Patents
A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms Download PDFInfo
- Publication number
- CN108154250A CN108154250A CN201611103426.5A CN201611103426A CN108154250A CN 108154250 A CN108154250 A CN 108154250A CN 201611103426 A CN201611103426 A CN 201611103426A CN 108154250 A CN108154250 A CN 108154250A
- Authority
- CN
- China
- Prior art keywords
- region
- website
- dispatching
- dispatching requirement
- requirement amount
- 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 20
- 238000000638 solvent extraction Methods 0.000 title claims abstract description 12
- 238000012937 correction Methods 0.000 claims description 6
- 230000008901 benefit Effects 0.000 abstract description 2
- 230000008859 change Effects 0.000 description 3
- 230000008520 organization Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to public transport scheduling fields, propose a kind of public bicycles intelligent dispatching system region partitioning method based on k means algorithms, applied to the region division of city public bicycle intelligent dispatching system, the area division scheme of demand absolute value summation minimum is obtained.This method specific steps include：Step 1. carries out region division using k means algorithms to public bicycles website；Step 2. counts the dispatching requirement amount of each website；Step 3. carries out second zone division to the marginality website in region of the scheduling demand absolute value more than 20；Step 4. generates final area division scheme.The present invention takes full advantage of the geographical location of website and the dispatching requirement amount of website, consider the auto-flowability of bicycle system, to public bicycles dispatcher-controlled territory classifying rationally, ensure that more regions just can not meet scheduling in region, the generation of trans-regional scheduler task is reduced, the timeliness of scheduling can be improved.
Description
Technical field
The invention belongs to public transport scheduling fields, specifically design a kind of public bicycles intelligence based on k-means algorithms
System realm division methods can be dispatched, are related to the application and improvement of secondary k-means region partitioning algorithms, generate rational scheduling
Region, so that public bicycles dispatch shortest path.
Background technology
Component part of the public bicycles intelligent dispatching system (PBDS) as public bike renting system is to realize public affairs
Altogether normal consistency between bicycle each website, central controlled modernization information system is carried out to bicycle system operation, be
Ensure that bicycle is rented, is also smooth, improving dispatching efficiency, the transparent commander of implementation provides sound assurance.It is however existing public
Bicycle dispatches system call inefficiency, and the planning of Route Scheduling is not perfect, only focuses on the completion of scheduler task, does not account for
To the waste of the timeliness and scheduling cost of scheduling, the Service Quality of public bike renting system can be restricted to a certain extent
Amount, such as：
The concept of region division is not accounted for when the 1st, dispatching, the route for leading to scheduling is long；
2nd, the auto-flowability that public bicycles system has is not accounted for, easily generates excessively scheduling；
3rd, the bicycle quantity of scheduling is too big, and the capacity limit of car hauler does not account for into, leads to required car hauler
It is excessive.
For public bicycles scheduling systems organization Route Scheduling there may be problem, the present invention proposes a kind of to be based on k-
The public bicycles intelligent dispatching system region partitioning method of means algorithms so that the efficiency of scheduling improves, shortens scheduling road
Diameter reduces car hauler quantity required reduction scheduling cost.The present invention is based on Chongqing City's scientific research and innovation project-city in 2016 is public
Research (project number CYS16171) of bicycle intelligent dispatching algorithm
Invention content
(1) technical problems to be solved
The technical problems to be solved by the invention are to provide a kind of public bicycles intelligent scheduling based on k-means algorithms
System realm division methods, the Route Scheduling that this method can solve current public bicycles scheduling systems organization is long, scheduling
The problems such as demand is excessive, causes excessively to dispatch, and excessive to car hauler demand.So as to enable the smooth no barrier of bicycle system
The operation hindered will not lead to the problem of difficulty of hiring a car and return the car difficult, and it is convenient to be that citizen provide.
(2) technical solution
The present invention provides a kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms,
Include the following steps：
S1, K region is divided into according to longitude and latitude to all websites in public bicycles system using k-means algorithms；
S2, calculate each region all websites dispatching requirement amount summation；
S3, the edge site in region of the dispatching requirement amount summation absolute value more than 20 is placed into a set, introduces scheduling
This new parameter of demand is partitioned into new region to the website in this set again with k-means algorithms；
S4, generation final area splitting scheme.
Preferably, the step S1 is specially：
S101：Historical data is obtained, history rent is imported from bicycle rental system and goes back car data, counts each website
Rent is returned the car total amount, is chosen and is rented total amount of returning the car and account for annual total all websites for renting more than 0.25% total amount of returning the car as A class websites；
S102：Each A classes website is to other A class websites apart from summation in calculating S101 respectively, and selection K is apart from summation
Initial center point of the maximum website as region partitioning algorithm；
S103：Remaining non-A classes website is divided into K classes according to the principle of the distance minimum with central point, i.e. generation is initial
K region；
S104：The cluster centre point in K region is recalculated, and repeats S103 operations, by remaining website again region point
Class；
S105：S104 is repeated until the website in the region that cluster centre point no longer changes or divides no longer occurs
Change or each region in each website and central site distance error sum of squares Local Minimum until；
S106：Generate K stable region, the website in each region no longer changes.
Preferably, the step S2 is specially：
S201：Expire the difference meter of hire a car sum and the sum of returning the car of vehicle rate and each website in real time according to bicycle system
Calculate the current scheduling demand of each website；
S202：The dispatching requirement amount of obtained each website is imported into bicycle rental system, statistics is each respectively
The sum of the dispatching requirement amount in region.
Preferably, the step S3 is specially：
S301：Finding out needs to correct the region divided, that is, finds out dispatching requirement amount summation in S202 and be more than 20 (each scheduling
The maximum bicycle number that Che Suoneng is loaded) region, if it is 0 or 1 to meet the areal of condition, completes region and draw
Point, if the areal for meeting condition is more than 1, correcting region is needed to divide；
S302：Using the region of dispatching requirement amount maximum as starting correcting region, by its edge site and adjacent area
Edge site place one set in, by calculate these edge sites and all areas central point distance and scheduling need
The sum of the correction value for the amount of asking reassigns to these edge sites in different regions；
S303：It calculates in the newly-generated initial correction region after the dispatching requirement amount of all websites, if demand is small
In 20, then success is corrected, generates stable region；
S304：Step described in repeating S302, S303, adjusting remaining needs modified region, until the scheduling of all areas
Until demand is both less than 20；
S305：If there is region that can not reach the condition that dispatching requirement amount is less than 20 by the adjustment of edge site, to the greatest extent may be used
The dispatching requirement amount for meeting remaining website more than energy is intended to 0.
Preferably, the step S4 is specially：Generate final area splitting scheme.
(3) advantageous effect
History rent the present invention is based on existing bicycle rental system goes back car data, and fusion k-means region divisions are calculated
Method is simultaneously improved algorithm, realizes the division of dispatcher-controlled territory, and takes full advantage of the auto-flowability of public bicycles and each
The dispatching requirement type in a region, reduces the generation of trans-regional task, shortens the total path of scheduling, so as to improve bicycle
The service efficiency of leasing system, for citizen provide it is convenient, efficient, smoothly service.
Description of the drawings
The flow chart of Fig. 1 the method for the present invention
The flow chart of k-means algorithms in Fig. 2 the method for the present invention
The flow chart of improved k-means algorithms in Fig. 3 the method for the present invention
Specific embodiment
Scheme below in conjunction with the accompanying drawings with implementation, the specific implementation method of the present invention is described in further detail.Implement below
For illustrating the present invention, but not is used for limiting the scope of the invention case.
Fig. 1 is the flow chart of the method for the present invention, and the present invention provides a kind of public bicycles intelligence based on k-means algorithms
System realm division methods are dispatched, are included the following steps：
S1, K region is divided into according to longitude and latitude to all websites in public bicycles system using k-means algorithms；
S2, calculate each region all websites dispatching requirement amount summation；
S3, the edge site in region of the dispatching requirement amount summation absolute value more than 20 is placed into a set, introduces scheduling
This new parameter of demand is partitioned into new region to the website in this set again with k-means algorithms；
S4, generation final area splitting scheme.
Preferably, the step S1 is specially：
S101：Historical data is obtained, history rent is imported from bicycle rental system and goes back car data, counts each website
Rent is returned the car total amount, is chosen and is rented total amount of returning the car and account for annual total all websites for renting more than 0.25% total amount of returning the car as A class websites；
S102：Each A classes website is calculated in S101 respectively to other A class websites apart from summation S
Wherein SijFor the distance of No. i-th website and jth website, m is the number of A class websites.K is chosen apart from summation most
Initial center point of the big website as region partitioning algorithm；
S103：Remaining non-A classes website is divided into K classes according to the principle of the distance minimum with central point, i.e. generation is initial
K region；
S104：The cluster centre point in K region is recalculated, and repeats S103 operations, by remaining website again region point
Class；
S105：S104 is repeated until the website in the region that cluster centre point no longer changes or divides no longer occurs
Change or each region in each website and central site distance error sum of squares Local Minimum until；
S106：Generate K stable region, the website in each region no longer changes.
Preferably, the step S2 is specially：
S201：Expire the difference meter of hire a car sum and the sum of returning the car of vehicle rate and each website in real time according to bicycle system
Calculate the current scheduling demand of each website；
S202：The dispatching requirement amount of obtained each website is imported into bicycle rental system, statistics is each respectively
The sum of the dispatching requirement amount in region.
Preferably, the step S3 is specially：
S301：Finding out needs to correct the region divided, that is, finds out dispatching requirement amount summation in S202 and be more than 20 (each scheduling
The maximum bicycle number that Che Suoneng is loaded) region, if it is 0 or 1 to meet the areal of condition, completes region and draw
Point, if the areal for meeting condition is more than 1, correcting region is needed to divide.
S302：Using the region of dispatching requirement amount maximum as starting correcting region, by its edge site and adjacent area
Edge site place one set in, by the distance di for calculating these edge sites and all areas central pointjAnd it adjusts
Spend demand correction value R's and W
R=Ri+RALL
W=0.6dij+0.4R
These edge sites being reassigned in different regions, when correcting region, should meet the following conditions, and 1) it is initial
The maximum absolute value 2 of correcting region dispatching requirement amount) if absolute value is equal, the region using demand as negative value is initially to repair
Positive region 3) it is minimum for most preferably with the area change of edge site.
S303：It calculates in the newly-generated initial correction region after the dispatching requirement amount of all websites, if demand is small
In 20, then success is corrected, generates stable region；
S304：Step described in repeating S302, S303, adjusting remaining needs modified region, until the scheduling of all areas
Until demand is both less than 20；
S305：If there is region that can not reach the condition that dispatching requirement amount is less than 20 by the adjustment of edge site, to the greatest extent may be used
The dispatching requirement amount for meeting remaining website more than energy is intended to 0.
Preferably, the step S4 is specially：Generate final area splitting scheme.
Illustrative embodiments listed by the present invention as described above, but the content only to facilitate understand the present invention and adopt
One case, is not limited to the present invention.In the case of without departing from spirit of the invention and essence, it is familiar with this field
Technical staff can make various corresponding modifications and variations in the formal or details of implementation according to the present invention, but the present invention
Scope of patent protection, must still be subject to the range that appended rights protection book is defined.
Claims (5)
1. a kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms, specifically includes as follows
Step：
S1, K region is divided into according to longitude and latitude to all websites in public bicycles system using k-means algorithms；
S2, calculate each region all websites dispatching requirement amount summation；
S3, the edge site in region of the dispatching requirement amount summation absolute value more than 20 is placed into a set, introduces dispatching requirement
This new parameter is measured, new region is partitioned into the website in this set again with k-means algorithms；
S4, generation final area splitting scheme.
2. the public bicycles intelligent dispatching system region partitioning method according to claim 1 based on k-means algorithms,
It is characterized in that：S1, K area is divided into according to longitude and latitude to all websites in public bicycles system using k-means algorithms
Domain is specially：
S101：Historical data is obtained, history rent is imported from bicycle rental system and goes back car data, counts the rent of each website also
Vehicle total amount, selection rent total amount of returning the car and account for annual total all websites for renting more than 0.25% total amount of returning the car as A class websites；
S102：Each A classes website is to other A class websites apart from summation in calculating S101 respectively, and selection K is apart from summation maximum
Initial center point of the website as region partitioning algorithm；
S103：Remaining non-A classes website is divided into K classes according to the principle of the distance minimum with central point, that is, generates initial K
Region；
S104：The cluster centre point in K region is recalculated, and repeats S103 operations, by remaining website again territorial classification；
S105：S104 is repeated until the website in the region that cluster centre point no longer changes or divides no longer changes
Or in each region until the error sum of squares Local Minimum of each website and central site distance；
S106：Generate K stable region, the website in each region no longer changes.
3. the public bicycles intelligent dispatching system region partitioning method according to claim 1 based on k-means algorithms,
It is characterized in that S2, calculate each region all websites dispatching requirement amount summation, specially：
S201：The mathematic interpolation for expiring the hire a car sum and sum of returning the car of vehicle rate and each website in real time according to bicycle system is every
The current scheduling demand of a website；
S202：The dispatching requirement amount of obtained each website is imported into bicycle rental system, counts each region respectively
The sum of dispatching requirement amount.
4. the public bicycles intelligent dispatching system region partitioning method according to claim 1 based on k-means algorithms,
It is characterized in that S3, one set of edge site placement by region of the dispatching requirement amount summation absolute value more than 20, introduce and adjust
This new parameter of degree demand is partitioned into new region, specifically to the website in this set again with k-means algorithms
For：
S301：Finding out needs to correct the region divided, that is, finds out dispatching requirement amount summation in S202 and be more than 20（Each car hauler institute
The maximum bicycle number that can be loaded）Region, if it is 0 or 1 to meet the areal of condition, complete region division, if
The areal for meeting condition is more than 1, then correcting region is needed to divide；
S302：Using the region of dispatching requirement amount maximum as starting correcting region, by the side of its edge site and adjacent area
Edge website is placed in a set, by calculating the distance of these edge sites and all areas central point and dispatching requirement amount
Correction value sum, these edge sites are reassigned in different regions；
S303：It calculates in the newly-generated initial correction region after the dispatching requirement amount of all websites, if demand is less than 20,
Success is then corrected, generates stable region；
S304：Step described in repeating S302, S303, adjusting remaining needs modified region, until the dispatching requirement of all areas
Until amount both less than 20；
S305：It is as more as possible if there is region that can not reach the condition that dispatching requirement amount is less than 20 by the adjustment of edge site
The dispatching requirement amount for meeting remaining website be intended to 0.
5. generate final area splitting scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611103426.5A CN108154250A (en) | 2016-12-02 | 2016-12-02 | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611103426.5A CN108154250A (en) | 2016-12-02 | 2016-12-02 | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108154250A true CN108154250A (en) | 2018-06-12 |
Family
ID=62469827
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611103426.5A Pending CN108154250A (en) | 2016-12-02 | 2016-12-02 | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108154250A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108776852A (en) * | 2018-06-22 | 2018-11-09 | 北京京东金融科技控股有限公司 | Without stake vehicle dispatching method and system |
| CN110086867A (en) * | 2019-04-25 | 2019-08-02 | 北京首汽智行科技有限公司 | One kind is returned the car site method for pushing |
| CN110689180A (en) * | 2019-09-18 | 2020-01-14 | 科大国创软件股份有限公司 | Intelligent route planning method and system based on geographic position |
| CN112836951A (en) * | 2021-01-26 | 2021-05-25 | 深圳市泰比特科技有限公司 | Intelligent shared bicycle cloud platform scheduling method and system based on big data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729724A (en) * | 2013-12-06 | 2014-04-16 | 浙江工业大学 | Natural-mixing scheduling method of public bike system |
| CN105205623A (en) * | 2015-10-29 | 2015-12-30 | 杭州电子科技大学 | Public bicycle station dispatch area division method based on interval weak coupling degree |
-
2016
- 2016-12-02 CN CN201611103426.5A patent/CN108154250A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729724A (en) * | 2013-12-06 | 2014-04-16 | 浙江工业大学 | Natural-mixing scheduling method of public bike system |
| CN105205623A (en) * | 2015-10-29 | 2015-12-30 | 杭州电子科技大学 | Public bicycle station dispatch area division method based on interval weak coupling degree |
Non-Patent Citations (2)
| Title |
|---|
| 史彩霞: ""公共自行车***运行数据时空分析及职能调度***的研究"", 《中国优秀硕士学位论文全文数据库 工程科技II辑》 * |
| 汪中 等: ""一种优化初始化中心点的K-means算法"", 《模式识别与人工智能》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108776852A (en) * | 2018-06-22 | 2018-11-09 | 北京京东金融科技控股有限公司 | Without stake vehicle dispatching method and system |
| CN110086867A (en) * | 2019-04-25 | 2019-08-02 | 北京首汽智行科技有限公司 | One kind is returned the car site method for pushing |
| CN110086867B (en) * | 2019-04-25 | 2022-04-01 | 北京首汽智行科技有限公司 | Vehicle returning network point pushing method |
| CN110689180A (en) * | 2019-09-18 | 2020-01-14 | 科大国创软件股份有限公司 | Intelligent route planning method and system based on geographic position |
| CN112836951A (en) * | 2021-01-26 | 2021-05-25 | 深圳市泰比特科技有限公司 | Intelligent shared bicycle cloud platform scheduling method and system based on big data |
| CN112836951B (en) * | 2021-01-26 | 2023-10-24 | 深圳市泰比特科技有限公司 | Intelligent scheduling method and system for shared bicycle cloud platform based on big data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108154250A (en) | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms | |
| CN105389975B (en) | Special train dispatching method and device | |
| US20120078672A1 (en) | Efficient Automated Ride Sharing System | |
| CN107330547A (en) | A kind of city bus dynamic dispatching optimization method and system | |
| CN101206801B (en) | Self-adaption traffic control method | |
| CN111428931B (en) | Logistics distribution line planning method, device, equipment and storage medium | |
| CN104620296A (en) | On-demand vehicle operation management device, on-demand vehicle operation management method, and on-demand vehicle operation management system | |
| CN102113001A (en) | Method and system for cab management | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| Wang et al. | Optimization of bus bridging service under unexpected metro disruptions with dynamic passenger flows | |
| CN110490380B (en) | Automatic dynamic minimum capacity instant dispatch method and device | |
| CN110276557A (en) | A kind of inter-network grid dispatching work order creation method | |
| Melis et al. | The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment | |
| CN107832957A (en) | A kind of public lease bicycle dispatching method based on the handling of polymorphic type bicycle | |
| CN112116203A (en) | Public bicycle system layout planning method based on dispatching vehicle | |
| CN110941691A (en) | Method and device for taking and matching in forward-draught manner | |
| CN106530679B (en) | Micro- public transport operation management system and method | |
| Naidu | Infrastructure development in Malaysia | |
| Gong et al. | Fusion framework of urban traffic control and route guidance based on cyber-physical system theory | |
| Wang et al. | PDPTW based taxi dispatch modeling for booking service | |
| Schlote et al. | On closed-loop bicycle availability prediction | |
| CN108830436A (en) | The shared bicycle dispatching method divided based on Fractal Tree self-balancing | |
| CN116957130A (en) | Short-time passenger flow prediction method | |
| CN113936494B (en) | Public transport scheduling method and device based on time-sharing riding demand | |
| CN106204404A (en) | The method of adjustment of a kind of public transport transport power and system |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180612 |
|
| WD01 | Invention patent application deemed withdrawn after publication |