CN110458309A - A kind of net based on practical road network environment about share-car bus station position method - Google Patents

A kind of net based on practical road network environment about share-car bus station position method Download PDF

Info

Publication number
CN110458309A
CN110458309A CN201910580890.0A CN201910580890A CN110458309A CN 110458309 A CN110458309 A CN 110458309A CN 201910580890 A CN201910580890 A CN 201910580890A CN 110458309 A CN110458309 A CN 110458309A
Authority
CN
China
Prior art keywords
section
point
road network
share
distance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910580890.0A
Other languages
Chinese (zh)
Other versions
CN110458309B (en
Inventor
程琳
熊佳莹
杜明洋
李雪峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201910580890.0A priority Critical patent/CN110458309B/en
Publication of CN110458309A publication Critical patent/CN110458309A/en
Application granted granted Critical
Publication of CN110458309B publication Critical patent/CN110458309B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • G06F18/232—Non-hierarchical techniques
    • G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
    • G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
    • 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/02—Reservations, e.g. for tickets, services or events
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Probability & Statistics with Applications (AREA)
  • Artificial Intelligence (AREA)
  • Quality & Reliability (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of net based on practical road network environment about share-car bus station position methods, comprising the following steps: (1) reserves demand point to passenger using K-means clustering procedure and be grouped, and determine the cluster centre of each grouping；(2) each grouping determines corresponding road network analysis area according to the spatial position of passenger demand point and cluster centre；(3) for the corresponding road network analysis area of any grouping, any section is taken, the corresponding section cut-point of all passenger demand points of the grouping is calculated；(4) position using share-car website on the section is as variable, calculate all passenger demand points in road network analysis area to share-car website shortest path sum of the distance, to determine the optimal site location for the section；(5) aforesaid operations, then the sum of the shortest distance in more each section are repeated to sections other in road network analysis area to determine the section and position where optimal website.This method provides reference and selection gist for the Reasonable Arrangement of share-car website in actual life.

Description

A kind of net based on practical road network environment about share-car bus station position method
Technical field
The invention belongs to the public transport fields in Transportation Planning and Management, and in particular to one kind is based on practical road network The net of environment about share-car bus station position method.
Background technique
As the representative of " internet+shared economy ", " share-car " is considered as a kind of going out for Public Transport Service Improvement type Row mode can play suppletion in urban public transport unserviceable area.What the about share-car of existing net was taken is anywhere Free share-car mode will cause net about Vehicle By-pass apart from larger, passenger when passenger's positioning is relatively inclined or need to carry several passengers Waiting time is longer, so that user's stroke is unable to get guarantee.
Website share-car takes the lead in issuing by Di Di company, and main purpose is to reduce in existing net about Ride-share service and spell because connecing Friendly and generation the mileage that detours, and setting up for share-car website allows vehicle to carry several passengers without will increase volume in same place Nonlocal stop frequency.Currently, the desk study stage is still located in the development of China's website share-car, about grinding for share-car bus station position problem Study carefully and more lacks.However in real life, reasonable share-car site location is to raising share-car matching rate, enhancing user experience Sense, the sustainable development for promoting share-car industry etc. have stronger realistic meaning.In addition, considering in share-car bus station position Practical road network environment can make the result more closer to reality situation of bus station position and be easy to implement.
Therefore, it is necessary to design a kind of net based on practical road network environment about share-car bus station position method to share-car website into Row Reasonable Arrangement provides corresponding reference for the development of current site share-car.
Summary of the invention
The present invention provide one kind be able to satisfy passenger demand in practical road network, minimize passenger's walking distance, be skillfully constructed conjunction The about share-car bus station position method of the net based on real road environment of reason.
In order to solve the above-mentioned technical problem, a kind of net based on practical road network environment that the present invention uses about share-car website selects Location method, comprising the following steps:
(1) demand point is reserved to passenger using K-means clustering procedure to be grouped, and determine the cluster centre of each grouping；
(2) according to the spatial position of each grouping the passenger demand point and cluster centre, the corresponding reality of each grouping is determined Road network analysis area；
(3) road network analysis area Z is takeniIn any section [va, vb], calculate the corresponding section of all passenger demand points of the grouping [va, vb] cut-point；
(4) for being likely to be present in section [va, vb] on share-car website x, calculate analysis area in all passenger demand points arrive The shortest path distance of website x, and will be apart from summation, to determine the optimal site location for the section；
(5) to road network analysis area ZiIn other sections repeat the operations of step (3) and step (4), then more each section The sum of shortest distance determines the section and position at the place of optimal website.
Further, in the present invention, in step (1), the determining specific steps of cluster centre point number are as follows:
(11) the spatial position coordinate information that passenger reserves demand point is collected, comprising: a longitude and latitude of getting on the bus a little and get off is sat Mark；
(12) it is based on K-means clustering algorithm, when cluster centre is K, calculates all passengers in each cluster range Demand point and corresponding cluster centre KiEuclidean distance, take apart from maximum value
It (13) is constraint with share-car station services radius R for each cluster centre range, judgment step (12) calculates Arrive apart from maximum valueWhether R is greater than.If it is not, then skipping step (14), corresponding K value is cluster centre point at this time Number.
(14) K=K+1 is taken, step (12) and step (13) are repeated.
Further, in the present invention, in step (13), share-car station services radius determines that method is as follows:
Station services radius R is passenger's maximum walking range, takes 500m, and station services range is with cluster centre for circle The heart is radius to the border circular areas range of external radiation using R.
Further, it in the present invention, in step (2), is respectively grouped corresponding practical road network analysis area and determines that method is as follows:
It is minimal path net unit if UNIT is the minimum closed polygon that road-net node can be constituted；
Road network analysis area is the practical road network region of minimum for including cluster all passenger demand points of range；
(21) to a cluster range KiInterior passenger demand point is judged, if it is located in road network unit UNIT or side At boundary, then the node n that the unit includes is recordedi(including vertex) and section ei(including boundary), section can also use its endpoint table Show, such as section [v1, v2]；
(22) it obtains comprising cluster range KiThe node collection Ni={ n of interior all demand points1, n2, n3... } and section collection Ei ={ e1, e2, e3... and；
(23) road network analysis area ZiZ can be indicated with Graph-theoretical Approachi=(Ni, Ei)。
Further, in the present invention, in step (3), the corresponding section cut-point of passenger demand point determines that method is as follows:
Illustrate: shortest path distance is all made of real network distance, rather than Euclidean distance；
vaAnd vbRepresent a section two-end-point, section and the available [v of road section lengtha, vb] indicate；piAnd pjBetween most Short circuit is usedIt indicates；If piAnd pjBetween shortest path passing point vaWith point vb, then piAnd pjBetween shortest path it is availableIt indicates；
(31) by the step (23) it is found that a road network analysis area ZiIn contain number of nodes Ni, section number Ei, contain Passenger demand point set be combined into Pi={ p1, p2, p3....}；
(32) for section [va, vb]([va, vb]∈Ei), with passenger demand point pi(pi∈Pi) it is starting point, respectively with section [va, vb] two-end-point vaAnd vbFor terminal, shortest path distance is calculated separately with dijkstra's algorithm, is denoted asWith
(33) with pi、va、vbFor vertex of a triangle, with[va, vb],For the side of triangle, triangle is utilized Shape inequality relation finds section [va, vb] cut-point.
Further, in the present invention, in step (33), section [v is found using triangle inequality relationshipa, vb] segmentation Point, the specific steps are as follows:
(331) in triangle pivavbIn, there is following relationship to set up:
Then for passenger demand point piFor, in section [va, vb] existing for a cut-point espi, so that
(332) cut-point espiIn section [va, vb] on position can use cut-point espiWith vaDistance account for section [va, vb] total length ratio(hereinafter referred to as cut-point espiSection [va, vb] accounting) indicate.WhereinIt is corresponding Section starting point va,Corresponding road section terminal vb。
If section range distribution function isIndicate the distance between point i and point j on section；
Cut-point espiPosition calculation formula it is as follows:
Cut-point espiApart from section starting point vaDistance calculation formula it is as follows:
--- cut-point espiSection [va, vb] accounting；
--- passenger demand point piTo section starting point vaShortest path distance；
- mono- passenger demand point piTo road segment end vbShortest path distance；
[va, vb] --- section [va, vb] length；
--- cut-point espiTo vaDistance；
(334) to passenger demand point set PiIn all objects, it can be found out corresponding to section [va, vb] on segmentation Point set is combined into
Further, in the present invention, in step (4), for being likely to be present in section [va, vb] on share-car website x, meter Calculating all passenger demand points in analysis area, will be apart from summation, to determine for the optimal of the section to the shortest path distance of website x Site location, the specific steps are as follows:
Initialization, shortest path distance set
(41) section [v is takena, vb] on any point x as share-car website, if the section [v of website xa, vb] accounting be θ；
(42) combine the step (333) in the step (32) and claim 6 in claim 5 described, it is known that whenWhen, passenger demand point p at this timeiIt is necessary by starting point v to website x shortest patha, shortest path length is expressed as WhenWhen, passenger demand point p at this timeiTo website x shortest path it is necessary by Terminal vb, shortest path length is
Then from passenger demand point piIt is represented by following linear segmented function to website x shortest path distance,
(43) with road network analysis area ZiInterior all passenger demand point set PiFor object, step (42) operation is repeated, P is calculatedi In each object to website shortest path distance, as a result be stored in set Dθ[va, vb] in, it is denoted as Dθ[va, vb]={ Dp1(θ), Dp2(θ), Dp3(θ)....}；
(44) element in distance set is summed, is denoted as ∑ Dθ[va, vb]；
Further, in the present invention, in step (5), to road network analysis area ZjIn other sections repeat step (3) and step (4) the sum of operation, then the shortest distance in more each section determine the section and position at the place of optimal website, specific steps It is as follows:
Initialization, distance and setWith minimum range set
(51) to road network analysis area ZiMiddle section set EiMiddle other elements repeat in step (3) and step (4) to section [va, vb] same operation, in the value deposit set D for respectively obtaining distance summation, then D={ ∑ Dθ[e1], ∑ Dθ[e2], ∑ Dθ[e3]...}
(52) remember sd (e1)=min ∑ Dθ[e1], calculate ∑ Dθ[e1] minimum value, and record sd (e1) value and corresponding θ Value；
(53) likewise, it is similar to section e1Operation, calculate separately the minimum value of all elements in set D, as a result deposit Enter in set sd, i.e. sd={ sd (e1), sd (e2), sd (e3), sd (e4) ... }, and record corresponding θ value；
(54) compare all elements in set sd, the corresponding section of the smallest element value and θ value are road network analysis area ZiOptimal section and position existing for middle share-car website x.
Compared with prior art, technical solution of the present invention has the advantages that
1. the present invention can reserve demand data based on passenger and carry out Reasonable Arrangement to share-car website, net about share-car has been filled up The blank of bus station position method provides corresponding reference and method branch for the bus station position level in current site Ride-share service Support.
2. share-car bus station position method proposed by the present invention relies on real roads network environment, traditional artificial warp has been abandoned The drawbacks of testing subjective setting method of adjustment, it is ensured that science, accuracy, reasonability and the validity that share-car website is laid.
3. the present invention is based on share-car site location of the section cut-point to any bar section to optimize, then more each section Result come section and position where determining final optimal website, method rationally and calculates easy.
Detailed description of the invention
Fig. 1 is flow chart of the invention.
Fig. 2 is practical road network structure of the present invention.
Fig. 3 is road network analysis area Z of the present invention2。
Specific embodiment
With reference to the accompanying drawings of the specification and embodiment, technical solution of the present invention is described in further detail.
Embodiment 1: referring to Fig. 1, a kind of about share-car bus station position method, including following step of the net based on practical road network environment It is rapid:
(1) demand point is reserved to passenger using K-means clustering procedure to be grouped, and determine the cluster centre of each grouping；
(2) according to the spatial position of each grouping the passenger demand point and cluster centre, the corresponding reality of each grouping is determined Road network analysis area；
(3) road network analysis area Z is takeniIn any section [va, vb], calculate the corresponding section of all passenger demand points of the grouping [va, vb] cut-point；
(4) for being likely to be present in section [va, vb] on share-car website x, calculate analysis area in all passenger demand points arrive The shortest path distance of website x, and will be apart from summation, to determine the optimal site location for the section；
(5) to road network analysis area ZiIn other sections repeat the operations of step (3) and step (4), then more each section The sum of shortest distance determines the section and position at the place of optimal website.
Further, in the present invention, in step (1), the determining specific steps of cluster centre point number are as follows:
(11) the spatial position coordinate information that passenger reserves demand point is collected, comprising: a longitude and latitude of getting on the bus a little and get off is sat Mark；
(12) it is based on K-means clustering algorithm, when cluster centre is K, calculates all passengers in each cluster range Demand point and corresponding cluster centre KiEuclidean distance, take apart from maximum value
It (13) is constraint with share-car station services radius R for each cluster centre range, judgment step (12) calculates Arrive apart from maximum valueWhether R is greater than.If it is not, then skipping step (14), corresponding K value is cluster centre point at this time Number.
(14) K=K+1 is taken, step (12) and step (13) are repeated.
In the present invention, in step (13), share-car station services radius determines that method is as follows:
Station services radius R is passenger's maximum walking range, takes 500m, and station services range is with cluster centre for circle The heart is radius to the border circular areas range of external radiation using R.
In the present invention, in step (2), respectively it is grouped corresponding practical road network analysis area and determines that method is as follows:
It is minimal path net unit if UNIT is the minimum closed polygon that road-net node can be constituted；
Road network analysis area is the practical road network region of minimum for including cluster all passenger demand points of range；
(21) to a cluster range KiInterior passenger demand point is judged, if it is located in road network unit UNIT or side At boundary, then the node n that the unit includes is recordedi(including vertex) and section ei(including boundary), section can also use its endpoint table Show, such as section [v1, v2]；
(22) it obtains comprising cluster range KiThe node collection N of interior all demand pointsi={ n1, n2, n3... } and section collection Ei ={ e1, e2, e3... and；
(23) road network analysis area ZiZ can be indicated with Graph-theoretical Approachi=(Ni, Ei)。
In the present invention, in step (3), the corresponding section cut-point of passenger demand point determines that method is as follows:
Illustrate: shortest path distance is all made of real network distance, rather than Euclidean distance；
vaAnd vbRepresent a section two-end-point, section and the available [v of road section lengtha, vb] indicate；piAnd pjBetween most Short circuit is usedIt indicates；If piAnd pjBetween shortest path passing point vaWith point vb, then piAnd pjBetween shortest path it is availableIt indicates；
(31) by the step (23) it is found that a road network analysis area ZiIn contain number of nodes Ni, section number Ei, contain Passenger demand point set be combined into Pi={ p1, p2, p3....}；
(32) for section [va, vb]([va, vb]∈Ei), with passenger demand point pi(pi∈Pi) it is starting point, respectively with section [va, vb] two-end-point vaAnd vbFor terminal, shortest path distance is calculated separately with dijkstra's algorithm, is denoted asWith
(33) with pj、va、vbFor vertex of a triangle, with[va, vb],For the side of triangle, triangle is utilized Shape inequality relation finds section [va, vb] cut-point.
In the present invention, in step (33), section [v is found using triangle inequality relationshipa, vb] cut-point, it is specific to walk It is rapid as follows:
(331) in triangle pivavbIn, there is following relationship to set up:
Then for passenger demand point piFor, in section [va, vb] existing for a cut-point espi, so that
(332) cut-point esptIn section [va, vb] on position can use cut-point espiWith vaDistance account for section [va, vb] total length ratio(hereinafter referred to as cut-point espiSection [va, vb] accounting) indicate.WhereinIt is corresponding Section starting point va,Corresponding road section terminal vb。
If section range distribution function isIndicate the distance between point i and point j on section；
Cut-point espiPosition calculation formula it is as follows:
Cut-point espiApart from section starting point vaDistance calculation formula it is as follows:
--- cut-point espiSection [va, vb] accounting；
--- passenger demand point piTo section starting point vaShortest path distance；
--- passenger demand point piTo road segment end vbShortest path distance；
[va, vb] --- section [va, vb] length；
--- cut-point espiTo vaDistance；
(334) to passenger demand point set PiIn all objects, it can be found out corresponding to section [va, vb] on segmentation Point set is combined into
In the present invention, in step (4), for being likely to be present in section [va, vb] on share-car website x, calculate analysis area in All passenger demand points to website x shortest path distance, will apart from summation, to determine the optimal site location for the section, Specific step is as follows:
Initialization, shortest path distance set
(41) section [v is takena, vb] on any point x as share-car website, if the section [v of website xa, vb] accounting be θ；
(42) combine the step (333) in the step (32) and claim 6 in claim 5 described, it is known that whenWhen, passenger demand point pi is necessary by starting point v to website x shortest path at this timea, shortest path length is expressed asF0, θ.WhenWhen, passenger demand point p at this timeiTo website x shortest path it is necessary by Terminal vb, shortest path length is
Then from passenger demand point piIt is represented by following linear segmented function to website x shortest path distance,
(43) with road network analysis area ZiInterior all passenger demand point set PiFor object, step (42) operation is repeated, P is calculatedi In each object to website shortest path distance, as a result be stored in set Dθ[va, vb] in, it is denoted as Dθ[va, vb]={ Dp1(θ), Dp2(θ), Dp3(θ)....}；
(44) element in distance set is summed, is denoted as ∑ Dθ[va, vb]；
Further, in the present invention, in step (5), to road network analysis area ZiIn other sections repeat step (3) and step (4) the sum of operation, then the shortest distance in more each section determine the section and position at the place of optimal website, specific steps It is as follows:
Initialization, distance and setWith minimum range set
(51) to road network analysis area ZiMiddle section set EiMiddle other elements repeat in step (3) and step (4) to section [va, vb] same operation, in the value deposit set D for respectively obtaining distance summation, then D={ ∑ Dθ[e1], ∑ Dθ[e2], ∑ Dθ[e3]...}
(52) remember sd (e1)=min ∑ Dθ[e1], calculate ∑ Dθ[e1] minimum value, and record sd (e1) value and corresponding θ Value；
(53) likewise, it is similar to section e1Operation, calculate separately the minimum value of all elements in set D, as a result deposit Enter in set sd, i.e. sd={ sd (e1), sd (e2), sd (e3), sd (e4) ... }, and record corresponding θ value；
(54) compare all elements in set sd, the corresponding section of the smallest element value and θ value are road network analysis area ZiOptimal section and position existing for middle share-car website x.
Application Example 1: referring to figures 1-3, a kind of net based on practical road network environment about share-car bus station position method, packet Include following steps:
(1) demand point is reserved to passenger using K-means clustering procedure to be grouped, and determine the cluster centre of each grouping. The present embodiment has chosen part real roads net, as shown in Fig. 2, road network includes 11 nodes, 19 sections.It is random on road network It generates passenger's share-car and reserves demand point.By passenger's maximum walking distance range constraint, can must be clustered using K-means clustering procedure Center Number is 3, and number is respectively K1、K2、K3。
(2) according to the spatial position of each grouping the passenger demand point and cluster centre, the corresponding reality of each grouping is determined Road network analysis area.Here and subsequent content is with cluster centre K2For be described in detail, other cluster ranges operation it is similar. By to cluster centre K2Demand point (number p in range1、p2、p3) there are road network ranges to be judged, it may be determined that its is right The road network analysis area answered is Z2, as shown in Figure 3.Road network analysis area Z2The node set N for including2With section set E2Respectively N2= {V5, V4, V6, V7], E2={ [V5, V4], [V4, V6], [V6, V7], [V5, V6], [V5, V7]}。
(3) road network analysis area Z is taken2In any section [V5, V6], calculate the corresponding section of all passenger demand points of the grouping [V5, V6] cut-point.Analysis area Z2Middle section weight is respectively [V5, V4]=6, [V4, V6]=7, [V6, V7]=4, [V5, V6]= 7, [V5, V7]=5.Passenger demand point p1、p2、p3Position on section is respectively [V5, p1]=4, [V4, p2]=3, [V5, p3] =2.
Passenger demand point p1Corresponding section [V5, V6] cut-point calculate it is as follows:
Similarly, passenger demand point p can be calculated2And p3Corresponding section [V5, V6] cut-point is
(4) for being likely to be present in section [V5, V6] on share-car website x, calculate analysis area in all passenger demand points arrive The shortest path distance of website x, will be apart from summation, to determine the optimal site location for the section.Each passenger demand point arrives at a station The shortest path distance of point x is represented by
∑ D will be obtained apart from summationθ[V5, V6] be
(5) to road network analysis area Z2In other sections repeat the operations of step (3) and step (4), then more each section The sum of shortest distance determines the section and position at the place of optimal website.For piecewise function ∑ Dθ[V5, V6] for, due to sd ([V5, V6])=min ∑ Dθ[V5, V6], as θ=4/7, sd ([V can be obtained5, V6])=13；
It is similar, sd ([V can be calculated5, V7])=19, sd ([V4, V5])=15, sd ([V4, V6])=18, sd ([V6, V7])=18；Therefore, { 13,19,15,18 } set sd=, least member 13, as sd ([V5, V6])；
In road network analysis area Z2In, optimal addressing existing for share-car website x is section [V5, V6] on and away from point V5Distance is At the position of 4/7 road section length.
To other cluster centre ranges determine the operation of optimal share-car site location with above-mentioned K2It is similar.
Above-described embodiment is only the preferred embodiment of the present invention, it should be pointed out that: for the ordinary skill of the art For personnel, without departing from the principle of the present invention, several improvement and equivalent replacement can also be made, these are to the present invention Claim improve with the technical solution after equivalent replacement, each fall within protection scope of the present invention.

Claims (8)

1. a kind of net based on practical road network environment about share-car bus station position method, which is characterized in that this method includes following step It is rapid:
(1) demand point is reserved to passenger using K-means clustering procedure to be grouped, and determine the cluster centre of each grouping；
(2) according to the spatial position of each grouping the passenger demand point and cluster centre, the corresponding practical road network of each grouping is determined Analysis area；
(3) road network analysis area Z is takeniIn any section [va,vb], calculate the corresponding section [v of all passenger demand points of the groupinga, vb] cut-point；
(4) for being likely to be present in section [va,vb] on share-car website x, calculate in analysis area all passenger demand points to website The shortest path distance of x, and will be apart from summation, to determine the optimal site location for the section；
(5) to road network analysis area ZiIn other sections repeat the operations of step (3) and step (4), then the most short distance in more each section The sum of from, determine the section and position at the place of optimal website.
2. net according to claim 1 about share-car bus station position method, which is characterized in that specific in the step (1) Step are as follows:
(11) the spatial position coordinate information that passenger reserves demand point is collected, comprising: a latitude and longitude coordinates of getting on the bus a little and get off；
(12) it is based on K-means clustering algorithm, when cluster centre is K, calculates all passenger demands in each cluster range It puts and corresponding cluster centre KiEuclidean distance, take apart from maximum value
It (13) is constraint with share-car station services radius R for each cluster centre range, judgment step (12) is calculated Apart from maximum valueWhether R is greater than, if it is not, then skipping step (14), corresponding K value is cluster centre point number at this time.
(14) K=K+1 is taken, step (12) and step (13) are repeated.
3. the share-car bus station position method according to claim 2 based on clustering methodology, which is characterized in that the step It suddenly is constraint with share-car station services range in (13), comprising:
Station services radius R is passenger's maximum walking range, takes 500m, station services range is using cluster centre as the center of circle, with R It is radius to the border circular areas range of external radiation.
4. net according to claim 1 about share-car bus station position method, which is characterized in that each to be grouped in the step (2) Corresponding practical road network analysis area determines that method is as follows:
It is minimal path net unit if UNIT is the minimum closed polygon that road-net node can be constituted；Road network analysis area be include The practical road network region of minimum of one cluster all passenger demand point of range；
(21) to a cluster range KiInterior passenger demand point is judged, if it is located in road network unit UNIT or boundary, Then record the node n that the unit includesi(including vertex) and section ei(including boundary), section can also indicate with its two-end-point, such as Section [v1,v2]；
(22) it obtains comprising cluster range KiThe node collection N of interior all demand pointsi={ n1,n2,n3... } and section collection Ei={ e1, e2,e3….}；
(23) road network analysis area ZiZ can be indicated with the representation method of figurei=(Ni,Ei)。
5. net according to claim 1 about share-car bus station position method, which is characterized in that in the step (3), Cheng Kexu Ask a little corresponding section cut-point determine that method is as follows:
Wherein, shortest path distance is all made of practical road network distance, rather than Euclidean distance；
vaAnd vbRepresent a section two-end-point, section and the available [v of road section lengtha,vb] indicate；Passenger demand point piAnd pjIt Between shortest path useIt indicates；If piAnd pjBetween shortest path passing point vaWith point vb, then piAnd pjBetween shortest path can WithIt indicates；
(31) by the step (23) it is found that a road network analysis area ZiIn contain number of nodes Ni, section number Ei, include multiplies Objective demand point set is Pi={ p1,p2,p3….}；
(32) for section [va,vb]([va,vb]∈Ei), with passenger demand point pi(pi∈Pi) it is starting point, respectively with section [va, vb] two-end-point vaAnd vbFor terminal, shortest path distance is calculated separately with dijkstra's algorithm, is denoted asWith
(33) with pi、va、vbFor vertex of a triangle, with[va,vb],For the side of triangle, not using triangle Equilibrium relationships find section [va,vb] cut-point.
6. net according to claim 5 about share-car bus station position method, which is characterized in that utilized in the step (33) Triangle inequality relationship finds section [va,vb] cut-point, specific steps are as follows:
(331) in triangle pivavbIn, there is following relationship to set up:
Then for passenger demand point piFor, in section [va,vb] existing for a cut-point espi, so that
(332) cut-point espiIn section [va,vb] on position can use cut-point espiWith vaDistance account for section [va,vb] total The ratio of length(hereinafter referred to as cut-point espiSection [va,vb] accounting) indicate.WhereinCorresponding road section Starting point va,Corresponding road section terminal vb；
If section range distribution function isIndicate the distance between point i and point j on section；
Cut-point espiPosition calculation formula it is as follows:
Cut-point espiApart from section starting point vaDistance calculation formula it is as follows:
--- cut-point espiSection [va,vb] accounting；
--- passenger demand point piTo section starting point vaShortest path distance；
--- passenger demand point piTo road segment end vbShortest path distance；
[va,vb] --- section [va,vb] length；
--- cut-point espiTo vaDistance；
(334) to passenger demand point set PiIn all objects, it can be found out corresponding to section [va,vb] on cut-point account for It is combined into than collection
7. net according to claim 1 about share-car bus station position method, which is characterized in that in the step (4), for can Section [v can be present ina,vb] on share-car website x, calculate analysis area in all passenger demand points to website x shortest path away from From will be apart from summation, to determine the optimal site location for the section, specific steps are as follows:
Initialization, shortest path distance set
(41) section [v is takena,vb] on any point x as share-car website, if the section [v of website xa,vb] accounting be θ；
(42) combine the step (333) in the step (32) and claim 6 in claim 5 described, it is known that whenWhen, passenger demand point p at this timeiIt is necessary by starting point v to website x shortest patha, shortest path length is expressed asWhenWhen, passenger demand point p at this timeiIt is necessary by terminal to website x shortest path vb, shortest path length is expressed as
Then from passenger demand point piIt is represented by following linear segmented function to website x shortest path distance,
(43) with road network analysis area ZiInterior all passenger demand point set PiFor object, step (42) operation is repeated, P is calculatediIn it is every As a result a object is stored in set D to the shortest path distance of websiteθ[va,vb] in, it is denoted as
(44) by shortest path distance set Dθ[va,vb] in element summation, be denoted as ∑ Dθ[va,vb]。
8. a kind of net according to claim 1 about share-car site selecting method, which is characterized in that in the step (5), to road network Analysis area ZiIn other sections repeat the sum of step (3) and the operation, then the shortest distance in more each section of step (4), determination The section and position at the place of optimal website, specific steps are as follows:
Initialization, distance and setWith minimum range set
(51) to road network analysis area ZiMiddle section set EiMiddle other elements repeat in step (3) and step (4) to section [va,vb] Same operation, in the value deposit set D for respectively obtaining distance summation, then D={ ∑ Dθ[e1],∑Dθ[e2],∑Dθ [e3]…}
(52) remember sd (e1)=min ∑ Dθ[e1], calculate ∑ Dθ[e1] minimum value, and record sd (e1) value and corresponding θ value；
(53) likewise, it is similar to section e1Operation, calculate separately the minimum value of all elements in set D, as a result deposit set In sd, i.e. sd={ sd (e1),sd(e2),sd(e3),sd(e4) ... }, and record corresponding θ value；
(54) compare all elements in set sd, the corresponding section of the smallest element value and θ value are road network analysis area ZiMiddle spelling Optimal section and position existing for the point x of station.
CN201910580890.0A 2019-06-29 2019-06-29 Network about splicing station point location method based on actual road network environment Active CN110458309B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910580890.0A CN110458309B (en) 2019-06-29 2019-06-29 Network about splicing station point location method based on actual road network environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910580890.0A CN110458309B (en) 2019-06-29 2019-06-29 Network about splicing station point location method based on actual road network environment

Publications (2)

Publication Number Publication Date
CN110458309A true CN110458309A (en) 2019-11-15
CN110458309B CN110458309B (en) 2023-07-11

Family

ID=68481844

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910580890.0A Active CN110458309B (en) 2019-06-29 2019-06-29 Network about splicing station point location method based on actual road network environment

Country Status (1)

Country Link
CN (1) CN110458309B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115472008A (en) * 2022-08-30 2022-12-13 东南大学 Network appointment travel time-space characteristic analysis method based on k-means clustering

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130079024A1 (en) * 2005-12-30 2013-03-28 At&T Intellectual Property Ii, L.P. Method and system for facility location optimization
CN105206046A (en) * 2015-10-10 2015-12-30 东南大学 Big-data-based taxi service station site selection and feasibility evaluation method
CN108734337A (en) * 2018-04-18 2018-11-02 北京交通大学 Based on the modified customization public transport rideshare website generation method of cluster centre
CN108764555A (en) * 2018-05-22 2018-11-06 浙江大学城市学院 A kind of shared bicycle based on Hadoop parks a site selecting method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130079024A1 (en) * 2005-12-30 2013-03-28 At&T Intellectual Property Ii, L.P. Method and system for facility location optimization
CN105206046A (en) * 2015-10-10 2015-12-30 东南大学 Big-data-based taxi service station site selection and feasibility evaluation method
CN108734337A (en) * 2018-04-18 2018-11-02 北京交通大学 Based on the modified customization public transport rideshare website generation method of cluster centre
CN108764555A (en) * 2018-05-22 2018-11-06 浙江大学城市学院 A kind of shared bicycle based on Hadoop parks a site selecting method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MARYAM JAVADI 等: "New spatial clustering-based models for optimal urban facility location considering geographical obstacles", 《JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115472008A (en) * 2022-08-30 2022-12-13 东南大学 Network appointment travel time-space characteristic analysis method based on k-means clustering
CN115472008B (en) * 2022-08-30 2023-09-19 东南大学 Network vehicle travel space-time characteristic analysis method based on k-means clustering

Also Published As

Publication number Publication date
CN110458309B (en) 2023-07-11

Similar Documents

Publication Publication Date Title
TW201205040A (en) Probe data processing
CN107796414B (en) A kind of most U.S. method for path navigation and system based on the scoring of streetscape figure aesthetics
US10359291B2 (en) Determining network maps of transport networks
CN111445308A (en) Tourist attraction recommendation method based on user portrait
CN110503485B (en) Geographical region classification method and device, electronic equipment and storage medium
CN109949063A (en) A kind of address determines method, apparatus, electronic equipment and readable storage medium storing program for executing
CN106767835A (en) Localization method and device
CN109146360A (en) Grid establishing method and device and distribution method and device
CN107515949A (en) User's space-time method for measuring similarity in interest point prediction and recommendation
CN110175865A (en) Electric car charging real time pricing method based on ubiquitous cognition technology
Thévenin et al. Mapping the distortions in time and space: The french railway network 1830–1930
Huang et al. A GIS-based framework for bus network optimization using genetic algorithm
Shrestha et al. Covering-based rural road network methodology for hilly regions of developing countries: Application in Nepal
Tavassoli et al. Calibrating a transit assignment model using smart card data in a large-scale multi-modal transit network
CN106844642B (en) Method for calculating population density in road network grid based on GIS
Meng et al. Street morphology and travel by dockless shared bicycles in Beijing, China
CN110458309A (en) A kind of net based on practical road network environment about share-car bus station position method
NISTOR et al. GIS-Based Kernel Analysis for Tourism Flow Mapping.
CN111881573B (en) Population space distribution simulation method and device based on urban inland inundation risk assessment
CN111008730B (en) Crowd concentration prediction model construction method and device based on urban space structure
Huo et al. Exploring the influencing factors on demand-responsive customized bus ridership using multi-source data
Pueyo et al. Accessibility Evaluation of the Transportation Network in Spain during the First Decade of the Twenty-first Century 1
Bruno et al. An interactive decision support system for the design of rapid public transit networks
CN113239269A (en) Improved recommendation algorithm-based travel route customization method
Foti A behavioral framework for measuring walkability and its impact on home values and residential location choices

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant