CN110793535A - Commuting line planning method and device - Google Patents
Commuting line planning method and device Download PDFInfo
- Publication number
- CN110793535A CN110793535A CN201910782210.3A CN201910782210A CN110793535A CN 110793535 A CN110793535 A CN 110793535A CN 201910782210 A CN201910782210 A CN 201910782210A CN 110793535 A CN110793535 A CN 110793535A
- Authority
- CN
- China
- Prior art keywords
- commuting
- target
- stop
- merging
- initial
- 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
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3438—Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route
Abstract
The embodiment of the invention provides a commuting route planning method and a device, wherein the method comprises the following steps: the method comprises the steps of obtaining job parking sites and a candidate parking site set, utilizing the job parking sites to determine a target parking site set from the candidate parking site set, obtaining the commuting time between parking sites included in the target parking site set, and merging initial commuting lines corresponding to the parking sites included in the target parking site set according to the commuting time to obtain the target commuting lines. The embodiment of the invention can plan a proper commuting line quickly and efficiently, greatly reduce the cost of the commuting line planning and effectively shorten the commuting time of staff.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a commuting line planning method and device.
Background
Along with the continuous expansion of cities, the house price in the center of a city rises dramatically, and the traffic is congested increasingly, so that the commuting zone is also enlarged continuously while people select the living environment to change, and the situations that light rails cannot be extruded, buses are blocked and the like are often encountered during the early peak period of work. At present in order to reduce commuting time, improve work efficiency, often provide the regular bus service, but current commuting circuit is mostly according to local traffic conditions, staff's demand and artificial experience and makes, and the later stage constantly modifies the commuting circuit through staff's feedback, and such route planning mode cycle is long, and the human cost of cost is high, can't effectively shorten staff's commuting time.
Disclosure of Invention
The embodiment of the invention provides a commuting line planning method and device, which can quickly and efficiently plan a proper commuting line, greatly reduce the cost of the commuting line planning and effectively shorten the commuting time of staff.
A first aspect of an embodiment of the present invention provides a commuting route planning method, including:
acquiring a job site and a candidate docking site set;
determining a target stop station set from the candidate stop station sets by using the job stop places, wherein the number of passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number;
acquiring commuting time among the stop stations included in the target stop station set;
and combining the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain a target commuting line.
A second aspect of an embodiment of the present invention provides a commuting route planning apparatus, including:
the acquisition module is used for acquiring the job station and the candidate stop station set;
the determining module is used for determining a target stop station set from the candidate stop station sets by using the job stop places, wherein the number of the passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number;
the acquisition module is further configured to acquire commute time among the docking stations included in the target docking station set;
and the processing module is used for merging the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain the target commuting lines.
A third aspect of an embodiment of the present invention provides a server, including a processor, a network interface, and a storage device, where the processor, the network interface, and the storage device are connected to each other, where the network interface is controlled by the processor to transmit and receive data, and the storage device is used to store a computer program, where the computer program includes program instructions, and the processor is configured to call the program instructions to execute the commuting route planning method.
A fourth aspect of the embodiments of the present invention provides a computer storage medium, in which program instructions are stored, and when the program instructions are executed, the computer storage medium is configured to implement the commuting route planning method.
In the embodiment of the invention, the job parking place and the candidate docking station set can be obtained, the target docking station set is determined from the candidate docking station set by using the job parking place, the number of boarding persons corresponding to each docking station included in the target docking station set reaches the preset number, then the commuting time among the docking stations included in the target docking station set is obtained, and the initial commuting lines corresponding to each docking station included in the target docking station set are combined according to the commuting time to obtain the target commuting line.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a commuting route planning method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of another commuting route planning method according to an embodiment of the present invention;
FIG. 3 is a schematic illustration of a consolidated commute line provided by an embodiment of the present invention;
FIG. 4 is a schematic view of a planned commute route, according to an embodiment of the present invention;
FIG. 5 is a schematic view of another planned commute route visualization provided by an embodiment of the present invention;
fig. 6 is a schematic diagram of a commute route planning process according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a commuting route planning apparatus according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a server according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The commuting route planning method provided by the embodiment of the invention can be used for commuting route planning when the staff go back and forth between the residential site and the working site, can quickly and efficiently plan a proper commuting route, greatly reduces the cost of the commuting route planning, and can effectively shorten the commuting time of the staff.
Referring to fig. 1, fig. 1 is a schematic flow chart illustrating a commuting route planning method according to an embodiment of the present invention. The commuting route planning method described in this embodiment includes the following steps:
101. the server obtains a job site and a set of candidate docking sites.
Specifically, the "job" in the job parking place refers to the employee work place, the "parking" refers to the employee living place, and the set of candidate parking sites may be regular bus sites included in the existing bus station and the existing commuting line, and the like. The job and park sites of the employee can be counted through questionnaire or other methods, and job and park data in a non-target range is filtered, wherein the non-target range is inconsistent with a planned destination (such as a company address), for example, a residence site in the job and park site is in an M city, and a planned destination is an N city, so that the job and park site can be determined not to be in the target range, and the job and park site and the candidate park site set are counted and then submitted to a server, so that the server obtains the job and park site and the candidate park site set, or the server can read the stored job and park site and candidate park site set from a database of an enterprise.
102. And the server determines a target stop station set from the candidate stop station sets by using the job stop sites, wherein the number of the passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number.
Specifically, the server may screen the stop sites in the candidate stop site set by using the acquired job stop points to obtain stop sites with a preset number of people (e.g., 3 people), and use the stop sites with the preset number of people as the target stop site set.
In some possible embodiments, the specific implementation manner of the server using the job site to screen the docking sites in the candidate docking site set may be: the server adsorbs the job stops to stop sites with a distance smaller than or equal to a first preset distance (for example, 500m) in the candidate stop site set, obtains a first stop site set adsorbed to the job stops, determines the number of passengers getting on the bus corresponding to each stop site in the first stop site set, obtains a second stop site set, of which the number of passengers getting on the bus reaches the preset number, in the first stop site set, and determines the second stop site set as a target stop site set.
In some possible embodiments, for a stop with a number of people getting on the bus less than the preset number of people in the first set of stops, the server may obtain a third set of stops with a number of people getting on the bus less than the preset number of people in the first set of stops, aggregate the stops in the third set of stops to stops with a distance less than or equal to a second preset distance (e.g., 1km) in the second set of stops, merge the stops that are not aggregated in the third set of stops and have a distance less than or equal to a third preset distance (e.g., 1km) to obtain a fourth set of stops with a number of people getting on the bus less than the preset number of people after merging, add stops included in the fourth set of stops to the target set of stops, so as to filter stop plans for commuting lines with a large number of people getting on the bus and a moderate distance to corresponding employee's residence, the method and the device can ensure that a proper commuting line is planned quickly and efficiently, and the commuting time of the staff is effectively shortened.
For example, all the acquired business stops are adsorbed to stop stations within a distance of 500 meters, stop stations with the number of people getting on the bus of 3 stop stations are screened out to serve as a target stop station set, the rest stop stations are aggregated to stop stations in the target stop station set within a distance of 1km, and the rest stop stations which are not aggregated within a distance of 1km and meet the requirement that the number of people getting on the bus reaches 3 are merged and added into the target stop station set.
103. And the server acquires the commuting time among the docking stations included in the target docking station set.
Specifically, the server may calculate an Arrival time Estimate (ETA) between two stops in the target stop set according to the road condition at a specified time (e.g., 7: 30 or 8:00 a.m.) by using an offline navigation tool, which may include road network data, map applications, etc., and may use the Arrival time estimate as the commute time between the stops.
Note that the docking station includes a destination such as a place where a company is located.
104. And the server merges the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain the target commuting line.
The initial commuting line corresponding to each docking station refers to a commuting line from the docking station to a destination.
Specifically, the server merges the initial commuting lines corresponding to each target stop point according to the commuting time on the initial commuting line corresponding to each stop point, and the merging of the initial commuting lines corresponding to each target stop point is actually merging the commuting lines of the direct companies of each stop point.
In some possible embodiments, the lower limit of the total number of passengers getting on the single line in the target commuting line is not lower than a first value (for example, 20) and the upper limit is not higher than a second value (for example, 35), the total commuting time does not exceed a certain time (for example, 1 hour), the distance between the stop stations in the single line is not less than a certain distance (for example, 1000 meters), and corresponding constraints can be made on the target commuting line according to actual planning requirements.
In the embodiment of the invention, the server can acquire the job parking sites and the candidate docking site set, the target docking site set is determined from the candidate docking site set by using the job parking sites, the number of boarding persons corresponding to each docking site included in the target docking site set reaches the preset number, then the commuting time among the docking sites included in the target docking site set is acquired, and the initial commuting lines corresponding to each docking site included in the target docking site set are combined according to the commuting time to obtain the target commuting line, so that the appropriate commuting line can be planned quickly and efficiently, the cost of commuting line planning is greatly reduced, the commuting time of staff can be effectively shortened, and the commuting satisfaction degree of the staff is improved.
Referring to fig. 2, fig. 2 is a schematic flow chart illustrating another commuting route planning method according to an embodiment of the present invention. The commuting route planning method described in this embodiment includes the following steps:
201. the server obtains a job site and a set of candidate docking sites.
202. And the server determines a target stop station set from the candidate stop station sets by using the job stop sites, wherein the number of the passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number.
203. And the server acquires the commuting time among the docking stations included in the target docking station set.
The specific implementation manner of steps 201 to 203 may refer to the related description in steps 101 to 103 in the commuting route planning method, and is not described herein again.
204. And the server calculates the combination cost between the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time.
The initial commuting line corresponding to each docking station refers to a commuting line from the docking station to a destination.
Specifically, before calculating the combined cost, the server can calculate the commuting cost of the initial commuting line corresponding to each parking station, acquire the corresponding number of people getting on the bus for each parking station, calculate the commuting cost of the initial commuting line corresponding to each parking station according to the number of people getting on the bus corresponding to each parking station and the commuting time of the corresponding initial commuting line, acquire the combined commuting cost of the initial commuting lines corresponding to any two parking stations for any two parking stations in the target parking station set, and then calculate the combined cost between the initial commuting lines corresponding to any two parking stations according to the combined commuting cost and the commuting cost of the initial commuting lines corresponding to any two parking stations.
205. And the server merges the initial commuting lines with the minimum merging cost to obtain target commuting lines.
Specifically, the server makes a difference according to the commuting cost of the initial commuting line corresponding to each parking station and the combined commuting cost of the initial commuting lines corresponding to any two parking stations, finds the initial commuting line with the combined cost being small, and combines the initial commuting lines, so that the target commuting line is obtained.
In some possible embodiments, the server may set a merging condition, where the merging condition may include that a total number of people getting on the bus is not greater than a maximum bearable number of people or a total commute time is not greater than a preset time, where the maximum bearable number of people is used to ensure driving safety, the preset time is used to ensure that the total commute time of the commute route is not too long, and before merging the initial commute route with the minimum merging cost, the server may first obtain a commute parameter corresponding to the merged initial commute route with the minimum merging cost, where the commute parameter includes the total number of people getting on the bus or the total commute time, and determine whether the commute parameter satisfies the preset merging condition.
If the commuting parameters meet the preset merging conditions, the server can merge the initial commuting lines with the minimum merging cost to obtain target commuting lines, and scientific and reasonable mergence of the commuting lines can be guaranteed by setting the merging conditions.
And if the commuting parameters do not meet the preset combination conditions, acquiring the initial commuting lines with small combination cost, and combining the initial commuting lines with small combination cost to obtain the target commuting lines.
In some feasible embodiments, the specific implementation manner of the server merging the initial commute line with the minimum merging cost to obtain the target commute line may be:
merging the initial commuting lines with the minimum merging cost to obtain merged commuting lines, calculating the commuting cost of the merged commuting lines according to the number of passengers getting on the bus and the commuting time corresponding to the merged commuting lines, calculating the merging cost between the merged commuting lines and the initial commuting lines which are not merged according to the commuting cost of the merged commuting lines and the commuting cost of the initial commuting lines which are not merged, merging the initial commuting lines which are not merged and correspond to the minimum merging cost with the merged commuting lines until the commuting parameters corresponding to the non-merged commuting lines meet the preset merging conditions or the number of the commuting lines does not exceed a preset numerical value, and obtaining the target commuting lines.
For example, assuming that the target stop station set includes 6 stop stations, denoted by A, B, C, D, E, O, where stop station O is a destination station (e.g. company address), 6 stop stations correspond to 5 initial commute lines, denoted by a, b, c, d, e, then the combined cost of any two lines is obtained, if the combined cost of a and b is minimum, a and b are combined to obtain a combined commute line ab, then the combined cost between the combined commute line ab and each of the remaining uncombined initial commute lines c, d, e is calculated, if the combined cost of the combined commute line ab and the uncombined initial commute line c is minimum, the lines ab, c are combined, and at this time, the number of people or the total commute time on the combined commute line abc is already long, then it is no longer involved in line merging. And merging the remaining un-merged initial commuting lines d and e to obtain a merged commuting line de, and merging the merged commuting lines abc and de to finally obtain the commuting line with the minimum merging cost.
Taking the example of calculating the merging cost of one commuting line, assuming T () is the arrival time Estimate (ETA), P () is the number of passengers getting on the bus, C () is the cost, taking the initial commuting lines a, b as examples, C (a) ═ T (AO), P (A)
C(b)＝T(BO)·P(B)
Merge commute circuit ab, the stop is A, B, calculates and merges commute circuit ab cost of commuting:
c (ab) ═ Min ((T (AO · p (a)) + T (bo) · p (b))), wherein,
if the docking stations are ordered as a-B-O, t (a) ═ t (ab) + t (bo), t (B) ═ t (bo);
if docking stations are ordered as B-a-O, t (B) ═ t (ba) + t (ao), t (a) ═ t (ao);
the commuting cost of the combined commuting route ab is the minimum commuting cost after the A and B sites are sequenced
The consolidation cost of consolidating the commute lines is therefore:
ΔC＝Min(T(AO)·P(A)+T(BO)·P(B))-C(a)-C(b)
similarly, for the example of merging the last two lines abc (with station ordering ABCO) with line de (deo), the merging cost is calculated as follows:
C(abc)＝T(AO)·P(A)+T(BO)·P(B)+T(CO)·P(C)
C(de)＝T(DO)·P(D)+T(EO)·P(E)
C(abcde)＝Min(T(AO)·P(A)+T(BO)·P(B)+T(CO)·P(C)+T(DO)·P(D)+T(EO)·P(E))
ΔC＝C(abcde)-C(abc)-C(de)
wherein, C (abcde) obtains the minimum commuting cost after the sorting of the sites as the commuting cost. The two post-merger station arrangements shown in fig. 3 are obtained by considering various combinations.
Further, suppose that line 1 has M stations and line 2 has N stations, and the two lines are combined with
In this arrangement, the relative positions between A, B, C and D, E should remain unchanged after merging, so that the entire combination becomes
This reduces the complexity of the overall cost of the computation.
In some possible embodiments, the server may further send the planning result to the client, and the client may output the feature information of the target commuting line through the display device, where the feature information includes one or more of a stop point identifier, the number of people getting on the bus corresponding to the stop point, a stop point type, the number of people getting on the bus currently and the total commuting time, so that the client may visually see the planning effect and may compare the planning effect with data in the later actual operation, and a specific display effect may be as shown in fig. 4, where fig. 4 shows the feature information of one of the commuting lines, and the client may display one or several commuting lines through "display" and "hide" buttons.
In addition, in order to verify the functional characteristics of the embodiment of the present invention, the embodiment of the present invention is tested on a real data set of a certain company, and the visualization and analysis discussion of the test results is shown as follows: two thousand effective residence places of employees are collected through multiple ways, the residence places are aggregated and adsorbed to 632 stations, the station merging pretreatment is carried out, 146 stations are reserved (at least 3 people get on the bus at each station or the card swiping record is carried out at the station of the original bus), according to the requirement that each route does not exceed 10 stations, the distance between the stations is not less than 2 kilometers, the running time of each route does not exceed 2 hours, the upper limit of the single route is 70 people, the lower limit is not less than 50 people, 33 effective routes are planned finally, the travel requirement of more than 90 percent is covered, and the route overview is shown in figure 5. It can be seen that the automatically planned route covers all areas of the city where the company is located, and is determined by the administrative department to be consistent as: the planning effect is far better than the planning result given by the consulting company, and the consulting company quotes 15 ten thousand +; the adjustment thought and method are provided for helping the administration, and the adjustment manpower is directly saved for 2 weeks +; a set of line planning of regular buses of enterprises is settled: the methodology, the algorithm logic and the line adjustment tool can convert valuable output services in other subsequent external projects.
In some possible implementations, an embodiment of the present invention further provides a commuting route planning process, as shown in fig. 6, which specifically includes:
collecting employee residence data (corresponding to the positions of the employees described above) and existing site coordinate data, adsorbing the residence to the stop sites in the candidate parking site set (corresponding to the candidate stop site set described above), screening the sites in the candidate parking site set to obtain target stop sites, taking each target stop site to the company as an initial commuting line, calculating and sorting the sites on the merged line by using the time estimation between the sites (corresponding to the ETA described above), updating the merged cost, judging whether the merged commuting line meets the line operation (corresponding to the merge condition described above), outputting the line if the operation condition is met, and visually outputting and evaluating the commuting line.
Referring to fig. 7, fig. 7 is a schematic structural diagram of a commuting route planning apparatus according to an embodiment of the present invention. The commuting route planning apparatus described in this embodiment includes:
an obtaining module 701, configured to obtain a job site and a candidate docking site set;
a determining module 702, configured to determine a target stop site set from the candidate stop site sets by using the job stop sites, where the number of people getting on the train corresponding to each stop site in the target stop site set reaches a preset number of people;
the obtaining module 701 is further configured to obtain commute time between stop stations included in the target stop station set;
and the processing module 703 is configured to merge the initial commuting lines corresponding to each stop station included in the target stop station set according to the commute time, so as to obtain a target commuting line.
Optionally, the determining module 702 is specifically configured to:
adsorbing the job site to a docking station with a distance smaller than or equal to a first preset distance in the candidate docking station set;
acquiring a first stop site set adsorbed to a job stop place, and determining the number of boarding people corresponding to each stop site in the first stop site set;
and acquiring a second stop station set, wherein the number of the passengers getting on the train reaches the preset number, in the first stop station set, and determining the second stop station set as a target stop station set.
Optionally, the apparatus further comprises: an integration module 704, wherein:
the obtaining module 701 is further configured to obtain a third stop station set, where the number of passengers getting on the train does not reach the preset number, in the first stop station set;
the integrating module 704 is configured to aggregate docking stations in the third docking station set to docking stations in the second docking station set, where a distance between the docking stations in the third docking station set and the docking stations in the second docking station set is smaller than or equal to a second preset distance;
the integration module 704 is further configured to merge the stop stations that are not aggregated in the third stop station set and have a distance less than or equal to a third preset distance, so as to obtain a fourth stop station set where the number of passengers getting on the train reaches the preset number after merging;
the integrating module 704 is further configured to add the docking stations included in the fourth docking station set to the target docking station set.
Optionally, the processing module 703 is specifically configured to:
calculating the combination cost between the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time;
and merging the initial commuting lines with the minimum merging cost to obtain target commuting lines.
Optionally, the processing module 703 is specifically configured to:
aiming at each stop station included in the target stop station set, acquiring the number of passengers getting on the bus corresponding to each stop station;
calculating the commuting cost of the initial commuting line corresponding to each parking station according to the number of passengers getting on the bus corresponding to each parking station and the commuting time of the corresponding initial commuting line;
for any two stop stations in the target stop station set, acquiring the commuting cost after the initial commuting lines corresponding to the any two stop stations are combined;
and calculating the combined cost between the initial commuting lines corresponding to any two stop stations according to the combined commuting cost and the commuting cost of the initial commuting lines corresponding to any two stop stations.
Optionally, the obtaining module 701 is further configured to obtain the commute parameter corresponding to the combined minimum initial commute line, where the commute parameter includes the total number of people getting on the bus or the total commute time, and the commute parameter satisfies the condition of the preset combination condition, triggers the processing module 703 is right the combined minimum initial commute line is combined to obtain the target commute line, the preset combination condition includes that the total number of people getting on the bus is not more than the maximum bearable number of people or the total commute time is not more than the preset duration.
Optionally, the obtaining module 701 is further configured to obtain the initial commuting line with the small merging cost number under the condition that the commuting parameter does not satisfy the preset merging condition, and trigger the processing module 703 to merge the initial commuting line with the small merging cost number, so as to obtain the target commuting line.
Optionally, the processing module 703 is specifically configured to:
merging the initial commuting lines with the minimum merging cost to obtain merged commuting lines;
calculating the commuting cost of the combined commuting line according to the number of passengers getting on the bus and the commuting time corresponding to the combined commuting line;
calculating a combined cost between the combined commuting line and the uncombined initial commuting line according to the commuting cost of the combined commuting line and the commuting cost of the uncombined initial commuting line;
and merging the initial commuting lines which are not merged and have the minimum corresponding merging cost with the merged commuting lines until the commuting parameters corresponding to the non-merged commuting lines meet the preset merging conditions or the number of the commuting lines does not exceed a preset numerical value so as to obtain the target commuting lines.
It can be understood that each functional module of the commuting route planning apparatus in this embodiment may be specifically implemented according to the method in the foregoing method embodiment, and a specific implementation process thereof may refer to relevant descriptions of the foregoing method embodiment, which is not described herein again.
In this embodiment, the obtaining module 701 obtains job parking sites and a candidate parking site set, the determining module 702 determines a target parking site set from the candidate parking site set by using the job parking sites, the number of boarding persons corresponding to each parking site included in the target parking site set reaches a preset number, the obtaining module 701 obtains commuting time between the parking sites included in the target parking site set, and the processing module 703 merges initial commuting lines corresponding to each parking site included in the target parking site set according to the commuting time to obtain a target commuting line, so that a suitable commuting line can be planned quickly and efficiently, cost of commuting line planning is greatly reduced, commuting time of employees can be effectively shortened, and commuting satisfaction of the employees is improved.
Referring to fig. 8, fig. 8 is a schematic diagram of a server structure according to an embodiment of the present invention. The server described in this embodiment includes: a processor 801, a network interface 802, and a memory 803. The processor 801, the network interface 802 and the memory 803 may be connected by a bus or other means, and the bus connection is taken as an example in the embodiment of the present invention.
The processor 801 (or Central Processing Unit, CPU) is a computing core and a control core of the server. The network interface 802 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI, mobile communications interface, etc.), controlled by the processor 801 for transceiving data. The Memory 803(Memory) is a Memory device of the server for storing programs and data. It is understood that the memory 803 may be a high-speed RAM memory, or a non-volatile memory (non-volatile memory), such as at least one disk memory; optionally, at least one memory device located remotely from the processor 801. The memory 803 provides storage space that stores the operating system and executable program code of the server, which may include, but is not limited to: windows system (an operating system), Linux system (an operating system), etc., which are not limited in this regard.
In an embodiment of the present invention, the processor 801 executes the executable program code in the memory 803 to perform the following operations:
acquiring a job site and a candidate docking site set;
determining a target stop station set from the candidate stop station sets by using the job stop places, wherein the number of passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number;
acquiring commuting time among the stop stations included in the target stop station set;
and combining the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain a target commuting line.
Optionally, the processor 801 determines a target stop site set from the candidate stop site sets by using the job stop sites, where a specific manner that the number of people getting on the train corresponding to each stop site in the target stop site set reaches a preset number is as follows:
adsorbing the job site to a docking station with a distance smaller than or equal to a first preset distance in the candidate docking station set;
acquiring a first stop site set adsorbed to a job stop place, and determining the number of boarding people corresponding to each stop site in the first stop site set;
and acquiring a second stop station set, wherein the number of the passengers getting on the train reaches the preset number, in the first stop station set, and determining the second stop station set as a target stop station set.
Optionally, the processor 801 is further configured to:
acquiring a third stop station set, wherein the number of the passengers getting on the train does not reach the preset number in the first stop station set;
aggregating docking stations in the third docking station set to docking stations in the second docking station set, the distances of which are less than or equal to a second preset distance;
merging the stop stations which are not aggregated in the third stop station set and have the distance less than or equal to a third preset distance to obtain a fourth stop station set, wherein the number of the passengers getting on the train reaches the preset number after merging;
adding docking stations included in the fourth set of docking stations to the target set of docking stations.
Optionally, the processor 801 merges the initial commuting lines corresponding to each stop station included in the target stop station set according to the commuting time, and a specific manner of obtaining the target commuting line is as follows:
calculating the combination cost between the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time;
and merging the initial commuting lines with the minimum merging cost to obtain target commuting lines.
Optionally, the specific way for the processor 801 to calculate, according to the commute time, the combined cost between the initial commute lines corresponding to each stop point included in the target stop point set is as follows:
aiming at each stop station included in the target stop station set, acquiring the number of passengers getting on the bus corresponding to each stop station;
calculating the commuting cost of the initial commuting line corresponding to each parking station according to the number of passengers getting on the bus corresponding to each parking station and the commuting time of the corresponding initial commuting line;
for any two stop stations in the target stop station set, acquiring the commuting cost after the initial commuting lines corresponding to the any two stop stations are combined;
and calculating the combined cost between the initial commuting lines corresponding to any two stop stations according to the combined commuting cost and the commuting cost of the initial commuting lines corresponding to any two stop stations.
Optionally, before the merging the initial commute line with the smallest merging cost to obtain the target commute line, the processor 801 is further configured to:
acquiring a commute parameter corresponding to the initial commute route with the minimum merging cost after merging, wherein the commute parameter comprises the total number of people getting on the bus or the total commute time;
if the commute parameters meet preset merging conditions, executing the step of merging the initial commute routes with the minimum merging cost to obtain target commute routes, wherein the preset merging conditions comprise that the total number of people getting on the bus is not more than the maximum number of people capable of bearing the bus or the total commute time is not more than preset duration.
If the commuting parameters do not meet the preset merging conditions, acquiring an initial commuting line with low merging cost;
and merging the initial commuting lines with the small merging cost to obtain a target commuting line.
Optionally, the processor 801 merges the initial commute line with the minimum merging cost to obtain a specific manner of the target commute line:
merging the initial commuting lines with the minimum merging cost to obtain merged commuting lines;
calculating the commuting cost of the combined commuting line according to the number of passengers getting on the bus and the commuting time corresponding to the combined commuting line;
calculating a combined cost between the combined commuting line and the uncombined initial commuting line according to the commuting cost of the combined commuting line and the commuting cost of the uncombined initial commuting line;
and merging the initial commuting lines which are not merged and have the minimum corresponding merging cost with the merged commuting lines until the commuting parameters corresponding to the non-merged commuting lines meet the preset merging conditions or the number of the commuting lines does not exceed a preset numerical value so as to obtain the target commuting lines.
In a specific implementation, the processor 801, the network interface 802, and the memory 803 described in the embodiment of the present invention may execute the implementation described in the flow of the commuting line planning method provided in the embodiment of the present invention, and may also execute the implementation described in the commuting line planning apparatus provided in the embodiment of the present invention, which is not described herein again.
In the embodiment of the present invention, the processor 801 acquires the job parking place and the candidate parking site set, determines the target parking site set from the candidate parking site set by using the job parking place, and merges the initial commuting routes corresponding to each parking site included in the target parking site set according to the commuting time to obtain the target commuting route, so that an appropriate commuting route can be planned quickly and efficiently, the cost of commuting route planning is greatly reduced, and the commuting time of the staff can be effectively shortened.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A commuter line planning method, comprising:
acquiring a job site and a candidate docking site set;
determining a target stop station set from the candidate stop station sets by using the job stop places, wherein the number of passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number;
acquiring commuting time among the stop stations included in the target stop station set;
and combining the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain a target commuting line.
2. The method of claim 1, wherein determining a set of target docking sites from the set of candidate docking sites using the job site comprises:
adsorbing the job site to a docking station with a distance smaller than or equal to a first preset distance in the candidate docking station set;
acquiring a first stop site set adsorbed to a job stop place, and determining the number of boarding people corresponding to each stop site in the first stop site set;
and acquiring a second stop station set, wherein the number of the passengers getting on the train reaches the preset number, in the first stop station set, and determining the second stop station set as a target stop station set.
3. The method of claim 2, further comprising:
acquiring a third stop station set, wherein the number of the passengers getting on the train does not reach the preset number in the first stop station set;
aggregating docking stations in the third docking station set to docking stations in the second docking station set, the distances of which are less than or equal to a second preset distance;
merging the stop stations which are not aggregated in the third stop station set and have the distance less than or equal to a third preset distance to obtain a fourth stop station set, wherein the number of the passengers getting on the train reaches the preset number after merging;
adding docking stations included in the fourth set of docking stations to the target set of docking stations.
4. The method according to any one of claims 1 to 3, wherein the merging the initial commute lines corresponding to each docking station included in the target docking station set according to the commute time to obtain a target commute line comprises:
calculating the combination cost between the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time;
and merging the initial commuting lines with the minimum merging cost to obtain target commuting lines.
5. The method of claim 4, wherein the initial commute line corresponding to each docking station is a commute line through the destination of each docking station, and wherein calculating a combined cost between the initial commute lines corresponding to each docking station included in the set of target docking stations according to the commute time comprises:
aiming at each stop station included in the target stop station set, acquiring the number of passengers getting on the bus corresponding to each stop station;
calculating the commuting cost of the initial commuting line corresponding to each parking station according to the number of passengers getting on the bus corresponding to each parking station and the commuting time of the corresponding initial commuting line;
for any two stop stations in the target stop station set, acquiring the commuting cost after the initial commuting lines corresponding to the any two stop stations are combined;
and calculating the combined cost between the initial commuting lines corresponding to any two stop stations according to the combined commuting cost and the commuting cost of the initial commuting lines corresponding to any two stop stations.
6. The method according to claim 4 or 5, wherein before merging the initial commute line with the smallest merging cost to obtain the target commute line, the method further comprises:
acquiring a commute parameter corresponding to the initial commute route with the minimum merging cost after merging, wherein the commute parameter comprises the total number of people getting on the bus or the total commute time;
if the commute parameters meet preset merging conditions, executing the step of merging the initial commute routes with the minimum merging cost to obtain target commute routes, wherein the preset merging conditions comprise that the total number of people getting on the bus is not more than the maximum number of people capable of bearing the bus or the total commute time is not more than preset duration.
7. The method of claim 6, further comprising:
if the commuting parameters do not meet the preset merging conditions, acquiring an initial commuting line with low merging cost;
and merging the initial commuting lines with the small merging cost to obtain a target commuting line.
8. The method according to claim 6 or 7, wherein the merging the initial commute line with the smallest merging cost to obtain the target commute line comprises:
merging the initial commuting lines with the minimum merging cost to obtain merged commuting lines;
calculating the commuting cost of the combined commuting line according to the number of passengers getting on the bus and the commuting time corresponding to the combined commuting line;
calculating a combined cost between the combined commuting line and the uncombined initial commuting line according to the commuting cost of the combined commuting line and the commuting cost of the uncombined initial commuting line;
and merging the initial commuting lines which are not merged and have the minimum corresponding merging cost with the merged commuting lines until the commuting parameters corresponding to the non-merged commuting lines meet the preset merging conditions or the number of the commuting lines does not exceed a preset numerical value so as to obtain the target commuting lines.
9. The method of claim 1, wherein after merging the initial commute lines corresponding to each docking station included in the target set of docking stations according to the commute time to obtain a target commute line, the method further comprises:
outputting the characteristic information of the target commuting line through a client, wherein the characteristic information comprises one or more of stop station identification, the number of people getting on the bus, stop station type, the number of people getting on the bus currently and total commuting time, and the number of people getting on the bus currently corresponds to the stop station.
10. A commuter line planning apparatus, comprising:
the acquisition module is used for acquiring the job station and the candidate stop station set;
the determining module is used for determining a target stop station set from the candidate stop station sets by using the job stop places, wherein the number of the passengers getting on the bus corresponding to each stop station in the target stop station set reaches a preset number;
the acquisition module is further configured to acquire commute time among the docking stations included in the target docking station set;
and the processing module is used for merging the initial commuting lines corresponding to each stop station point included in the target stop station set according to the commuting time to obtain the target commuting lines.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910782210.3A CN110793535A (en) | 2019-08-22 | 2019-08-22 | Commuting line planning method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910782210.3A CN110793535A (en) | 2019-08-22 | 2019-08-22 | Commuting line planning method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110793535A true CN110793535A (en) | 2020-02-14 |
Family
ID=69427444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910782210.3A Pending CN110793535A (en) | 2019-08-22 | 2019-08-22 | Commuting line planning method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110793535A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130197797A1 (en) * | 2012-01-27 | 2013-08-01 | Adventium Enterprises | Systems and methods for route planning |
| US20170030724A1 (en) * | 2015-08-02 | 2017-02-02 | Baruch AXELROD | Route planning system & method |
| US20170059341A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Diversified route planning for public transportation network |
| CN106571036A (en) * | 2016-11-14 | 2017-04-19 | 中国联合网络通信集团有限公司 | Public transportation stop determination method and apparatus thereof |
| CN107633318A (en) * | 2017-07-03 | 2018-01-26 | 中兴软创科技股份有限公司 | A kind of newly-increased public bus network Optimization Design based on time generic line |
| CN108647221A (en) * | 2018-03-22 | 2018-10-12 | 浙江工业大学 | A kind of public transport paths planning method based on GIS |
| CN109344529A (en) * | 2018-10-22 | 2019-02-15 | 北京航空航天大学 | A kind of customization public bus network design method based on two-phase heuristic algorithm |
| CN109359682A (en) * | 2018-10-11 | 2019-02-19 | 北京市交通信息中心 | A kind of Shuttle Bus candidate's website screening technique based on F-DBSCAN iteration cluster |
| CN109781130A (en) * | 2019-02-01 | 2019-05-21 | 上海雷腾软件股份有限公司 | The method and apparatus that bus route is planned automatically |
| US20190195639A1 (en) * | 2017-12-21 | 2019-06-27 | Grzegorz Malewicz | Method and a Computer System for Providing a Route or a Route Duration for a Journey from a Source Location to a Target Location |
-
2019
- 2019-08-22 CN CN201910782210.3A patent/CN110793535A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130197797A1 (en) * | 2012-01-27 | 2013-08-01 | Adventium Enterprises | Systems and methods for route planning |
| US20170030724A1 (en) * | 2015-08-02 | 2017-02-02 | Baruch AXELROD | Route planning system & method |
| US20170059341A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Diversified route planning for public transportation network |
| CN106571036A (en) * | 2016-11-14 | 2017-04-19 | 中国联合网络通信集团有限公司 | Public transportation stop determination method and apparatus thereof |
| CN107633318A (en) * | 2017-07-03 | 2018-01-26 | 中兴软创科技股份有限公司 | A kind of newly-increased public bus network Optimization Design based on time generic line |
| US20190195639A1 (en) * | 2017-12-21 | 2019-06-27 | Grzegorz Malewicz | Method and a Computer System for Providing a Route or a Route Duration for a Journey from a Source Location to a Target Location |
| CN108647221A (en) * | 2018-03-22 | 2018-10-12 | 浙江工业大学 | A kind of public transport paths planning method based on GIS |
| CN109359682A (en) * | 2018-10-11 | 2019-02-19 | 北京市交通信息中心 | A kind of Shuttle Bus candidate's website screening technique based on F-DBSCAN iteration cluster |
| CN109344529A (en) * | 2018-10-22 | 2019-02-15 | 北京航空航天大学 | A kind of customization public bus network design method based on two-phase heuristic algorithm |
| CN109781130A (en) * | 2019-02-01 | 2019-05-21 | 上海雷腾软件股份有限公司 | The method and apparatus that bus route is planned automatically |
Non-Patent Citations (3)
| Title |
|---|
| 李英帅等: "基于站点取消与合并原理的公交站距优化方法", 《重庆交通大学学报(自然科学版)》 * |
| 邹彦雯: "定制商务班车线路设计研究", 《中国优秀硕士学位论文全文数据库工程科技II辑》 * |
| 金燕波: "校车路径优化问题研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110111575B (en) | Urban traffic flow network analysis method based on complex network theory | |
| US11386359B2 (en) | Systems and methods for managing a vehicle sharing facility | |
| Liu et al. | Corridor-based emergency evacuation system for Washington, DC: system development and case study | |
| US11392861B2 (en) | Systems and methods for managing a vehicle sharing facility | |
| CN109033718B (en) | Dynamic emergency evacuation method for urban rail transit line failure | |
| JP5961848B2 (en) | Plan management system and plan management method | |
| US20140035921A1 (en) | Analysis and visualization of passenger movement in a transportation system | |
| CN104424812B (en) | A kind of public transport arrival time forecasting system and method | |
| CN109145954A (en) | A kind of net based on multisource spatio-temporal data about vehicle safety evaluation method and system | |
| US11132626B2 (en) | Systems and methods for vehicle resource management | |
| US20200210905A1 (en) | Systems and Methods for Managing Networked Vehicle Resources | |
| CN111612122A (en) | Method and device for predicting real-time demand and electronic equipment | |
| CN106052702A (en) | Vehicle navigation method and device | |
| CN111125293B (en) | Automatic generation method and device of public transport network model and electronic equipment | |
| Ram et al. | SMARTBUS: A web application for smart urban mobility and transportation | |
| CN110309952B (en) | City employment spatial layout optimization auxiliary system based on commuting model | |
| US20170308625A1 (en) | Computer-readable recording medium, road construction planning method, and information processing apparatus | |
| JP2019028526A (en) | Congestion prediction device | |
| CN110021161B (en) | Traffic flow direction prediction method and system | |
| Kijewska et al. | Analysis of data needs and having for the integrated urban freight transport management system | |
| US20200109960A1 (en) | Toll tracking and estimating system | |
| CN111798660B (en) | Vehicle information display and acquisition method and device and related equipment | |
| JP2016030473A (en) | Traffic analysis system, traffic analysis program and traffic analysis method | |
| CN110793535A (en) | Commuting line planning method and device | |
| KR102455030B1 (en) | Rental car contract management 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 |