CN109764884A - A kind of school bus paths planning method and device for planning - Google Patents

A kind of school bus paths planning method and device for planning Download PDF

Info

Publication number
CN109764884A
CN109764884A CN201910000533.2A CN201910000533A CN109764884A CN 109764884 A CN109764884 A CN 109764884A CN 201910000533 A CN201910000533 A CN 201910000533A CN 109764884 A CN109764884 A CN 109764884A
Authority
CN
China
Prior art keywords
student
school bus
school
website
address
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
Application number
CN201910000533.2A
Other languages
Chinese (zh)
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.)
University of Science and Technology Beijing USTB
Original Assignee
University of Science and Technology Beijing USTB
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 University of Science and Technology Beijing USTB filed Critical University of Science and Technology Beijing USTB
Priority to CN201910000533.2A priority Critical patent/CN109764884A/en
Publication of CN109764884A publication Critical patent/CN109764884A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a kind of school bus paths planning method and device for planning, can effectively reduce the data scale of school bus path planning.The described method includes: obtaining the latitude and longitude coordinates of student's family address and school address;According to student to website apart from desired value and each student to affiliated website apart from maximum value, establish school bus and stop site model;Site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, obtains the division information that school bus stops website and student's group's home site;Path planning is carried out according to the division information that the latitude and longitude coordinates in obtained student's family address and school address, school bus stop website and student's group's home site.The present invention is operated suitable for path planning.

Description

A kind of school bus paths planning method and device for planning
Technical field
The present invention relates to path planning field, a kind of school bus paths planning method and device for planning are particularly related to.
Background technique
In recent years, with the development of social economy, the quickening of urbanization process.The peace that middle and primary schools and kindergarten student go to school Oneself becomes a social concern by warp to full problem, and many parents extremely worry this, therefore in the poly- of some period schools periphery A large amount of private car is collected, has caused the congestion of neighbouring road, but also traffic pressure doubles.Therefore in order to preferably alleviate city Traffic pressure reduces student's traffic time, designs reasonable school bus route and be a problem to be solved.
By reasonably being optimized to school bus path, reasonable school bus path can be obtained, it can reduce school and throw Enter the quantity of school bus, save the cost, and the time of driving of school bus can be shortened, and traffic pressure can be alleviated.Therefore to school bus road Diameter carries out whole planning and is of great significance.
Currently, the case where having determined both at home and abroad to the research of school bus routing problem mainly for website optimizes roadway Line, existing solution are concentrated mainly on accurate solution, heuristic solving strategy and meta-heuristic and solve.
The research starting of exact algorithm is more early, but with the increase for the scale of studying a question, research is restricted.Due to The NP-hard characteristic of school bus routing problem, only relatively small-scale problem can be used exact algorithm and obtain optimal solution.Work as number When bigger than normal according to scale, optimal value can not be obtained using exact algorithm.
Large-scale problem is then needed to solve using meta-heuristic algorithm, if stopping the unknown item of website in school bus Website is stopped using the home address of each student as school bus under part, a large amount of runing time can be spent, and cause optimal value simultaneously It is undesirable.
Summary of the invention
It is existing to solve the technical problem to be solved in the present invention is to provide a kind of school bus paths planning method and device for planning It present in technology when data scale is bigger than normal, is solved using exact algorithm or meta-heuristic algorithm, path can not be obtained The problem of planning optimal value.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of school bus paths planning method, comprising:
Obtain the latitude and longitude coordinates of student's family address and school address;
According to student to website apart from desired value and each student to affiliated website apart from maximum value, establish school bus and stop By site model;
Site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, obtains school bus stop The division information of website and student's group's home site;
Website is stopped according to the latitude and longitude coordinates in obtained student's family address and school address, school bus and student group returns The division information for belonging to website carries out path planning.
Further, before obtaining the latitude and longitude coordinates of student's family address and school address, the method is also wrapped It includes:
Obtain student's family address and school address;
First time data cleansing is carried out to the student's family address and school address, wherein the first time data Cleaning includes: duplicate removal, removes missing values;
By after cleaning student's family address and school address be converted into corresponding latitude and longitude coordinates.
Further, after obtaining the latitude and longitude coordinates of student's family address and school address, the method is also wrapped It includes:
The latitude and longitude coordinates in student's family address and school address to acquisition carry out second of data cleansing, wherein Second of data cleansing includes: the cleaning of noise data, the cleaning of assigning null data, the cleaning of invalid data and customized clear It washes.
Further, the school bus stops the objective function of site model: fs=min (K);
Constraint condition:
1≤K≤N
Wherein, fs=min (K) indicates that optimization aim is to keep school bus bus stop point quantity K minimum;K indicates school bus bus stop The number of point;Indicate that student i stops website C to school busjDistance;CjWebsite Hosting C={ C is stopped for school bus1,C2, C3........CKIn element;R indicates to allow student to affiliated website apart from maximum value;Indicate website CjStudent Number;The total number of persons of N expression student;Indicate whether student i is divided into website CjIn.
Further, described that site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, Obtain school bus stop website and student group home site division information include:
S1, setting allow student, apart from maximum value r, to obtain student's family address latitude and longitude coordinates composition to affiliated website Data set D;
S2 randomly selects a point C in data set Di, and it is added to set C as a cluster heart, that is, origin site, C={ Ci, and point C is removed in Di
S3 is deleted in D apart from website CiLess than or equal to the point apart from maximum value r;
S4 jumps to S2 if set D is not sky;If set D is sky, set C is initial cluster heart C1, C2......CK
S5 calculates each data in data set and each data is divided into similarity to the similarity between each cluster heart In highest cluster, to each cluster, calculates in cluster the mean value of all the points and using the mean value as the new cluster heart, update the position of the cluster heart It sets;
S6 terminates if preset criterion function convergence Mr. Yu's value or the cluster heart do not change;Otherwise, S5 is jumped to.
Further, the latitude and longitude coordinates in the basis obtains student's family address and school address, school bus are stopped The division information of website and student's group's home site carries out path planning and includes:
The division information of website and student's group's home site is stopped, according to obtained school bus to minimize school bus number and minimum Changing driving of school bus distance is school bus path optimization target, establishes school bus path planning model;
According to the school bus path planning model of the latitude and longitude coordinates and foundation of student's family address and school address, benefit Multiple target school bus path planning is realized with minimax ant group algorithm.
Further, the objective function of the school bus path planning model indicates are as follows:
Wherein, fpathIndicate the objective function of school bus path planning model, DijIndicate the distance between website i to website j, xijvIndicate vehicle v whether by website i to website j, x0jvIndicate vehicle v whether by starting point/terminal to website j.
Further, according to the latitude and longitude coordinates in student's family address and school address and the school bus path of foundation Plan model, after realizing multiple target school bus path planning using minimax ant group algorithm, the method also includes:
In the region that each path is formed, the website number of all public transport is counted;
Acquisition station counts most public transport as target public transport, and the target public transport picks student for replacing school bus.
The embodiment of the present invention also provides a kind of school bus path planning apparatus, comprising:
Module is obtained, for obtaining the latitude and longitude coordinates in student's family address and school address;
Module is established, for maximum according to the distance apart from desired value and each student to affiliated website of student to website Value establishes school bus and stops site model;
Cluster module, for being clustered to student's family address longitude and latitude according to the school bus of foundation stop site model, Obtain the division information that school bus stops website and student's group's home site;
Planning module, for being stopped according to the latitude and longitude coordinates in obtained student's family address and school address, school bus The division information of website and student's group's home site carries out path planning.
The advantageous effects of the above technical solutions of the present invention are as follows:
In above scheme, the latitude and longitude coordinates of student's family address and school address are obtained;Website is arrived according to student It establishes school bus apart from maximum value to affiliated website apart from desired value and each student and stops site model;According to the school of foundation Vehicle stops site model, clusters to student's family address longitude and latitude, obtains school bus and stops website and student's group's home site Division information;Website and student are stopped according to the latitude and longitude coordinates in obtained student's family address and school address, school bus The division information of group's home site carries out path planning;In this way, being closed using the strategy for carrying out path planning afterwards is first clustered It manages on the basis of school bus stops website and carries out multiple target school bus path planning, to large-scale school bus routing problem is converted into small The school bus path planning problem of scale can effectively reduce the data scale of school bus path planning.
Detailed description of the invention
Fig. 1 is the flow diagram of school bus paths planning method provided in an embodiment of the present invention;
Fig. 2 is the workflow schematic diagram of improved K-means provided in an embodiment of the present invention;
Fig. 3 is the structural schematic diagram of school bus path planning apparatus provided in an embodiment of the present invention.
Specific embodiment
To keep the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool Body embodiment is described in detail.
The present invention is solved using exact algorithm or meta-heuristic algorithm for existing when data scale is bigger than normal, The problem of path planning optimal value can not be obtained, provides a kind of school bus paths planning method and device for planning.
Embodiment one
As shown in Figure 1, school bus paths planning method provided in an embodiment of the present invention, comprising:
S101 obtains the latitude and longitude coordinates of student's family address and school address;
S102, according to student to website apart from desired value and each student to affiliated website apart from maximum value, establish School bus stops site model;
S103 stops site model according to the school bus of foundation, clusters to student's family address longitude and latitude, obtain school bus Stop the division information of website and student's group's home site;
S104 stops website and according to the latitude and longitude coordinates in obtained student's family address and school address, school bus The division information of raw group's home site carries out path planning.
School bus paths planning method described in the embodiment of the present invention obtains the longitude and latitude of student's family address and school address Spend coordinate;According to student to website apart from desired value and each student to affiliated website apart from maximum value, establish school bus and stop By site model;Site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, school bus is obtained and stops By the division information of website and student's group's home site;It is sat according to the longitude and latitude in obtained student's family address and school address Mark, school bus stop website and the division information of student's group's home site carries out path planning;In this way, using laggard walking along the street is first clustered The strategy of diameter planning carries out multiple target school bus path planning on the basis of obtaining reasonable school bus and stopping website, thus by extensive School bus routing problem be converted into small-scale school bus path planning problem, can effectively reduce the data of school bus path planning Scale.
In the specific embodiment of aforementioned school bus paths planning method, further, obtain student's family address with And before the latitude and longitude coordinates of school address, the method also includes:
Obtain student's family address and school address;
First time data cleansing is carried out to the student's family address and school address, wherein the first time data Cleaning includes: duplicate removal, removes missing values;
By after cleaning student's family address and school address be converted into corresponding latitude and longitude coordinates.
It, can not since the student's family address of acquisition and school address are stated by text in the present embodiment It applies in path planning hereafter, therefore the latitude and longitude coordinates for forming and facilitating calculating by number need to be converted thereof into.This implementation Example in, can by after above-mentioned cleaning student's family address and school address pass through Amap application programming interface (Application Programming Interface, API) is converted into corresponding latitude and longitude coordinates.
In the specific embodiment of aforementioned school bus paths planning method, further, obtain student's family address with And after the latitude and longitude coordinates of school address, the method also includes:
The latitude and longitude coordinates in student's family address and school address to acquisition carry out second of data cleansing, wherein Second of data cleansing includes: the cleaning of noise data, the cleaning of assigning null data, the cleaning of invalid data and customized clear It washes.
In the present embodiment, the cleaning of noise data refers to: leave out the student that home address obviously exceeds school district planned range, The partial data may be caused since home address migrates or fills in mistake;
The cleaning of assigning null data refers to: the student default for home address, by Principle of Statistics, is learned according to the school district The distribution situation of home address is given birth to be filled to null value;
The cleaning of invalid data refers to: the invalid data of misspelling or address resolution for appearance, carry out corrigendum or It deletes;
Customized cleaning refers to: the removal home address student excessively close apart from school, defaulting the partial students can voluntarily walk Row is gone to school, and unnecessary detour is avoided.
In the present embodiment, it is contemplated that the factor of student's riding time, driving of school bus distance etc., it will be remote apart from school Related data is cleaned, and is removed with the practical data not being consistent and believed from the home to the too close student of school's walking duration Breath, completes data cleansing again.
It is maximum according to the distance apart from desired value and each student to affiliated website of student to website in the present embodiment Value establishes school bus and stops site model;Wherein, it is that school bus bus stop is made to count that the school bus, which stops the objective function of site model, It is minimum to measure K:
fs=min (K)
Constraint condition:
1≤K≤N (1-3)
Wherein, fs=min (K) indicates that optimization aim is to keep school bus bus stop point quantity K minimum;K indicates school bus bus stop The number of point;Indicate that student i stops website C to school busjDistance;CjWebsite Hosting C={ C is stopped for school bus1,C2, C3........CKIn element;R indicates to allow student to affiliated website apart from maximum value;Indicate website CjStudent Number;The total number of persons of N expression student;Indicate whether student i is divided into website CjIn.
In the present embodiment, formula (1-1) indicates that student i stops website C to school busjDistance be less than or equal to apart from maximum value r; Formula (1-2) indicates the number of student of each websiteIt is greater than 1, cannot is 0;Formula (1-3) indicates that bus stop point quantity K is needed Less than or equal to the total number of persons N of student;Formula (1-4), which indicates that the number of each website is added, need to be equal to total number of students N, guarantee each Student is divided into unique website;Formula (1-5) is divided into website C as student ijIn, thenOtherwise it is equal to 0;Formula (1-6) expression requires each student to be intended to be divided into some website.
In the present embodiment, according to the school bus of foundation stop site model, use improved K-means clustering algorithm (with Clustered centered on K point in space) student's family address longitude and latitude is clustered, it ensure that each student to website Distance be respectively less than be equal to it is preset under conditions of maximum value, obtain school bus stop website and student group home site draw Divide information, can effectively reduce the data scale of school bus path planning.
In the present embodiment, using improved K-means algorithm in terms of origin site (i.e. initial cluster center) selection It is improved, the specific steps for obtaining origin site may include:
A1, is arranged a distance threshold r first, which represents student to affiliated website apart from maximum value, obtain student house Front yard address latitude and longitude coordinates composition data collection D;
A2 randomly selects a point C in data set Di, and it is added to set C as a cluster heart, that is, origin site, C={ Ci, and the point is removed in D;
A3 is deleted in D apart from website CiPoint less than or equal to distance threshold r;
A4, if set D is sky, the number of element is K in last set C, and set C is the initial cluster heart of K-means C1,C2......CK
A5 calculates each data in data set and each data is divided into similarity to the similarity between each cluster heart In highest cluster, to each cluster, calculates in cluster the mean value of all the points and using the mean value as the new cluster heart, update the position of the cluster heart It sets;
A6 terminates if preset criterion function convergence Mr. Yu's value or the cluster heart do not change;Otherwise, A5 is jumped to.
In the present embodiment, by step A1-A4, obtains origin site and initial school bus stops the number of website, form K A cluster;Then, each student is assigned to corresponding website nearby, the division of student's group's home site is realized, then in cluster Portion takes mean value, obtains new website, until website does not change, finally obtains last website geographical location and each Raw specific division;The step of its improved K-means, is with reference to figure as shown in Fig. 2, final by improved K-means algorithm Obtain the number of school bus stopped in website and each website by bus.
In the present embodiment, preset criterion function is generally chosen error sum of squares (SSE), and SSE is indicated are as follows:
Wherein, N (Ci) be i-th of cluster class number, xijFor j-th of element of i-th of cluster class, CiIt is then i-th of cluster class Cluster heart coordinate.
In the specific embodiment of aforementioned school bus paths planning method, further, the student family that the basis obtains The latitude and longitude coordinates of front yard address and school address, school bus stop website and the division information of student's group's home site carries out path Planning includes:
The division information of website and student's group's home site is stopped, according to obtained school bus to minimize school bus number and minimum Changing driving of school bus distance is school bus path optimization target, and whether school bus routing problem is detachable according to the student of school bus website, point It can not be split school bus routing problem (School Bus Routing Problem, SBRP) and detachable school bus path for multiple target Problem (Split Demand School Bus Routing Problem, SDSBRP), establishes school bus path planning model;
According to the school bus path planning model of the latitude and longitude coordinates and foundation of student's family address and school address, benefit Multiple target school bus path planning is realized with minimax ant group algorithm.
In the present embodiment, minimax ant group algorithm is used on path planning, obtains the optimization of multi-goal path planning Value.To minimize school bus number and minimize driving of school bus distance as school bus path optimization target in the planning, therefore establishing In terms of school bus path planning model, school bus path planning may be defined as a non-directed graph G=(V, E), in which: V={ 0,1 ... K }, 0 indicates starting point and terminal, and other values are that school bus stops website serial number;E={ (i, j), 0≤i, j≤K } indicate website it Between path.Existing P school bus accesses all K websites from school, and school bus is being no more than bearing capacity and travel distance Under the premise of no more than specified value, rule is selected to select next website according to website, until next website can not be carried When student, school is returned.
In order to simplify the complexity of the school bus path planning model, the structure for being easy to use minimax ant group algorithm to be solved Build, carry out it is assumed hereinafter that:
1. the capacity of each school bus is equal, the maximum number of student that accommodates is set as 40 people.
2. the student of a certain website can reach website when school bus passes through the website and wait.
3. school bus sets out by start site of school, after the website planned, school (terminal) is returned to.
4. the capacity of school bus has delivered payload capability limitation, and carries number and must not exceed dead weight
SBRP problem is whether the demand of school bus website splits with the main distinction that SDSBRP is asked, therefore the two is in model Middle constraint condition is different.
The constraint condition of SBRP problem:
In the constraint condition of above-mentioned SBRP problem, formula (2-1) indicates the contained number of students of every driving of school bus route not More than the maximum capacity C of school bus;Formula (2-2) indicates that each school bus website can only be by a school bus service;Formula (2-3) indicates school bus Website j can only have a school bus service primary;Formula (2-4) indicates that each school bus leaves the number of school bus website cannot be more than 1;Formula (2-5) indicates that school bus from school, is eventually returned to school, forms closed circuit;Formula (2-6) indicates each school bus when driving Between be no more than school bus maximum running time Tmax;Formula (2-7) indicates school bus after some website, and all students of the website are complete Portion gets on the bus, and the meaning of design parameter is shown in Table 1.
The constraint condition of SDSBRP problem:
In the constraint condition of above-mentioned SDSBRP problem, formula (2-8) indicates that the number got on the bus in each school bus website is little In the number of the website;Formula (2-9) indicates that all students of each school bus website can get on the bus;Formula (2-10) indicates every school bus The vehicle-mounted number of students in path is less than or equal to the maximum capacity of school bus;After formula (2-11) indicates that school bus enters school bus website, it is bound to Leave the school bus website;Formula (2-12) indicates that each school bus from school, is eventually returned to school;Formula (2-13) indicates each school The running time that vehicle returns to school, which is less than to wait, is shown in Table 1 with school bus maximum running time, the meaning of design parameter.
1 mathematical model related symbol physical significance explanation of table
Symbol Physical meaning
S Indicate school and Website Hosting by bus.
V Required school bus set after expression path optimization.
C Indicate that single school bus can carry maximum capacity
i,j Indicate school bus website serial number
v Indicate school bus serial number
p Indicate the speed of driving of school bus
Tmax Indicate the maximum duration of driving of school bus
qi Indicate that website i waits number of student
yiv Indicate whether school bus v passes through website i
Wiv Indicate the number got on the bus in school bus website i
Dij Indicate the distance between website i to website j
Qiv Indicate capacity of the school bus v after website i
Qjv Indicate capacity of the school bus v after website j
xijv Indicate vehicle v whether by website i to website j
x0jv Indicate vehicle v whether by starting point/terminal to website j
In the present embodiment, for school bus quantity is minimized, the objective function of minimum school bus quantity is established:
f(x)1=min V
For driving of school bus distance is minimized, the objective function for minimizing driving of school bus distance is established:
Above-mentioned multiple objective function is converted by single-goal function using linear programming, obtains the school bus path planning mould The objective function of type indicates are as follows:
Wherein, fpathIndicate the objective function of school bus path planning model, DijIndicate the distance between website i to website j, xijvIndicate vehicle v whether by website i to website j, x0jvIndicate vehicle v whether by starting point/terminal to website j.
In the present embodiment, xijvIt indicates are as follows:
In the specific embodiment of aforementioned school bus paths planning method, further, according to student's family address with And school address latitude and longitude coordinates and foundation school bus path planning model, utilize minimax ant group algorithm to realize more mesh After calibration vehicle path planning, the method also includes:
In the region that each path is formed, the website number of all public transport is counted;
Acquisition station counts most public transport as target public transport, and the target public transport picks student for replacing school bus.
In the present embodiment, after being realized after multiple target school bus path planning using minimax ant group algorithm, may be used also To replace school bus to pick student using bus.In order to which each path selects most suitable public transport, i.e. student has been picked in public transport After can faster and more easily return to bus routes, the strategy of selection are as follows: Amap API can be called, in each path shape At region in, count the website number of all public transport and be ranked up according to website number, public transport that acquisition station is counted most is used Student is picked to replace school bus.
To sum up, the embodiment of the present invention proposes to solve the strategy of extensive school bus path planning, thus by large-scale school bus Routing problem is converted into small-scale school bus path planning problem, using the strategy of first cluster rear path planning.The strategy can Effectively reduce the data scale of school bus path planning, and consider simultaneously without departing from defined student to affiliated website it is maximum away from From under conditions of carry out website selection, student group home site division and under multiple target school bus traffic route planning, It can help education department's design low cost, practicable school bus route.
Embodiment two
The present invention also provides a kind of specific embodiments of school bus path planning apparatus, due to school bus road provided by the invention Diameter device for planning is corresponding with the specific embodiment of aforementioned school bus paths planning method, which can lead to It crosses the process step executed in above method specific embodiment to achieve the object of the present invention, therefore above-mentioned school bus path planning Explanation in method specific embodiment is also applied for the specific embodiment party of school bus path planning apparatus provided by the invention Formula will not be described in great detail in present invention specific embodiment below.
As shown in figure 3, the embodiment of the present invention also provides a kind of school bus path planning apparatus, comprising:
Module 11 is obtained, for obtaining the latitude and longitude coordinates in student's family address and school address;
Module 12 is established, most for the distance according to student to website apart from desired value and each student to affiliated website Big value establishes school bus and stops site model;
Cluster module 13 gathers student's family address longitude and latitude for stopping site model according to the school bus of foundation Class obtains the division information that school bus stops website and student's group's home site;
Planning module 14, for being stopped according to the latitude and longitude coordinates in obtained student's family address and school address, school bus Division information by website and student's group's home site carries out path planning.
School bus path planning apparatus described in the embodiment of the present invention obtains the longitude and latitude of student's family address and school address Spend coordinate;According to student to website apart from desired value and each student to affiliated website apart from maximum value, establish school bus and stop By site model;Site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, school bus is obtained and stops By the division information of website and student's group's home site;It is sat according to the longitude and latitude in obtained student's family address and school address Mark, school bus stop website and the division information of student's group's home site carries out path planning;In this way, using laggard walking along the street is first clustered The strategy of diameter planning carries out multiple target school bus path planning on the basis of obtaining reasonable school bus and stopping website, thus by extensive School bus routing problem be converted into small-scale school bus path planning problem, can effectively reduce the data of school bus path planning Scale.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation In any actual relationship or order or sequence.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art For, without departing from the principles of the present invention, several improvements and modifications can also be made, these improvements and modifications It should be regarded as protection scope of the present invention.

Claims (9)

1. a kind of school bus paths planning method characterized by comprising
Obtain the latitude and longitude coordinates of student's family address and school address;
According to student to website apart from desired value and each student to affiliated website apart from maximum value, establish school bus bus stop Point model;
Site model is stopped according to the school bus of foundation, student's family address longitude and latitude is clustered, school bus is obtained and stops website With the division information of student's group's home site;
Website and student's group's ownership station are stopped according to the latitude and longitude coordinates in obtained student's family address and school address, school bus The division information of point carries out path planning.
2. school bus paths planning method according to claim 1, which is characterized in that obtaining student's family address and Before the latitude and longitude coordinates of school address, the method also includes:
Obtain student's family address and school address;
First time data cleansing is carried out to the student's family address and school address, wherein the first time data cleansing Include: duplicate removal, remove missing values;
By after cleaning student's family address and school address be converted into corresponding latitude and longitude coordinates.
3. school bus paths planning method according to claim 1, which is characterized in that obtaining student's family address and After the latitude and longitude coordinates of school address, the method also includes:
The latitude and longitude coordinates in student's family address and school address to acquisition carry out second of data cleansing, wherein described Second of data cleansing includes: the cleaning of noise data, the cleaning of assigning null data, the cleaning of invalid data and customized cleaning.
4. school bus paths planning method according to claim 1, which is characterized in that the school bus stops the mesh of site model Scalar functions: fs=min (K);
Constraint condition:
1≤K≤N
Wherein, fs=min (K) indicates that optimization aim is to keep school bus bus stop point quantity K minimum;K indicates that school bus stops of website Number;Indicate that student i stops website C to school busjDistance;CjWebsite Hosting C={ C is stopped for school bus1,C2, C3........CKIn element;R indicates to allow student to affiliated website apart from maximum value;Indicate website CjStudent Number;The total number of persons of N expression student;Indicate whether student i is divided into website CjIn.
5. school bus paths planning method according to claim 1, which is characterized in that the school bus bus stop according to foundation Point model clusters student's family address longitude and latitude, obtains the division letter that school bus stops website and student's group's home site Breath includes:
S1, setting allow student, apart from maximum value r, to obtain student's family address latitude and longitude coordinates composition data to affiliated website Collect D;
S2 randomly selects a point C in data set Di, and it is added to set C, C=as a cluster heart, that is, origin site {Ci, and point C is removed in Di
S3 is deleted in D apart from website CiLess than or equal to the point apart from maximum value r;
S4 jumps to S2 if set D is not sky;If set D is sky, set C is initial cluster heart C1,C2......CK
S5 calculates each data in data set and each data is divided into similarity highest to the similarity between each cluster heart Cluster in, to each cluster, calculate in cluster the mean value of all the points and using the mean value as the new cluster heart, update the position of the cluster heart;
S6 terminates if preset criterion function convergence Mr. Yu's value or the cluster heart do not change;Otherwise, S5 is jumped to.
6. school bus paths planning method according to claim 1, which is characterized in that the student's family that the basis obtains is lived The latitude and longitude coordinates of location and school address, school bus stop website and the division information of student's group's home site carries out path planning Include:
The division information of website and student's group's home site is stopped, according to obtained school bus to minimize school bus number and minimize school Vehicle operating range is school bus path optimization target, establishes school bus path planning model;
According to the school bus path planning model of the latitude and longitude coordinates and foundation of student's family address and school address, using most Big minimum ant group algorithm realizes multiple target school bus path planning.
7. school bus paths planning method according to claim 6, which is characterized in that the mesh of the school bus path planning model Scalar functions indicate are as follows:
Wherein, fpathIndicate the objective function of school bus path planning model, DijIndicate the distance between website i to website j, xijv Indicate vehicle v whether by website i to website j, x0jvIndicate vehicle v whether by starting point/terminal to website j.
8. school bus paths planning method according to claim 1, which is characterized in that according to student's family address and The latitude and longitude coordinates of school address and the school bus path planning model of foundation realize multiple target school using minimax ant group algorithm After vehicle path planning, the method also includes:
In the region that each path is formed, the website number of all public transport is counted;
Acquisition station counts most public transport as target public transport, and the target public transport picks student for replacing school bus.
9. a kind of school bus path planning apparatus characterized by comprising
Module is obtained, for obtaining the latitude and longitude coordinates in student's family address and school address;
Establish module, for according to student to website apart from desired value and each student to affiliated website apart from maximum value, It establishes school bus and stops site model;
Cluster module clusters student's family address longitude and latitude, obtains for stopping site model according to the school bus of foundation School bus stops the division information of website and student's group's home site;
Planning module, for stopping website according to the latitude and longitude coordinates in obtained student's family address and school address, school bus Path planning is carried out with the division information of student's group's home site.
CN201910000533.2A 2019-01-02 2019-01-02 A kind of school bus paths planning method and device for planning Pending CN109764884A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910000533.2A CN109764884A (en) 2019-01-02 2019-01-02 A kind of school bus paths planning method and device for planning

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910000533.2A CN109764884A (en) 2019-01-02 2019-01-02 A kind of school bus paths planning method and device for planning

Publications (1)

Publication Number Publication Date
CN109764884A true CN109764884A (en) 2019-05-17

Family

ID=66453324

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910000533.2A Pending CN109764884A (en) 2019-01-02 2019-01-02 A kind of school bus paths planning method and device for planning

Country Status (1)

Country Link
CN (1) CN109764884A (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119150A (en) * 2019-05-22 2019-08-13 电子科技大学 A kind of multi-user's real-time route method and system for planning based on ant group algorithm
CN110175717A (en) * 2019-05-28 2019-08-27 安徽中科爱电新能源科技有限公司 A kind of enterprise's regular bus management system
CN110472813A (en) * 2019-06-24 2019-11-19 广东浤鑫信息科技有限公司 A kind of school bus website self-adapting regulation method and system
CN110555473A (en) * 2019-08-28 2019-12-10 海南纽康信息系统有限公司 Driving route planning method, server and system
CN110689180A (en) * 2019-09-18 2020-01-14 科大国创软件股份有限公司 Intelligent route planning method and system based on geographic position
CN111127284A (en) * 2019-11-11 2020-05-08 阿里巴巴集团控股有限公司 Site selection method, recommendation method, equipment and storage medium for traffic stop station
CN111242697A (en) * 2020-01-20 2020-06-05 重庆邮电大学 Merchant site selection method and system based on pollination heuristic clustering
CN111366160A (en) * 2020-05-25 2020-07-03 深圳市城市交通规划设计研究中心股份有限公司 Path planning method, path planning device and terminal equipment
CN111461403A (en) * 2020-03-06 2020-07-28 上海汽车集团股份有限公司 Vehicle path planning method and device, computer readable storage medium and terminal
CN111947675A (en) * 2020-07-31 2020-11-17 新石器慧通(北京)科技有限公司 Man-vehicle mutual searching method and device based on unmanned tour guide vehicle and electronic equipment
CN114092176A (en) * 2021-10-27 2022-02-25 北京科技大学 Urban commuting regular bus planning method based on bus
CN118133405A (en) * 2024-05-06 2024-06-04 深圳市城市交通规划设计研究中心股份有限公司 Spatial layout design method suitable for receiving students in front of school gate

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110217947A1 (en) * 2010-03-04 2011-09-08 Ipcomm Llc Mobile Femto-cell in a Wireless Safety Network
CN103646540A (en) * 2013-12-03 2014-03-19 浙江工业大学 School bus driving route, direction and station arriving and leaving automatic identification method
CN105427001A (en) * 2015-12-03 2016-03-23 北京理工大学 Optimal route of school bus of regional middle and primary school
CN106530677A (en) * 2016-11-16 2017-03-22 武汉理工大学 School bus scheduling method and system based on real-time information
CN106709833A (en) * 2017-01-09 2017-05-24 大连大学 School bus path optimization method based on big data
CN107330559A (en) * 2017-07-03 2017-11-07 华南理工大学 A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110217947A1 (en) * 2010-03-04 2011-09-08 Ipcomm Llc Mobile Femto-cell in a Wireless Safety Network
CN103646540A (en) * 2013-12-03 2014-03-19 浙江工业大学 School bus driving route, direction and station arriving and leaving automatic identification method
CN105427001A (en) * 2015-12-03 2016-03-23 北京理工大学 Optimal route of school bus of regional middle and primary school
CN106530677A (en) * 2016-11-16 2017-03-22 武汉理工大学 School bus scheduling method and system based on real-time information
CN106709833A (en) * 2017-01-09 2017-05-24 大连大学 School bus path optimization method based on big data
CN107330559A (en) * 2017-07-03 2017-11-07 华南理工大学 A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
党兰学等: "校车路径问题模型及算法研究进展", 《河南大学学报》 *
张富,朱泰英: "校车站点及线路的优化设计", 《数学的实践与认识》 *
陈小潘等: "需求可拆分校车路径问题的元启发式算法", 《计算机科学》 *
高选幸等: "校车的线路选择及优化设计方法", 《计算机工程与应用》 *

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119150A (en) * 2019-05-22 2019-08-13 电子科技大学 A kind of multi-user's real-time route method and system for planning based on ant group algorithm
CN110175717A (en) * 2019-05-28 2019-08-27 安徽中科爱电新能源科技有限公司 A kind of enterprise's regular bus management system
CN110472813A (en) * 2019-06-24 2019-11-19 广东浤鑫信息科技有限公司 A kind of school bus website self-adapting regulation method and system
CN110472813B (en) * 2019-06-24 2023-12-22 广东浤鑫信息科技有限公司 Self-adaptive adjustment method and system for school bus station
CN110555473A (en) * 2019-08-28 2019-12-10 海南纽康信息系统有限公司 Driving route planning method, server and system
CN110689180A (en) * 2019-09-18 2020-01-14 科大国创软件股份有限公司 Intelligent route planning method and system based on geographic position
CN111127284B (en) * 2019-11-11 2023-06-20 阿里巴巴集团控股有限公司 Address selection method, recommendation method, device and storage medium for traffic stop sites
CN111127284A (en) * 2019-11-11 2020-05-08 阿里巴巴集团控股有限公司 Site selection method, recommendation method, equipment and storage medium for traffic stop station
CN111242697A (en) * 2020-01-20 2020-06-05 重庆邮电大学 Merchant site selection method and system based on pollination heuristic clustering
CN111461403A (en) * 2020-03-06 2020-07-28 上海汽车集团股份有限公司 Vehicle path planning method and device, computer readable storage medium and terminal
CN111461403B (en) * 2020-03-06 2023-09-29 上海汽车集团股份有限公司 Vehicle path planning method and device, computer readable storage medium and terminal
CN111366160A (en) * 2020-05-25 2020-07-03 深圳市城市交通规划设计研究中心股份有限公司 Path planning method, path planning device and terminal equipment
CN111366160B (en) * 2020-05-25 2020-10-27 深圳市城市交通规划设计研究中心股份有限公司 Path planning method, path planning device and terminal equipment
CN111947675A (en) * 2020-07-31 2020-11-17 新石器慧通(北京)科技有限公司 Man-vehicle mutual searching method and device based on unmanned tour guide vehicle and electronic equipment
CN114092176A (en) * 2021-10-27 2022-02-25 北京科技大学 Urban commuting regular bus planning method based on bus
CN118133405A (en) * 2024-05-06 2024-06-04 深圳市城市交通规划设计研究中心股份有限公司 Spatial layout design method suitable for receiving students in front of school gate
CN118133405B (en) * 2024-05-06 2024-10-01 深圳市城市交通规划设计研究中心股份有限公司 Spatial layout design method suitable for receiving students in front of school gate

Similar Documents

Publication Publication Date Title
CN109764884A (en) A kind of school bus paths planning method and device for planning
CN106909692B (en) Method for calculating urban public facility coverage radiation index
CN106327865B (en) A kind of urban transportation reliability index and its implementation based on Analysis of The Seepage
CN105679009B (en) A kind of call a taxi/order POI commending systems and method excavated based on GPS data from taxi
CN107241512A (en) Intercity Transportation trip mode determination methods and equipment based on data in mobile phone
CN103049829B (en) Integrated fusion method of urban and rural passenger line network and hub station
CN106127357A (en) A kind of customization public transport automatic routing system based on reservation data and method
CN107291888A (en) Life commending system method near hotel is moved in based on machine learning statistical model
CN102637358A (en) Citizen-satisfaction-based public bicycle service system and scheduling and dispatching method
CN109299438A (en) A kind of public transit facility supply level evaluation method based on net about car data
CN104794663A (en) Automatic itinerary generation system and method
CN106708837B (en) Interest point searching method and device
CN201689419U (en) Intelligent real-time travel route system
CN110134865A (en) A kind of commuting passenger's social recommendation method and platform based on urban public transport trip big data
CN105427001A (en) Optimal route of school bus of regional middle and primary school
CN105227618A (en) A kind of communication site's position information processing method and system
CN114092176A (en) Urban commuting regular bus planning method based on bus
Adetunji et al. Spatial distribution, pattern and accessibility of urban population to health facilities in southwestern Nigeria: the case study of Ilesa
CN103106557A (en) Management system and management method of school bicycles based on Internet of things
CN109493601B (en) Bus branch line setting method
CN104596534B (en) A kind of method for calculating optimal planning driving path
Zhou et al. Village-town system in suburban areas based on cellphone signaling mining and network hierarchy structure analysis
CN116539046B (en) Information release method and device for smart campus, server and storage medium
JP2022168523A (en) computer system
CN206546634U (en) Urban Traffic Flow Guidance Systems based on Internet of Things

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20190517

RJ01 Rejection of invention patent application after publication