CN110245774A - A method of regular service route optimization is carried out according to employee's home address - Google Patents
A method of regular service route optimization is carried out according to employee's home address Download PDFInfo
- Publication number
- CN110245774A CN110245774A CN201910261103.6A CN201910261103A CN110245774A CN 110245774 A CN110245774 A CN 110245774A CN 201910261103 A CN201910261103 A CN 201910261103A CN 110245774 A CN110245774 A CN 110245774A
- Authority
- CN
- China
- Prior art keywords
- website
- home address
- bus
- employee
- regular
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of methods for carrying out regular service route optimization according to employee's home address, include the following steps: data acquisition, information processing, select ride website, optimization website, calculating riding route by bus, the present invention optimizes boarding station point by using limited clustering algorithm, greatly reduce the interference in layout of roads, the time in operation is greatly saved, the computational efficiency of route selection is improved, the calculating time can achieve second grade.
Description
Technical field
The present invention relates to field of traffic, and in particular to a kind of method that employee's home address carries out regular service route optimization.
Background technique
With the fast development in city, urban population is increased rapidly, big city, people especially as Beijing, Shanghai
The problem of mouth increases a large amount of growths of bring private car quantity, exacerbates traffic congestion and environmental pollution.Current regular bus fortune
The problem of battalion's system can give full play to the effect of urban public transport, and traffic congestion and environmental pollution is effectively relieved.But it is existing
Regular bus be all that quotient is schemed using Gao De or Baidu map etc., since the path planning that Gao De or Baidu map etc. can be done is clear
Path planning is done after beginning and end, there are significant limitations, and be not particularly suited for above-mentioned scene.
Summary of the invention
The purpose of the present invention is to provide a kind of methods that optimization employee's home address carries out regular service route.
The technical scheme is that a kind of method that regular service route optimization is carried out according to employee's home address, including such as
Lower step:
Data acquisition: step 1 collects the home address of several employees and the address of company, obtains the road of objective area
Network data, the road net data include central node information, the road-net node information of regular bus approach, regular bus vehicle that regular bus is parked
Information and driver information；
Step 2, information processing: by step 1 home address and CompanyAddress be converted into longitude and latitude；
Step 3 selects website of riding: being passed through based on limited clustering algorithm by trip qualifications combination road net data
Calculate several websites of riding for meeting trip qualifications；
Step 4: optimize website of riding: based on trip optimal conditions combination road net data in the calculated result of step 3
Calculate several the optimal websites by bus for meeting trip optimal conditions；
Step 5 calculates riding route: by layout of roads depth network, i.e., the base of optimal website by bus in step 4
By an optimal traffic route of the pointer depth network planning on plinth, the longitude and latitude of website is mapped to network by pointer depth network
Input, and estimate the probability distribution of next website, optimal vehicle running path obtained by probability distribution, so that vehicle
Mileage travelled is minimum, and the vehicle number needed is minimum.
Further technical solution, qualifications of specifically going on a journey in step 3: to home address, CompanyAddress apart from website
The restriction of distance.
Further technical solution, optimal conditions of specifically going on a journey in step 4: when to regular bus total kilometres, total travel
Between, the restriction of regular bus attendance.
Beneficial effects of the present invention:
1, the algorithm that the present invention uses reduces the possibility in layout of roads by carrying out selection optimization to boarding station point
Property, the time in operation is greatly saved, improves the computational efficiency of route selection, the calculating time can achieve second grade.
2, the present invention can apply in many different fields, can require for conditions such as employee's registration leaving office to route
It is adjusted in time, or to extensive provisional overtime work task, interim production line such as is needed for manufacturing type enterprise
Overtime work causes provisional use vehicle demand, provides efficiently quick method as overtime work crowd and provides layout of roads and vehicle fleet size side
Case.
Detailed description of the invention
Fig. 1 is the flow diagram of optimization method of the present invention,
Fig. 2 is the calculated result in the embodiment of the present invention one in step 3,
Fig. 3 is the calculated result in the embodiment of the present invention one in step 4,
Fig. 4 is the calculated result in the embodiment of the present invention one in step 5.
Specific embodiment
Below by non-limiting embodiment, the present invention is further explained, understands the present invention.
Such as Fig. 1, the present invention is a kind of method for carrying out regular service route optimization according to employee's home address, including is walked as follows
It is rapid:
Data acquisition: step 1 collects the home address of several employees and the address of company, obtains the road of objective area
Network data, the road net data include central node information, the road-net node information of regular bus approach, regular bus vehicle that regular bus is parked
Information and driver information；
Step 2, information processing: by step 1 home address and CompanyAddress be converted into longitude and latitude；
Step 3 selects website of riding: being passed through based on limited clustering algorithm by trip qualifications combination road net data
Calculate several websites of riding for meeting trip qualifications；
Step 4: optimize website of riding: based on trip optimal conditions combination road net data in the calculated result of step 3
Calculate several the optimal websites by bus for meeting trip optimal conditions；
Step 5 calculates riding route: by layout of roads depth network, i.e., the base of optimal website by bus in step 4
By the way that the longitude and latitude of website to be mapped to the input of network on plinth, and the probability distribution of next website is estimated, passes through probability
Distribution obtains optimal vehicle running path, so that VMT Vehicle-Miles of Travel is minimum, and the vehicle number needed is minimum.
Embodiment one, a kind of method that regular service route optimization is carried out according to employee's home address provided according to invention, into
The calculating of walking along the street line, includes the following steps:
Data acquisition: step 1 collects the home address of employee and the address of company, obtains the road network number of objective area
According to the road net data includes central node information, the road-net node information of regular bus approach, regular bus vehicle model information that regular bus is parked
And driver information；
Step 2, information processing: by step 1 home address and CompanyAddress be converted into longitude and latitude；
Step 3 selects website of riding: being passed through based on limited clustering algorithm by trip qualifications combination road net data
Calculate several websites of riding for meeting trip qualifications；
This step to solve the problems, such as to make for selection regular bus website website lose time and all user's travel times it
And minimum.Specific trip qualifications: home address and CompanyAddress are no more than 800 meters apart from website distance, guarantee under user
Maximum 800 meters of travel distance after vehicle；And: assuming that regular bus starting and brake can lose 60 seconds in a website, under each user
Vehicle needs 5 seconds, user's walking speed 3.9km/h；Then, such as Fig. 2, can be made by the latitude and longitude coordinates of employee's home address
With limited clustering algorithm, the algorithm for meeting the website of qualification is found out；
Step 4 optimizes website of riding: based on trip optimal conditions combination road net data in the calculated result of step 3
Calculate several the optimal websites by bus for meeting trip optimal conditions；
This step will solve the problems, such as that optimization route is no more than every route runing time x hours and passes through institute
There is the sum of website runing time minimum.Specific trip optimal conditions: regular bus total kilometres are less than 30 kilometers, every regular bus line
The road longest run time 60 minutes, regular bus seating capacity was 38, and regular bus attendance is no more than 80%, and when regular bus highest average
Fast 20km/h；Thus it is possible to calculated result is obtained by limited clustering algorithm, i.e., what big square as shown in Figure 3 represented
The website cooked up；
Step 5 calculates riding route: optimal vehicle running path is obtained by layout of roads depth network, so that vehicle
Mileage travelled is minimum, and the vehicle number needed is minimum；Thus it is possible to be obtained by layout of roads depth network as Fig. 4 is optimal
Vehicle running path so that VMT Vehicle-Miles of Travel is minimum, and vehicle number is minimum.
In conclusion substantially increasing computational efficiency using algorithm provided by the invention calculating, exhibition is shown for attached drawing 3
16 websites the case where, only need can calculate result within 2 seconds using algorithm operation of the invention.In theoretical operation, 16
It is the factorial kind possibility for having 16 that a website, which carries out layout of roads, 16！=20,922,789,888,000, using its existing other party
If method, it is extremely difficult to the computational efficiency of second grade.
Claims (3)
1. a kind of method for carrying out regular service route optimization according to employee's home address, which comprises the steps of:
Data acquisition: step 1 collects the home address of several employees and the address of company, obtains the road network number of objective area
According to the road net data includes central node information, the road-net node information of regular bus approach, regular bus vehicle model information that regular bus is parked
And driver information；
Step 2, information processing: by step 1 home address and CompanyAddress be converted into longitude and latitude；
Step 3 selects website of riding: being calculated based on trip qualifications combination road net data by limited clustering algorithm
Meet several websites of riding of trip qualifications；
Step 4: optimize website of riding: being calculated in the calculated result of step 3 based on trip optimal conditions combination road net data
Meet several optimal websites by bus of trip optimal conditions out；
Step 5 calculates riding route: by layout of roads depth network, i.e., in step 4 on the basis of optimal website by bus
By the way that the longitude and latitude of website to be mapped to the input of network, and the probability distribution of next website is estimated, passes through probability distribution
Optimal vehicle running path is obtained, so that VMT Vehicle-Miles of Travel is minimum, and the vehicle number needed is minimum.
2. a kind of method for carrying out regular service route optimization according to employee's home address according to claim 1, feature exist
In qualifications of specifically going on a journey in step 3: the restriction to home address, CompanyAddress apart from website distance.
3. a kind of method for carrying out regular service route optimization according to employee's home address according to claim 1, feature exist
In optimal conditions of specifically going on a journey in step 4: the restriction to regular bus total kilometres, overall travel time, regular bus attendance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910261103.6A CN110245774A (en) | 2019-04-02 | 2019-04-02 | A method of regular service route optimization is carried out according to employee's home address |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910261103.6A CN110245774A (en) | 2019-04-02 | 2019-04-02 | A method of regular service route optimization is carried out according to employee's home address |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110245774A true CN110245774A (en) | 2019-09-17 |
Family
ID=67883149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910261103.6A Pending CN110245774A (en) | 2019-04-02 | 2019-04-02 | A method of regular service route optimization is carried out according to employee's home address |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110245774A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112580909A (en) * | 2019-09-29 | 2021-03-30 | 珠海格力电器股份有限公司 | Dynamic regular bus arrangement method, computer readable storage medium and terminal |
| CN113627680A (en) * | 2021-08-23 | 2021-11-09 | 武汉乐道物流有限公司 | Intelligent regular bus interaction method and device, electronic equipment and storage medium |
| CN115034522A (en) * | 2022-08-10 | 2022-09-09 | 深圳市四格互联信息技术有限公司 | Dynamic dispatching method for commuting regular bus based on employee off-duty time and off-duty station |
-
2019
- 2019-04-02 CN CN201910261103.6A patent/CN110245774A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112580909A (en) * | 2019-09-29 | 2021-03-30 | 珠海格力电器股份有限公司 | Dynamic regular bus arrangement method, computer readable storage medium and terminal |
| CN113627680A (en) * | 2021-08-23 | 2021-11-09 | 武汉乐道物流有限公司 | Intelligent regular bus interaction method and device, electronic equipment and storage medium |
| CN113627680B (en) * | 2021-08-23 | 2024-04-05 | 武汉乐道物流有限公司 | Intelligent bus interaction method and device, electronic equipment and storage medium |
| CN115034522A (en) * | 2022-08-10 | 2022-09-09 | 深圳市四格互联信息技术有限公司 | Dynamic dispatching method for commuting regular bus based on employee off-duty time and off-duty station |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Frade et al. | Bicycle sharing systems demand | |
| CN107316098B (en) | Automobile leasing point addressing method based on user behavior analysis | |
| CN105674995A (en) | Method for acquiring commuting route based on user's travel locus, and apparatus thereof | |
| Zamir et al. | Effects of transit-oriented development on trip generation, distribution, and mode share in Washington, DC, and Baltimore, Maryland | |
| CN104881710A (en) | Urban express delivering method based on vehicle self-organized network | |
| CN108388970B (en) | Bus station site selection method based on GIS | |
| Chakrabartty et al. | Traffic congestion in the metropolitan City of Kolkata | |
| CN110288198B (en) | Method for measuring bearing capacity of rental bicycle transportation facility based on traffic subareas | |
| CN110245774A (en) | A method of regular service route optimization is carried out according to employee's home address | |
| CN105303854A (en) | Travel route data processing method and device | |
| CN113554353B (en) | Public bicycle space scheduling optimization method capable of avoiding space accumulation | |
| CN106373384B (en) | Outlying district regular bus circuit Real-time Generation | |
| CN112036757A (en) | Parking transfer parking lot site selection method based on mobile phone signaling and floating car data | |
| CN114358386A (en) | Double-trip-mode ride-sharing site generation method based on reserved trip demand | |
| CN114141008A (en) | Novel shared public transportation service area selection method based on mobile phone signaling data | |
| Piatkowski et al. | ‘New’versus ‘Old’Urbanism: A comparative analysis of travel behavior in large-scale New Urbanist communities and older, more established neighborhoods in Denver, Colorado | |
| Xie et al. | A solution for the last mile problem of the Beijing rapid transit network: Local shuttle bus system | |
| Faye | Modernization and/or sustainable transportation system in Dakar: identification of problems and mode requirements | |
| Ng et al. | The development of model estimation to determine parking needs at LRT stations in suburban area | |
| Subramani | Cost Estimation and Identification of Transport Infrastructure facility Projects in Salem | |
| Ajayi et al. | Mapping and assessment of traffic congestion on major roads in Minna (case study of Chanchaga LGA). | |
| Li et al. | The Integration of Public Bicycle and Metro Transit: A Case Study in Suzhou, China | |
| Vergara et al. | Site Selection for New Point to Point (P2P) Bus Endpoints and Routes in Metro Manila, Philippines | |
| Altintasi et al. | Siting E-Scooter Charging Stations and Identifying Safe and Convenient Routes for Environmentally Sustainable E-Scooter Systems | |
| Li et al. | Parking by the bay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190917 |
|
| WD01 | Invention patent application deemed withdrawn after publication |