CN110333715B - Luggage taking and delivering method for sharing luggage gathering place - Google Patents
Luggage taking and delivering method for sharing luggage gathering place Download PDFInfo
- Publication number
- CN110333715B CN110333715B CN201910293975.0A CN201910293975A CN110333715B CN 110333715 B CN110333715 B CN 110333715B CN 201910293975 A CN201910293975 A CN 201910293975A CN 110333715 B CN110333715 B CN 110333715B
- Authority
- CN
- China
- Prior art keywords
- baggage
- luggage
- extraction
- location
- target road
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 16
- 238000000605 extraction Methods 0.000 claims description 59
- 238000009825 accumulation Methods 0.000 claims description 9
- 238000004220 aggregation Methods 0.000 claims description 4
- 230000002776 aggregation Effects 0.000 claims description 4
- 238000002360 preparation method Methods 0.000 claims 1
- 238000004904 shortening Methods 0.000 abstract description 2
- 230000009975 flexible effect Effects 0.000 description 4
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000001351 cycling effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3438—Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0223—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving speed control of the vehicle
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method for taking and delivering luggage by sharing a luggage gathering place, which aims at the blank in the prior art. The invention sets a luggage gathering place between the luggage picking place and the luggage delivery place in the luggage picking and delivering order in the luggage picking and delivering system, a plurality of luggage picking places share one luggage gathering place, an access sequence is set for the plurality of luggage picking places sharing the luggage gathering place, the luggage at the plurality of luggage picking places is conveyed to the common luggage gathering place according to the access sequence, and then the luggage gathered at the luggage gathering place is conveyed to the luggage delivery place by a transport tool, thereby overcoming the problems of urban road traffic setting and road conditions which are unfavorable for large transport tools in reality, more flexibly and efficiently realizing the fetching and delivering of the luggage, and being a luggage fetching and delivering method for improving the luggage fetching and delivering efficiency and shortening the luggage fetching and delivering time.
Description
Technical Field
The invention relates to a baggage picking and delivering method for sharing a baggage gathering place, in particular to a baggage picking and delivering method capable of improving baggage picking efficiency and shortening baggage picking time.
Background
Luggage has been a troublesome problem on travel, particularly for travelers who are carrying their luggage. Even today with very developed traffic, there is still a distance from airports, high-speed rail stations to hotels or homes, especially in off-site locations, public transportation is often required between landing points to airports or high-speed rail stations, and if a lot of luggage is carried, plus the need to take care of the elderly and children, the embarrassment is often lost, and some travelers can only spend expensive taxi or use hotel pick-up services to avoid embarrassment on the journey. How to economically and rapidly solve the problem of troublesome luggage in the traveling process has important significance for improving the traveling experience of people and the traveling quality.
At present, a method special for taking and delivering luggage is not available, and the scheduling method is provided, so that the blank of the field of luggage taking and delivering scheduling can be filled, the efficiency and the economy of a luggage taking and delivering system can be improved, and the method has great significance for improving the life quality of people; further, since most routes of the baggage handling system employ large transportation vehicles such as automobiles for baggage handling, and since actual conditions of roads are complicated, especially urban roads, there are complicated traffic settings such as restricted traffic, unidirectional traffic, forbidden traffic, etc., or narrow or rugged roads that large automobiles cannot reach, a more flexible and efficient baggage handling method is required.
Disclosure of Invention
The invention provides a method for taking and delivering luggage, which aims at the blank in the prior art and improves the efficiency of taking and delivering luggage and shortens the time of taking and delivering luggage. According to the invention, the luggage gathering place is arranged between the luggage picking place and the luggage delivery place in the luggage picking order in the luggage picking system, the plurality of luggage picking places share one luggage gathering place, the visiting sequence is set for the plurality of luggage picking places sharing the luggage gathering place, the luggage at the plurality of luggage picking places is conveyed to the shared luggage gathering place according to the visiting sequence, and then the luggage gathered at the luggage gathering place is conveyed to the luggage delivery place by the transportation tool, so that the problem that urban road traffic arrangement and road conditions are unfavorable for large transportation tools in reality is overcome, and the luggage picking is more flexibly and efficiently realized.
The invention is realized by the following technical scheme:
a method for sharing the luggage collecting place includes such steps as providing a luggage collecting place between the luggage collecting place and the luggage delivering place in the order, sharing a luggage collecting place by multiple luggage collecting places, setting the visiting order for said luggage collecting places, delivering the luggage to the luggage collecting place by the delivering tool, and delivering the luggage to the luggage delivering place.
Further, the baggage aggregation location is determined according to the following steps:
2.1 all baggage claim locations are n, for all n baggage claim locations, the number of its neighbor baggage claim locations is calculated: for one baggage pickup location b, if x other baggage pickup locations exist within the range of the arrival time of the baggage pickup location b within t, the number of neighbor baggage pickup locations of b is x; the time of arrival is an estimate, using distance and vehicle speed, currently read using the interface of the navigation software pair, such as hundredths, height. Since the setting of the baggage gathering points sometimes considers that some roads are not suitable for large vehicles to enter, more flexible vehicles such as electric vehicles, bicycles and the like are generally needed, and under the situation, the number of the neighbor baggage picking points can be determined by the relationship between the riding time and t.
Sorting all n baggage extraction sites according to the number of the neighbor baggage extraction sites from more to less and putting the n baggage extraction sites into a baggage extraction site set Q;
2.2 putting the baggage extraction site with the largest number of neighbor baggage extraction sites in the group M of the baggage extraction sites, and taking all the baggage extraction sites with the arrival time within t from the group Q; repeating the steps, specifically: finding one of the extraction places with the largest number of neighbors from the extraction places left after the previous elimination, putting the extraction place in M, and eliminating Q from the extraction places within the reaching time t of the extraction places until all the luggage extraction places in Q are eliminated;
2.3 for each baggage extraction location M in the set M, adding M and all baggage extraction locations within t of its arrival time to the set Nm. yields | M | sets: m is the number of elements in the set, since each element M inside M corresponds to a Nm, there are M sets of N
For each set Nm, drawing a minimum rectangle Rm which can cover all luggage extraction sites in the Nm on the map; dividing all roads into d meters in each rectangle Rm, wherein all the roads refer to all the roads which can pass through, and adding longitude and latitude coordinates of a middle point of each road into a candidate position set U; and calculating the average arrival time of U to all baggage pickup positions in the rectangular range of the position U, namely the middle point of each road section, and selecting U with the minimum average arrival time as the position of the baggage gathering point in the rectangle.
Further, the step of setting the access order for a plurality of baggage claim sites sharing one baggage aggregation site is:
3.1 putting a road section where a point closest to each luggage extraction point in all passable roads is located as a target section into a target section set; the road section is determined according to the following modes: and 1/2d meters are respectively expanded to two sides by taking the point closest to each luggage extraction point as a center to form a road section. d is set differently according to different vehicles, for example, the bicycle is set to 200 meters; walking is set to 50 meters.
3.2 if continuous target road sections exist, combining the continuous target road sections into one target road section, and updating the required arrival time of the road sections into an earlier required arrival time; continuous means that two segments are just joined, or have repeated portions; if not, entering step 3.3;
3.3 adding the target road section with the shortest arrival time away from the luggage gathering point into the planned route;
3.4, calculating indexes R between all target road sections which are not added into the planned route and the target road sections which are added into the planned route in the previous step:
r is Tr-Ta, wherein Tr is the required arrival time of the luggage extraction place corresponding to the road section, and Ta is the estimated time of arriving at the luggage extraction place; the required arrival time is a required arrival time in a baggage picking order submitted by a customer.
3.5, sequentially adding the target road sections which have the minimum index R from the previous added target road section and are not extracted from the corresponding luggage into the planned route until all the target road sections are added into the planned route; and visiting the baggage extraction places corresponding to each planned route according to the sequence of joining the planned routes, thereby determining the visiting sequence. Since the roads selected as the target road segments in 3.1 are roads where the points closest to the baggage claim location are located, and the planned routes are selected from the target road segments, each planned route has a corresponding baggage claim location, i.e., a road segment where the point closest to the baggage claim location is located.
According to the invention, the luggage gathering place is arranged between the luggage picking place and the luggage delivery place in the luggage picking order in the luggage picking system, the plurality of luggage picking places share one luggage gathering place, the visiting sequence is set for the plurality of luggage picking places sharing the luggage gathering place, the luggage at the plurality of luggage picking places is conveyed to the shared luggage gathering place according to the visiting sequence, and then the luggage gathered at the luggage gathering place is conveyed to the luggage delivery place by the transportation tool, so that the problem that urban road traffic arrangement and road conditions are unfavorable for large transportation tools in reality is overcome, and the luggage picking is more flexibly and efficiently realized.
Detailed Description
In this section, the technical solutions of the present invention will be further explained and illustrated. It should be noted that the present embodiment is only for explanation and illustration, and does not limit the present invention, and the embodiments of the present invention are not limited to one or more of the following.
A method for sharing the luggage collecting place includes such steps as providing a luggage collecting place between the luggage collecting place and the luggage delivering place in the order, sharing a luggage collecting place by multiple luggage collecting places, setting up an access sequence for said luggage collecting places, delivering the luggage to the luggage collecting place by the delivering tool, and delivering the luggage to the luggage delivering place.
Further, the baggage aggregation location is determined according to the following steps:
since the baggage claim point is sometimes set in consideration that some roads are not suitable for large vehicles to enter, more flexible vehicles such as electric vehicles, bicycles and the like are generally needed, in the embodiment, the electric vehicle with small volume, flexible action, adaptation to narrow road conditions and variable traffic rules completes the task of gathering the baggage from the baggage pickup location to the baggage claim point.
2.1 all baggage claim locations are n, for all n baggage claim locations, the number of its neighbor baggage claim locations is calculated: for one baggage extraction site b, if x other baggage extraction sites exist within the range of which the arrival time is within t, the number of neighboring baggage extraction sites of b is x; the time of arrival is an estimated value, estimated by distance and vehicle speed, and is currently read by using an interface provided by navigation software, such as hundredths and height. In this embodiment, the arrival time is the riding time of the baggage specialist driving the electric vehicle, and is estimated by using the distance and the riding speed of the baggage specialist.
Sorting all n baggage extraction sites according to the number of the neighbor baggage extraction sites from more to less and putting the n baggage extraction sites into a baggage extraction site set Q;
2.2 putting the baggage extraction site with the largest number of neighbor baggage extraction sites in the group M of the baggage extraction sites, and taking all the baggage extraction sites with the arrival time within t from the group Q; repeating the steps, specifically: finding one of the extraction places with the largest number of neighbors from the rest extraction places after the previous elimination, putting the extraction place in M, and eliminating Q from the extraction places within the travel time t of the extraction place until all the luggage extraction places in Q are eliminated;
2.3 for each baggage claim location M in set M, adding M and all baggage claim locations within t from its ride time to set Nm. yields | M | sets:
for each set Nm, drawing a minimum rectangle Rm which can cover all luggage extraction sites in the Nm on the map; in each rectangle Rm, all roads are segmented according to d meters, wherein all the roads refer to all the roads which can be passed, and longitude and latitude coordinates of a middle point of each road section are added into a candidate position set U; and calculating the average riding time from U to all the baggage pickup positions in the rectangular range of the position U, namely the middle point of each road section in the U, and selecting the U with the minimum average riding time as the position of the baggage gathering point in the rectangle.
Further, the step of setting the access sequence for a plurality of baggage claim points sharing one baggage claim point comprises:
3.1 putting a road section where a point closest to each luggage extraction point in all passable roads is located as a target section into a target section set; the road section is determined according to the following modes: and 1/2d meters are respectively expanded to two sides by taking the point closest to each luggage extraction point as a center to form a road section. d is set differently according to different vehicles, in the embodiment, the task is completed by a baggage specialist in a cycling mode, and d can be set to be 200 meters for riding.
3.2 if continuous road sections exist in the target road sections, combining the continuous target road sections into one target road section, and updating the required arrival time of the road section into an earlier required arrival time; continuous means that two segments are just joined or have repeated portions. If not, entering step 3.3;
3.3 adding the target road section with the shortest arrival time away from the luggage gathering point into the planned route;
3.4, calculating indexes R between all target road sections which are not added into the planned route and the target road sections which are added into the planned route in the previous step:
r is Tr-Ta, wherein Tr is the required arrival time of the luggage extraction place corresponding to the road section, and Ta is the estimated time of arriving at the luggage extraction place; the required arrival time is the required arrival time in the baggage picking order submitted by the customer.
3.5, sequentially adding the target road sections which have the minimum index R and are not extracted from the corresponding luggage and are far away from the previous added target road section into the planned route until all the target road sections are added into the planned route; and visiting the baggage extraction sites corresponding to each planned route according to the sequence of joining the planned routes, thereby determining the visiting sequence. Since the roads selected as the target road segments in 3.1 are roads where points closest to the baggage claim point are located, and the planned routes are selected from the target road segments, each planned route has a corresponding baggage claim point, i.e., a road segment where the point closest to the baggage claim point is located.
Claims (2)
1. A baggage handling method for sharing a baggage gathering place, wherein a baggage handling order submitted by a customer includes a plurality of baggage pickup places and baggage arrival places, and m transportation means transport the baggage from the baggage pickup places to the baggage arrival places to complete a baggage handling task, comprising: setting a baggage accumulation location between a baggage retrieval location and a baggage arrival location in a baggage pickup order, sharing one baggage accumulation location by a plurality of baggage retrieval locations, and setting an access order for the plurality of baggage retrieval locations sharing the baggage accumulation location, transporting the baggage at the plurality of baggage retrieval locations to the shared baggage accumulation location in the access order, and then transporting the baggage accumulated at the baggage accumulation location to the baggage arrival location by a transportation means;
the luggage gathering place is determined according to the following steps:
2.1 all baggage claim locations are n, for all n baggage claim locations, the number of its neighbor baggage claim locations is calculated: for one baggage pickup location b, if x other baggage pickup locations exist within the range of the arrival time of the baggage pickup location b within t, the number of neighbor baggage pickup locations of b is x;
sorting all n baggage extraction sites according to the number of the neighbor baggage extraction sites from more to less and putting the n baggage extraction sites into a baggage extraction site set Q;
2.2, putting the baggage extraction site with the largest number of neighbor baggage extraction sites in the group M of baggage sites, and taking all the baggage extraction sites with the arrival time within t from the group Q; repeating the steps until all the luggage extraction places in the Q are removed;
2.3 for each baggage extraction site M in the set M, adding M and all baggage extraction sites within t of the arrival time thereof into the set Nm to obtain n sets:
for each set Nm, drawing a minimum rectangle Rm which can cover all the luggage extraction sites in the Nm on the map; in each rectangle Rm, all roads are segmented according to d meters, and the middle point of each road is added into a candidate position set U; and calculating the average arrival time of the U to all the baggage pickup positions in the rectangular range of the U for each position U in the U, and selecting the U with the minimum average arrival time as the position of the baggage gathering point in the rectangle.
2. A baggage handling method according to claim 1 for a common baggage claim-gathering location, characterized in that: the step of setting the access sequence for a plurality of baggage claim points sharing one baggage claim point comprises:
3.1 putting a road section where a point closest to each luggage extraction point in all passable roads is located as a target section into a target section set; the road section is determined according to the following modes: expanding 1/2d meters to two sides respectively by taking the point closest to each luggage extraction point as a center to form a road section;
3.2 if continuous target road sections exist, combining the continuous target road sections into one target road section, and updating the required arrival time of the target road sections after combination into the earlier required arrival time of the continuous target road sections; if not, entering step 3.3;
3.3 adding the target road section with the shortest arrival time to the luggage gathering point in the target road section set into the planned route;
3.4, calculating indexes R between all target road sections which are not added into the planned route and the target road sections which are added into the planned route in the previous step:
r ═ Tr-Ta, where Tr is the required arrival time at the baggage retrieval location corresponding to the road segment, and Ta is the estimated time to reach this baggage retrieval location;
wherein tk is the time from the k-1 th joined-to-planned route target segment to the k-th joined-to-planned route target segment, and tc is the time at which the transport is expected to arrive at the baggage aggregation point in preparation for the start of baggage claim;
3.5, sequentially adding the target road sections which have the minimum index R and are not extracted from the corresponding luggage and are far away from the previous added target road section into the planned route until all the target road sections are added into the planned route; and visiting the baggage extraction places corresponding to each planned route according to the sequence of joining the planned routes, thereby determining the visiting sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910293975.0A CN110333715B (en) | 2019-04-12 | 2019-04-12 | Luggage taking and delivering method for sharing luggage gathering place |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910293975.0A CN110333715B (en) | 2019-04-12 | 2019-04-12 | Luggage taking and delivering method for sharing luggage gathering place |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110333715A CN110333715A (en) | 2019-10-15 |
| CN110333715B true CN110333715B (en) | 2022-09-30 |
Family
ID=68138992
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910293975.0A Expired - Fee Related CN110333715B (en) | 2019-04-12 | 2019-04-12 | Luggage taking and delivering method for sharing luggage gathering place |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110333715B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6512964B1 (en) * | 2000-09-20 | 2003-01-28 | Baggagedirect.Com, Inc. | Baggage transportation method |
| WO2009092544A1 (en) * | 2008-01-21 | 2009-07-30 | Daimler Ag | Method and device for allocating freight and/or freight room to a truck |
| JP2011225313A (en) * | 2010-04-19 | 2011-11-10 | Isono Body:Kk | Home delivery luggage collection management system |
| CN106096878A (en) * | 2016-06-01 | 2016-11-09 | 广州捷径信息科技有限公司 | A kind of intelligence luggage delivery system and using method |
| CN108388963A (en) * | 2018-02-13 | 2018-08-10 | 百度在线网络技术（北京）有限公司 | Luggage arrival time prediction technique, device, computer equipment and readable medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3807496B2 (en) * | 2002-03-18 | 2006-08-09 | 富士通株式会社 | Package delivery destination management method, apparatus and program |
| US6845293B1 (en) * | 2002-06-26 | 2005-01-18 | Mohan Ananda | Method and apparatus for transporting passenger baggage |
| US20090015398A1 (en) * | 2007-07-13 | 2009-01-15 | International Business Machines Corporation | System and method of providing location information of checked baggage |
| JP5282785B2 (en) * | 2008-10-15 | 2013-09-04 | 富士通株式会社 | Luggage arrangement management method, transport device, and transport control program |
| WO2012097525A1 (en) * | 2011-01-21 | 2012-07-26 | Siemens Aktiengesellschaft | Method for handling baggage within airport and system thereof |
| IL240317A0 (en) * | 2015-08-03 | 2015-11-30 | Eliyahu Baruch | System and method for protecting a luggage |
-
2019
- 2019-04-12 CN CN201910293975.0A patent/CN110333715B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6512964B1 (en) * | 2000-09-20 | 2003-01-28 | Baggagedirect.Com, Inc. | Baggage transportation method |
| WO2009092544A1 (en) * | 2008-01-21 | 2009-07-30 | Daimler Ag | Method and device for allocating freight and/or freight room to a truck |
| JP2011225313A (en) * | 2010-04-19 | 2011-11-10 | Isono Body:Kk | Home delivery luggage collection management system |
| CN106096878A (en) * | 2016-06-01 | 2016-11-09 | 广州捷径信息科技有限公司 | A kind of intelligence luggage delivery system and using method |
| CN108388963A (en) * | 2018-02-13 | 2018-08-10 | 百度在线网络技术（北京）有限公司 | Luggage arrival time prediction technique, device, computer equipment and readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110333715A (en) | 2019-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103646560B (en) | The extracting method in taxi wheelpath experimental knowledge path | |
| CN109816979B (en) | Bus route recommendation method considering bus arrival frequency and riding comfort | |
| CN103198104B (en) | A kind of public transport station OD acquisition methods based on city intelligent public transit system | |
| CN105387864B (en) | Path planning device and method | |
| CN105825672B (en) | A kind of city guide method for extracting region based on floating car data | |
| CN104024800B (en) | Can coverage area computing device, method | |
| CN109035787B (en) | Method for identifying vehicle category by using mobile communication data | |
| CN107818412A (en) | A kind of extensive bus passenger OD parallel calculating methods based on MapReduce | |
| CN107679646A (en) | A kind of optimal transit route intelligent optimization method of benefit | |
| CN106568456B (en) | Non-stop charging method based on GPS/ Beidou positioning and cloud computing platform | |
| CN105788260A (en) | Public transportation passenger OD calculation method based on intelligent public transportation system data | |
| CN112542043B (en) | Method and system for identifying bus net coverage blind area based on mobile phone signaling and big data analysis | |
| CN104990551A (en) | Indoor and outdoor co-navigation method and system based on trajectory extraction | |
| CN102436466A (en) | Bus transfer query method based on GIS classification | |
| CN109520499B (en) | Method for realizing regional real-time isochrones based on vehicle GPS track data | |
| CN101694749A (en) | Method and device for speculating routes | |
| US20130218366A1 (en) | System for providing information on power consumption amount of electric vehicle | |
| CN109102114B (en) | Bus trip getting-off station estimation method based on data fusion | |
| CN108592928B (en) | Construction method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN106382939A (en) | System and method for predicating driving time on navigation path based on historical data | |
| CN111328412B (en) | Adaptive traffic control based on vehicle trajectory data | |
| CN107134137A (en) | A kind of Dynamic User-Optimal Route Choice method for considering real time information | |
| CN111554085A (en) | Public transportation integrated travel intelligent service device and application method thereof | |
| CN110245774A (en) | A method of regular service route optimization is carried out according to employee's home address | |
| CN108537362B (en) | Bus transfer method based on bidirectional search and estimation function pruning mode |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220915 Address after: 610000, No. two, section 4, Jianshe North Road, Chengdu, Sichuan, Chenghua District Applicant after: Zhao Zhiwei Address before: No. 1807, 18th Floor, Building 1, No. 530, Middle Section, Tianfu Avenue, Chengdu High-tech Zone, China (Sichuan) Free Trade Pilot Zone, Chengdu, Sichuan, 610000 Applicant before: Chengdu Service Student Technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20220930 |