CN107220733B - Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set - Google Patents
Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set Download PDFInfo
- Publication number
- CN107220733B CN107220733B CN201710452021.0A CN201710452021A CN107220733B CN 107220733 B CN107220733 B CN 107220733B CN 201710452021 A CN201710452021 A CN 201710452021A CN 107220733 B CN107220733 B CN 107220733B
- Authority
- CN
- China
- Prior art keywords
- travel
- time
- destination
- passengers
- customized
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000005457 optimization Methods 0.000 title claims abstract description 21
- 238000013439 planning Methods 0.000 claims abstract description 14
- 230000008569 process Effects 0.000 claims abstract description 14
- 238000012216 screening Methods 0.000 claims abstract description 13
- 230000005484 gravity Effects 0.000 claims description 19
- 230000006698 induction Effects 0.000 claims description 9
- 238000003780 insertion Methods 0.000 claims description 9
- 230000037431 insertion Effects 0.000 claims description 9
- 238000012966 insertion method Methods 0.000 claims description 7
- 150000001875 compounds Chemical class 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 6
- 238000011835 investigation Methods 0.000 claims description 6
- 238000012935 Averaging Methods 0.000 claims 1
- 238000012545 processing Methods 0.000 abstract description 2
- 239000000446 fuel Substances 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000004134 energy conservation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000029305 taxis Effects 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock 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/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
- 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
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the technical field of data processing, and discloses a customized bus starting optimization method based on an origin-destination point set cooperated with the Internet and a bus route, which comprises the steps of firstly carrying out condition screening on the departure time, the origin and the destination of a passenger, and determining that the origin-destination point set jointly formed by a plurality of different departure origins and the destination expands the coverage range of the customized bus and increases the number of potential customers; when the number of passengers meets the customized bus driving condition, optimal path planning in the starting point set and the destination point set is carried out, so that the driving cost is saved; because the long-distance driving process between the origin-destination point set does not stop, the driving path can be planned in real time, traffic jam is avoided, and the fast travel is realized. The existing customized bill has small starting and destination point coverage range, few passengers, difficulty in reaching the minimum number of passengers during line starting, and fixed driving line due to the arrangement of the passenger receiving points along the line. The invention increases the number of potential customers by enlarging the coverage range of the origin-destination point, improves the success rate of customizing the bus driving, increases the flexibility of the line in the driving process, effectively avoids the blockage and saves the traveling time.
Description
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to a customized bus driving optimization method based on an origin-destination point set cooperated with the internet and a bus route.
Background
In recent years, rapid development of electronic information and communication technologies provides technical support for establishing efficient intelligent transportation systems. The vehicle-road cooperative system is used as a subsystem of the intelligent transportation system, so that multiple traffic services and management purposes in the intelligent transportation system are realized.
At present, single origin-destination fixed public transport is already carried out in cities such as Beijing, Qingdao, Kunming and the like, and the operation mode is as follows: the method comprises the steps of filling information, travel requirements and other forms of passengers on line, designing an optimal route by a public transportation group, recruiting passengers on a customized public transportation platform, and starting a customized public transportation after the number of the passengers reaches the standard. Because the existing customized bus is in a running mode from a single starting point to a single destination point, the travel ranges covered by the starting point and the destination point are respectively 300 meters, the coverage range is small, the number of potential passengers is small, the number of passengers demanding the travel of the single customized bus is difficult to meet the condition of the minimum number of passengers who issue the customized bus, the running success rate of the customized bus is low, even if the running success rate is usually lower than the profit rate of the customized bus by 80 percent due to the small coverage range, and the profit of the customized bus is difficult to be operated due to the difficulty in offsetting the income of tickets. In addition, the driving routes of the existing customized buses are usually designed in advance by a bus group, and stop stations are arranged on the midway of part of the customized routes, so that the customized buses run according to fixed routes during driving, the optimal driving route cannot be selected according to the actual traffic condition of a road network, and the driving flexibility of the customized bus routes is poor. Such as: after the situation that the traffic jam exists on the front road section is predicted, due to the passenger receiving and sending points on the front road section and the limit specified by a company, a driver cannot flexibly select a better route, the driver can only wait for passing on the traffic jam road section, the travel time of the passengers is greatly consumed, and the punctuality, reliability and overall service quality of the customized bus are reduced.
According to the method, optimization is performed on the basis of the existing single-origin-destination customized bus, on the basis of establishing an internet customized bus platform, firstly, a mode that a starting point set and a destination set are jointly formed by a plurality of different travel adjacent starting points and adjacent destination points is adopted, the coverage area of the customized bus starting point and destination point is enlarged, and an operation method of potential passenger number is increased, so that the number of passengers at a plurality of travel starting-destination points is integrated, the number of travel passengers at the same customized bus route is increased, the number of passengers at a single customized bus travel can easily reach the minimum number of travel requirements of the customized bus, namely, the success rate of travel of the customized bus route and the seat occupancy of the customized bus are improved, and the income condition of a bus company for running the customized bus is improved; secondly, optimal passenger delivery path planning is carried out in the customized bus starting point set and the customized bus destination point set, so that fuel cost, labor cost, depreciation cost and the like caused by unnecessary detour in the customized bus receiving process are reduced, the running cost of a customized bus company is saved, and the income is increased; finally, as no stop point for receiving and sending passengers is set in the long-distance transportation process between the starting point set and the destination point set, the middle road section is flexible in driving route, the optimal driving route can be dynamically planned in real time according to the road network condition, and other routes are selected to drive in time after a traffic jam event occurs in the next road section, so that the situations that the vehicle waits to pass through to the traffic jam road section and unnecessary travel time is increased are effectively avoided, the travel time of the passengers is saved, and the punctuality, reliability and overall service quality of the customized bus are improved.
In summary, the problems of the prior art are as follows:
the coverage range of the customized bus origin-destination point is small, the number of potential passengers is small, the number of passengers requiring travel of a single customized bus is difficult to meet the condition of the minimum number of passengers who send the customized bus, the success rate of the customized bus is low, the seat occupancy rate is usually lower than the seat occupancy rate of the profit point of the customized bus by 80 percent due to the small coverage range after the successful operation, and the profit difficulty of the customized bus is caused by the difficulty in offsetting the ticket income. In addition, the driving routes of the existing customized buses are usually designed in advance by a bus group, and stop stations are arranged on the midway of part of the customized routes, so that the customized buses run according to fixed routes during driving, the optimal driving route cannot be selected according to the actual traffic condition of a road network, and the driving flexibility of the customized bus routes is poor. Such as: after the situation that the traffic jam exists on the front road section is predicted, due to the passenger receiving and sending points on the front road section and the limit specified by a company, a driver cannot flexibly select a better route, the driver can only wait for passing on the traffic jam road section, the travel time of the passengers is greatly consumed, and the punctuality, reliability and overall service quality of the customized bus are reduced.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a method for customizing bus driving based on a beginning-to-end point set cooperated with the Internet and the bus route.
The invention is realized in such a way that a customized bus driving method based on an origin-destination set cooperated with the internet and the vehicle and the road comprises the following steps:
firstly, establishing a starting-destination point set customized bus platform by using the Internet, and on the basis of establishing the Internet customized bus platform, adopting a mode of jointly forming a starting point set and a destination point set by a plurality of adjacent starting points and adjacent destination points of different trips to enlarge the coverage area of the starting point and the destination point of the customized bus, and increasing the operation method of potential passenger number, so that the number of passengers at the starting-destination points of a plurality of trips is integrated, the number of passengers at the trips of the same customized bus line is increased, the number of passengers at a single customized bus trip can easily reach the minimum number of passengers for the customized bus, namely the success rate of the customized bus line and the upper seat rate of the customized bus are improved, and the income of a bus company for running the customized bus is improved; secondly, optimal passenger delivery path planning is carried out in the customized bus starting point set and the customized bus destination point set, so that fuel cost, labor cost, depreciation cost and the like caused by unnecessary detour in the customized bus receiving process are reduced, the running cost of a customized bus company is saved, and the income is increased; finally, as no stop point for receiving and sending passengers is set in the long-distance transportation process between the starting point set and the destination point set, the middle road section is flexible in driving route, the optimal driving route can be dynamically planned in real time according to the road network condition, and other routes are selected to drive in time after a traffic jam event occurs in the next road section, so that the situations that the vehicle waits to pass through to the traffic jam road section and unnecessary travel time is increased are effectively avoided, the travel time of the passengers is saved, and the punctuality, reliability and overall service quality of the customized bus are improved.
The method specifically comprises the following steps:
firstly, establishing a start-destination set customized bus platform by using the Internet, and acquiring travel demands issued by users by using the platform: travel time, a travel starting point and a travel destination; the customized bus starting method based on the client group from the adjacent starting point set to the adjacent destination point set is adopted, the coverage range of the customized bus is enlarged, the number of potential clients is increased, the number of passengers is easier to reach the starting condition of the customized bus, and a gravity center method is utilized to integrate a plurality of starting times, starting points and traveling demands close to each other, which are issued by the passengers on the starting point-destination point set customized bus platform, into a customized bus route capable of meeting the demands of multiple passengers;
then, respectively carrying out optimal path planning for receiving and sending passengers in a starting point set and an destination set of the customized bus based on the cooperation of the Internet and the bus route;
and finally, in the long-distance non-stop driving process between the travel starting point set and the travel destination set, the dynamic path planning is carried out by utilizing the real-time traffic information of the road network and the vehicle-road cooperative system, and the driving route is flexibly selected.
Furthermore, the starting point and the destination point of the travel-destination set customized bus are different from the original starting point and destination point which are single, and are screened according to travel information issued by a traveler on a customized bus platform, so that the starting point and the destination point set formed by a plurality of different travel adjacent starting points and travel adjacent destination points are determined;
the construction method of the model comprises the following steps:
determining an origin-destination customer group:
in this model, a barycentric model is used. First, the average value of the values is taken (i.e., the centroid is obtained), and in consideration of the actual situation, the closest integer value may be used as the centroid. The maximum radius that can be varied can be obtained according to practical limitations. The potential customers are identified by progressively compressing starting from the largest radius to obtain the optimal radius.
The essence of determining the origin-destination cluster is screening of passengers. According to the running conditions of the customized bus, firstly, the first round of screening is carried out according to the application departure time of passengers. Firstly, the application departure time data of passengers in a certain time period is taken, the average value is taken, and the gravity center is obtained (if the precision is required, the value far away from the gravity center, namely a special point, can be deleted, and then the average value is calculated again, so that a new gravity center is obtained); according to the satisfaction degree of the waiting time of the passengers, the variable amplitude a of the departure time of the passengers can be determined by carrying out traffic investigation. This is in time amplitude, which can vary by a range of (0, a). And (3) gradually increasing the radius by a certain step length from 0 by taking the center of gravity as the center of a circle until the radius meeting the limitation of the number of the running customized buses is found. Let the radius be b. The value of b is used as the initial value in the time range (starting from the maximum radius a). After the time screening is carried out, the spatial position screening is carried out, and the spatial barycentric coordinate is obtained according to the longitude and latitude of the starting point of each passenger (because the area is small, the difference of the longitude and latitude of different points in the area is not large, a coordinate system can be automatically established, and the precision is improved). From the perspective of keeping the attraction of the customized bus, the time for the customized bus to receive passengers in the starting area has certain limitation, and can also be obtained through traffic investigation, and the time limitation necessarily corresponds to the maximum radius which can be reached by taking the center of gravity as the center of a circle. Firstly, judging whether the number of people in the maximum radius reaches the starting condition, if not, ending, and if so, entering the next link. The compressed set of passengers is screened at the destination using the same method, and there is also a maximum radius. If the running condition is not met, stopping, and if the running condition is met, determining. If the number of people exceeds the number of people permitted to carry the vehicle. This adjusts the time radius or the starting point space radius to bring the number of passengers within a predetermined range.
Further, after determining the origin-destination point set customer group, planning the optimal path to send the travel demand publisher,
the model construction method further comprises the following steps:
optimizing paths inside the origin and destination point set client group:
the method adopts a farthest insertion method in a heuristic algorithm to select the route for delivering passengers, combines the concepts of a nearest neighbor method and a saving method, and sequentially inserts a trip starting point or a trip destination point into a path to construct an optimal path. The method comprises the steps of firstly selecting a minimum distance point between a travel origin-destination point set client group as two initial points, respectively selecting a demand point which is farthest from the initial points from the travel origin point set client group and the travel destination point client group as a seed point of a line, then using the minimum insertion value as a next insertion point according to the concept of a nearest point insertion method, finally using a generalized saving value formula, using the maximum saving value to determine the insertion position, and repeating the steps of selecting and inserting until all travel demand points of the origin point set client group and the destination point set client group are completely covered, thereby respectively obtaining path optimization inside the origin point set client group and the destination point set client group.
Furthermore, the driving route is adjusted in real time according to the traffic information of the road network during driving, the situations that the vehicle is driven to a traffic jam road section to wait for passing and unnecessary travel time is increased are effectively avoided, and the travel time is saved, and the construction method of the model further comprises the following steps:
optimizing long-distance dynamic paths between the acknowledger set and the acknowledger set client group:
in the dynamic path induction process of the induction model, the optimal travel path among the client groups continuously changes;
the relationship between the optimal path and the time represents that:
(1) in the formula (I), the compound is shown in the specification,
the travel time of the optimal path between the OD at the time t and the rs is set; qtThe traffic flow sets of all road sections at the time t are obtained;
introducing a time variable to establish a dynamic path induction model as follows:
(2) in the formula (I), the compound is shown in the specification,
the travel time of the kth path between the time of t and rs is determined by:
and (6) calculating to obtain.
(3) In the formula, ca tThe travel time of the section a at the moment t;
represents a link-to-path variable, i.e., a 0-1 variable, if link a is on the kth path connecting OD to rs
Otherwise
KrsRepresents the set of all feasible paths between OD and rs and K ∈ Krs。
The invention also aims to provide a customized bus driving optimization system based on the cooperation of the internet and the vehicle paths, which utilizes the customized bus driving optimization method based on the cooperation of the internet and the vehicle paths.
The invention has the advantages and positive effects that:
the invention provides a customized public transport driving optimization organization based on an origin-destination set of 'internet +' and vehicle-road coordination, which can be realized by the following steps:
(1) the integration of different travel origin-destination points issued by a plurality of travelers is adopted, the defects of single origin-destination point travel, small coverage range and low success rate of travel of the original customized bus are overcome, the coverage ranges of the travel origin-destination points and the travel destination points of the customized bus are expanded, the number of clients with travel demands is increased, and the number of passengers can easily meet the minimum number of travel requirements of the customized bus. The calculation shows that if the customized bus runs at a running speed of 40km/h, the running time of 5 minutes is increased in the origin-destination set, and the coverage range of the customized bus origin-destination set can be expanded by 1.23 times, namely the success rate of the customized bus running is increased by 23% under the common condition in the city;
(2) during the long-distance driving process between the starting point set and the destination point set, the limitations of setting stop points for receiving and sending passengers midway of the conventional customized bus, designing driving routes in advance by companies and the like are not existed, the driving routes of the middle section of the starting-destination point set customized bus are flexible, the optimal driving path can be dynamically planned according to the real-time traffic information of the road network, other routes are selected for driving after a traffic jam event is predicted on the next road section, the condition that the road is driven to the traffic jam road section to wait for passing is effectively avoided, according to survey that the average speed per hour of a traffic jam road section is about 20km/h, the original customized bus can run for about 10km 30 minutes after running on the traffic jam road section according to a specified route, however, the customized public transport based on the Internet origin-destination set can keep the original vehicle speed of 40km/h for 20km in the same time, and the running distance is 2 times or more than that of the original customized public transport.
(3) Compared with taxis, a customized bus is an intensive vehicle. Taking the travel demand of 45 people as an example, if a taxi or a private car is adopted, at least 20 cars are required to occupy road resources, 20 engines emit tail gas, and 20 drivers provide services; only 1 bus and 1 driver are needed when the customized bus trip is selected; the method has the advantages that the emission of 1 bus is converted into 6 trolleys, the occupied road area is converted into 4 trolleys, and obviously, compared with the small taxi, the customized bus has obvious advantages in the aspects of energy conservation, emission reduction, cost saving and blockage control.
The customized bus development prospect is good, the high-quality and differentiated collective transportation travel service variety is provided by analyzing and optimizing the starting organization of the customized bus, the service quality and the travel efficiency are improved, more self-driving persons and people with public transportation travel demands are guided, the mode of collective transportation travel by using a large-capacity vehicle is used, the demanders can select the customized bus more forcefully, the potential demand can be stimulated to a certain extent, and the method has reference significance for relieving traffic jam problems.
According to the method for customizing the bus driving based on the origin-destination point set based on the cooperation of the internet and the bus route, the passengers of different starting points and destination points are collected to jointly form the driving origin-destination point set, the coverage range of the customized bus is expanded, the number of potential customers is increased, the number of people who go out is easier to reach the driving condition of the customized bus, and the driving success rate and the seat-taking rate of the customized bus are improved; the optimal path planning in the starting point set and the destination point set reduces fuel cost, labor cost and depreciation cost caused by unnecessary detour in the customized bus receiving process, and saves travel cost; the long-distance transportation process between the starting point set and the destination point set does not stop, an optimal driving path can be dynamically planned, the situation that the vehicle drives to a traffic jam road section to wait for passing is effectively avoided, and the traveling time of passengers is saved; the service quality of the customized bus is integrally improved.
Drawings
Fig. 1 is a flowchart of a method for optimizing customized bus driving based on internet and vehicle-road coordination.
Fig. 2 is a customized bus driving route planning diagram based on an "adjacent starting point set to adjacent destination point set" of a customer base provided by the embodiment of the invention.
Fig. 3 is a flowchart of an insertion method according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
At present, the coverage range of the customized bus starting-destination point is small, the number of potential passengers is small, the number of passengers demanding a single customized bus trip is difficult to meet the minimum departure passenger number condition of the customized bus, the success rate of the customized bus is low, even if the seat occupancy rate is usually lower than the seat occupancy rate of the customized bus by 80 percent due to the small coverage range after the bus trip is successful, and the cost of ticket income is difficult to offset, so that the profit of the customized bus is difficult to operate. In addition, the driving routes of the existing customized buses are usually designed in advance by a bus group, and stop stations are arranged on the midway of part of the customized routes, so that the customized buses run according to fixed routes during driving, the optimal driving route cannot be selected according to the actual traffic condition of a road network, and the driving flexibility of the customized bus routes is poor. Such as: after the situation that the traffic jam exists on the front road section is predicted, due to the passenger receiving and sending points on the front road section and the limit specified by a company, a driver cannot flexibly select a better route, the driver can only wait for passing on the traffic jam road section, the travel time of the passengers is greatly consumed, and the punctuality, reliability and overall service quality of the customized bus are reduced.
The application of the principles of the present invention will be further described with reference to the accompanying drawings and specific embodiments.
As shown in fig. 1, the customized bus driving optimization method based on the cooperation of the internet and the bus route provided by the embodiment of the invention;
firstly, an origin-destination set is established by using the 'Internet plus' to customize a bus platform, a customized bus running mode from an adjacent origin set to an adjacent destination set based on a client group is adopted, a plurality of lines with similar departure time, trip starting points and trip destination issued by passengers on the customized bus platform are integrated into one line when certain conditions are met, vehicle position information is added into running and an optimal driving line is dynamically planned by combining a road coordination system, a corresponding optimization model is constructed, the type of the customized bus is determined according to the requirements of different passengers and the number of passengers, better service quality is provided for the passengers, and the overall utilization efficiency of the customized bus is improved.
The customized bus driving route plan based on the 'adjacent starting point set to adjacent destination point set' of the customer group is shown in fig. 2, and the key points are three parts: one is the determination of origin-destination customer base A, B; secondly, planning an optimal path in the client group; and thirdly, dynamic path planning of long-distance running from the customer group to the customer group, namely dynamic driving planning among mn.
The invention is further described with reference to specific examples.
Fig. 2 is a customized bus driving route planning diagram based on an "adjacent starting point set to adjacent destination point set" of a customer base provided by the embodiment of the invention.
Fig. 3 is a flowchart of an insertion method according to an embodiment of the present invention.
In the customized bus driving optimization method based on the cooperation of the internet and the bus route provided by the embodiment of the invention,
1) constructing a model:
determining an origin-destination customer group:
in this model, a barycentric model is used. First, the average value of the values is taken (i.e., the centroid is obtained), and in consideration of the actual situation, the closest integer value may be used as the centroid. The maximum radius that can be varied can be obtained according to practical limitations. The potential customers are identified by progressively compressing starting from the largest radius to obtain the optimal radius.
The essence of determining the origin-destination cluster is screening of passengers. According to the running conditions of the customized bus, firstly, the first round of screening is carried out according to the application departure time of passengers. Firstly, the application departure time data of passengers in a certain time period is taken, the average value is taken, and the gravity center is obtained (if the precision is required, the value far away from the gravity center, namely a special point, can be deleted, and then the average value is calculated again, so that a new gravity center is obtained); according to the satisfaction degree of the waiting time of the passengers, the variable amplitude a of the departure time of the passengers can be determined by carrying out traffic investigation. This is in time amplitude, which can vary by a range of (0, a). And (3) gradually increasing the radius by a certain step length from 0 by taking the center of gravity as the center of a circle until the radius meeting the limitation of the number of the running customized buses is found. Let the radius be b. The value of b is used as the initial value in the time range (starting from the maximum radius a). After the time screening is carried out, the spatial position screening is carried out, and the spatial barycentric coordinate is obtained according to the longitude and latitude of the starting point of each passenger (because the area is small, the difference of the longitude and latitude of different points in the area is not large, a coordinate system can be automatically established, and the precision is improved). From the perspective of keeping the attraction of the customized bus, the time for the customized bus to receive passengers in the starting area has certain limitation, and can also be obtained through traffic investigation, and the time limitation necessarily corresponds to the maximum radius which can be reached by taking the center of gravity as the center of a circle. Firstly, judging whether the number of people in the maximum radius reaches the starting condition, if not, ending, and if so, entering the next link. The compressed set of passengers is screened at the destination using the same method, and there is also a maximum radius. If the running condition is not met, stopping, and if the running condition is met, determining. If the number of people exceeds the number of people permitted to carry the vehicle. This adjusts the time radius or the starting point space radius to bring the number of passengers within a predetermined range.
2) Path optimization within a customer base:
the method adopts a farthest insertion method in a heuristic algorithm to select the route for delivering passengers, combines the concepts of a nearest neighbor method and a saving method, and sequentially inserts a trip starting point or a trip destination point into a path to construct an optimal path. The method firstly selects the minimum distance point between the travel origin-destination point set client group as two initial points, respectively selects the demand point farthest from the initial point in the travel origin point set client group and the travel destination point client group as the seed point of the line, then uses the minimum insertion value as the next insertion point according to the concept of the nearest point insertion method, and finally uses the generalized saving value formula, and uses the maximum saving value to determine the insertion position, and repeats the steps of selecting and inserting until all travel demand points of the origin point set client group and the destination point set client group are completely covered, and respectively obtains the path optimization inside the origin point set client group and the destination point set client group, and the main flow is as shown in fig. 3:
Lj-mileage factor to pick up (send) customer point j; r-the number of clients (sending) forming the circulation loop; f-total number of receiving (sending) customer points; i. j-the serial number of the receiving (sending) client.
3) Dynamic path optimization among client groups:
in the dynamic path induction process of the induction model, the optimal travel path among the client groups continuously changes.
The relationship between the optimal path and the time represents that:
(1) in the formula (I), the compound is shown in the specification,
the travel time of the optimal path between the OD at the time t and the rs is set; qtThe traffic flow sets of all road sections at the time t are obtained;
introducing a time variable to establish a dynamic path induction model as follows:
(2) in the formula (I), the compound is shown in the specification,
the travel time of the kth path between the time of t and rs is determined by:
and (6) calculating to obtain.
(3) In the formula, ca tThe travel time of the section a at the moment t;
represents a link-to-path variable, i.e., a 0-1 variable, if link a is on the kth path connecting OD to rs
Otherwise
KrsRepresents the set of all feasible paths between OD and rs and K ∈ Krs。
4) Case analysis:
according to the background data display of the WeChat public number, the time interval of the application departure of a certain area does not exceed X1And 5 traffic travel cells with the travel distance between any two points not exceeding M are provided, and the total passenger flow of the 5 traffic travel cells is 60. The 6 lines of the customized bus applying for opening by taking the 5 travel districts as starting points have 4 destination points adjacent to each other, and assuming that the rated passenger capacity of the bus is 50, the basic travel data is shown in table 1:
table 1 basic trip data
| Customer | Passenger flow volume | Customer | Passenger flow volume |
| (1，2) | 8 | (3，2) | 8 |
| (1，4) | 11 | (4，4) | 7 |
| (2，1) | 9 | (5，3) | 5 |
According to the existing customized bus driving mode, max qi＝max{8,11,9,8,7,5}＝11<50% by 75%, the number of passengers on the line with the maximum passenger flow does not reach the minimum requirement of the customized bus running condition, and the customized bus running without the line is successful;
according to the customized public transportation optimization organization from the adjacent starting point set to the adjacent destination point set based on the customer group, the passenger flow
The starting condition of the customized bus is achieved, and the customized bus is successfully started. Compared with the original customized public transport, the method improves the driving rate and the full rate of the customized public transport, reduces the walking distance of passengers, improves the service quality of public transport, and is favorable for attracting car commuters to convert the public transportAnd the traffic jam problem is relieved to a certain extent.
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 invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (3)
1. A customized bus driving optimization method based on an origin-destination set cooperated with the Internet and the vehicle and the road is characterized by comprising the following steps:
firstly, establishing a start-destination set customized bus platform by using the Internet, and acquiring travel demands issued by passengers by using the platform: travel time, a travel starting point and a travel destination; the method comprises the steps that a customized bus starting mode from an adjacent starting point set to an adjacent destination point set based on a client group is adopted, the coverage range of the customized bus is enlarged, the number of potential passengers is increased, the number of passengers going out on the same line is increased, the number of passengers is enabled to reach the starting condition of the customized bus more easily, and a gravity center method is utilized to integrate a plurality of starting time, starting point and destination point close travel demands of the passengers on a customized bus platform of the starting point and destination point set into a customized bus line capable of meeting the demands of multiple passengers at the same time;
then, respectively carrying out optimal path planning for receiving and sending passengers in a starting point set and an destination set of the customized bus based on the cooperation of the Internet and the bus route;
finally, in the driving process of long-distance non-stop between the travel starting point set and the travel destination set, dynamic path planning is carried out by utilizing real-time traffic information of a road network and a vehicle-road cooperative system, and driving routes are flexibly selected;
in the flexibly selected driving route, a starting point and an end point of a travel-destination set customized bus are screened according to travel information issued by a traveler on a customized bus platform, and a starting-destination set consisting of a plurality of different travel adjacent starting points and travel adjacent end points is determined;
the construction method of the model comprises the following steps:
determining an origin-destination cluster client group:
firstly, taking the average value of all values, and taking the closest integer value as a gravity center value according to the actual situation; obtaining the changeable maximum radius of the customized bus according to the limitation of the running time of the customized bus; gradually compressing by taking the maximum radius as a starting point to obtain the optimal radius and determine potential customers;
according to the running conditions of the customized bus, firstly, a first round of screening is carried out according to the application departure time of passengers; firstly, obtaining the application departure time data of passengers in a certain time period, obtaining the average value of the application departure time data, obtaining the center of gravity, deleting special point values far away from the center of gravity, and obtaining a new center of gravity by re-averaging; according to the satisfaction degree of the waiting time of the passengers, carrying out traffic investigation to determine the variable amplitude a of the departure time of the passengers; then, in time amplitude, the variable range is (0, a); gradually increasing the radius by a certain step length from 0 by taking the center of gravity as the center of a circle until the radius meeting the limit of the number of the running customized buses is found, and recording the radius as b; taking the value b or the maximum radius value a as an initial value in a time range; after the time screening is carried out, the spatial position screening is carried out, and the spatial gravity center coordinate is worked out according to the longitude and latitude of the starting point of each passenger; in order to keep the attraction of the customized bus, a limit value exists in the time of the customized bus for receiving passengers in the starting point area, and the limit value is obtained through traffic investigation and corresponds to the maximum radius which can be reached by taking the center of gravity as the center of a circle;
firstly, judging whether the number of people in the maximum radius reaches the starting condition, if not, ending, and if so, entering the next link; screening the compressed passenger set at a terminal by using the same method, wherein the compressed passenger set also has a maximum radius; stopping if the running condition is not met, and determining if the running condition is met; if the number of people exceeds the number of people permitted to carry the vehicle; adjusting the time radius or the starting point space radius to enable the number of passengers to reach a specified range;
in the flexible selection of the driving routes, the driving routes are planned and adjusted in real time according to the road network traffic information during driving, traffic jam road sections are avoided, and the driving time is saved, wherein the model construction method further comprises the following steps:
optimizing long-distance dynamic paths between a starting point set client group and an ending point set client group:
in the dynamic path induction process of the induction model, the optimal travel path among the client groups continuously changes;
the relationship between the optimal path and the time represents that:
(1) in the formula (I), the compound is shown in the specification,
the travel time of the optimal path between the OD at the time t and the rs is set; qtThe traffic flow sets of all road sections at the time t are obtained;
introducing a time variable to establish a dynamic path induction model as follows:
(2) in the formula (I), the compound is shown in the specification,
the travel time of the kth path between the time of t and rs is determined by:
calculating to obtain;
(3) in the formula, ca tThe travel time of the section a at the moment t;
represents a link-to-path variable, i.e., a 0-1 variable, if link a is on the kth path connecting OD to rs
Otherwise
KrsRepresents the set of all feasible paths between OD and rs and K ∈ Krs。
2. The customized internet and vehicle-road coordination based origin-destination set bus driving optimization method as claimed in claim 1, wherein after determining the origin-destination set client group, an optimal path is planned to send the travel demand publisher, and the model construction method comprises:
the method comprises the steps of selecting a minimum distance point between a travel origin-destination point set client group as two initial points, selecting a demand point farthest from the initial point in the travel origin point set client group and the travel destination point client group as a seed point of a line, using the minimum insertion value as a next insertion point according to the concept of a nearest point insertion method, using a generalized saving value formula, determining the insertion position according to the maximum saving value, and repeating the steps of selecting and inserting until all travel demand points of the origin point set client group and the destination point set client group are completely covered, thereby obtaining path optimization inside the origin point set client group and the destination point set client group respectively.
3. A customized bus driving optimization system based on internet and vehicle-road coordination, which utilizes the method for customizing bus driving optimization based on internet and vehicle-road coordination origin-destination set claimed in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710452021.0A CN107220733B (en) | 2017-06-15 | 2017-06-15 | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710452021.0A CN107220733B (en) | 2017-06-15 | 2017-06-15 | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107220733A CN107220733A (en) | 2017-09-29 |
| CN107220733B true CN107220733B (en) | 2020-04-28 |
Family
ID=59949765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710452021.0A Expired - Fee Related CN107220733B (en) | 2017-06-15 | 2017-06-15 | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107220733B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108831149B (en) * | 2018-06-14 | 2020-12-22 | 重庆同枥信息技术有限公司 | Method and system for customizing bus route running based on historical OD information |
| CN108960539B (en) * | 2018-08-31 | 2020-10-16 | 东南大学 | Demand response type connection bus route optimization method |
| CN109800902B (en) * | 2018-12-11 | 2022-10-25 | 华南理工大学 | Unmanned bus optimization method for uninterrupted reciprocating flexible line length |
| CN112289065B (en) * | 2019-12-02 | 2021-07-16 | 南京行者易智能交通科技有限公司 | Customized bus route design method and system based on accurate OD big data |
| CN112085249B (en) * | 2020-07-27 | 2022-11-04 | 北京工业大学 | Customized bus route planning method based on reinforcement learning |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105023426A (en) * | 2015-05-18 | 2015-11-04 | 南京邮电大学 | Urban public transport route selection method |
| CN105654206A (en) * | 2016-01-06 | 2016-06-08 | 南通大学 | Bus stop site selection and layout optimization method based on passenger trip spatial distribution |
| WO2016100722A1 (en) * | 2014-12-18 | 2016-06-23 | Expedia, Inc. | Automatic conversion of formatted travel information |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
| CN106097226A (en) * | 2016-06-20 | 2016-11-09 | 华南理工大学 | City Routine Transit Network Design method based on Hierarchical Programming |
| CN106846789A (en) * | 2017-03-23 | 2017-06-13 | 北京公共交通控股（集团）有限公司 | One kind customization public transit system and customization public bus network formulating method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170124671A1 (en) * | 2015-11-03 | 2017-05-04 | Transportation Technology Partners L.L.C. | Systems and methods for transit-related transactions |
| US9990845B2 (en) * | 2015-11-20 | 2018-06-05 | Leidos, Inc. | Communications platform for facilitating efficient container transport |
-
2017
- 2017-06-15 CN CN201710452021.0A patent/CN107220733B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016100722A1 (en) * | 2014-12-18 | 2016-06-23 | Expedia, Inc. | Automatic conversion of formatted travel information |
| CN105023426A (en) * | 2015-05-18 | 2015-11-04 | 南京邮电大学 | Urban public transport route selection method |
| CN105654206A (en) * | 2016-01-06 | 2016-06-08 | 南通大学 | Bus stop site selection and layout optimization method based on passenger trip spatial distribution |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
| CN106097226A (en) * | 2016-06-20 | 2016-11-09 | 华南理工大学 | City Routine Transit Network Design method based on Hierarchical Programming |
| CN106846789A (en) * | 2017-03-23 | 2017-06-13 | 北京公共交通控股（集团）有限公司 | One kind customization public transit system and customization public bus network formulating method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107220733A (en) | 2017-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107220733B (en) | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set | |
| CN105070044B (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN108765948B (en) | Elastic bus scheduling method and system | |
| CN110704993B (en) | Customized bus route design method for relieving subway passenger flow pressure | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| CN107194128B (en) | Multi-mode public transport network design method based on central radiation type network framework | |
| CN107564269B (en) | A kind of half flexible bus dispatching method based on willingness to pay | |
| CN103971507A (en) | Taxi calling method, platform and system | |
| CN105844432A (en) | VANET based electric automobile charge scheduling system and method | |
| CN103985247A (en) | Taxi transport capacity scheduling system based on city taxi calling demand distribution density | |
| CN109308574A (en) | A kind of flexible bus dispatching method in internet of real-time response half | |
| CN109410562B (en) | Optimized dispatching method for community buses | |
| CN110148297B (en) | Parking transfer system using regular bus connection and optimization method | |
| Shu et al. | Data-driven shuttle service design for sustainable last mile transportation | |
| CN114743401A (en) | Data visualization bus dispatching management platform based on bus digital transformation | |
| CN114358386A (en) | Double-trip-mode ride-sharing site generation method based on reserved trip demand | |
| CN105528890B (en) | A kind of taxi sharing method suitable at Large-sized Communication hinge | |
| CN108197078B (en) | Method for calculating bus section passenger flow based on bus IC card data | |
| CN113096429A (en) | Elastic bus area flexibility line generation method based on bus dispatching station distribution | |
| CN113379131B (en) | Method for optimizing connection bus network and synchronously optimizing fleet size and number of charging piles in pure electric bus application | |
| CN111105078A (en) | Customized public transport network optimization method | |
| CN115936330A (en) | Demand response type BRT vehicle scheduling algorithm based on Lagrangian principle | |
| Zhu et al. | A public vehicle system with multiple origin-destination pairs on traffic networks | |
| WO2013044319A1 (en) | Method and system for coordinating usage of vehicles in a transport network | |
| Zhu et al. | Traffic efficiency improvement and passengers comfort in ridesharing systems in VANETs |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 402247 No. 1 Fuxing Avenue, Shuangfuxin District, Jiangjin District, Chongqing Applicant after: CHONGQING JIAOTONG University Address before: 400074 No. 66, Xuefu Avenue, Nan'an District, Chongqing Applicant before: CHONGQING JIAOTONG University |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200428 |