CN109978209A - Line design method and device - Google Patents
Line design method and device Download PDFInfo
- Publication number
- CN109978209A CN109978209A CN201711457148.8A CN201711457148A CN109978209A CN 109978209 A CN109978209 A CN 109978209A CN 201711457148 A CN201711457148 A CN 201711457148A CN 109978209 A CN109978209 A CN 109978209A
- Authority
- CN
- China
- Prior art keywords
- route
- optimized
- demand
- vector
- route vector
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/14—Travel agencies
Abstract
The invention discloses a kind of line design method and devices, are related to field of computer technology.Wherein, this method comprises: according to the multiple demand route vectors of user demand information architecture；The similarity between each demand route vector is calculated, and similarity is greater than the demand route vector of preset threshold to as route vector pair to be optimized；To the route vector to be optimized to being iterated optimization processing, and according to after optimization route vector and similarity be less than or equal to the demand route vector of preset threshold and generate layout of roads result.By above step, layout of roads can be automatically generated as a result, mitigating the workload that route formulates personnel, improve the reasonability of route design.
Description
Technical field
The present invention relates to field of computer technology more particularly to a kind of line design methods and device.
Background technique
With the rapid development of economy, the demand of people's out on tours is more and more.Currently, travelling products are broadly divided into two
Class: first is that fixed route travelling products, second is that personal customization route travelling products.
In the prior art, fixed route travelling products generally include following design procedure: first by artificial selection temperature ratio
Higher several sight spots form a travelling route；Then, decide whether to redesign route according to user's registration situation；Such as
Fruit number of applicants is few, then by manual redesign travelling route, until the travelling route of design is relatively reasonable.And for individual
Route travelling products are customized, then is that travelling route is customized by user oneself, then provides service by tourist corporation.
In realizing process of the present invention, at least there are the following problems in the prior art for inventor's discovery:
The first, in existing fixed route Tourism Product Design scheme, the work of engineer travelling route is tedious, no
It is only time-consuming and laborious, and be difficult to find optimal travelling route.In addition, existing fixed route travelling products are not able to satisfy difference
The personalized tourism demand of user.The second, individually customized travelling products cost is too high, and applicable user group is too small,
And it will cause the waste of the human and material resources such as tourist vehicle, tour guide.
Summary of the invention
In view of this, the present invention provides a kind of line design method and device, layout of roads can be automatically generated as a result, subtracting
Light route formulates the workload of personnel, improves the reasonability of route design.
To achieve the above object, according to an aspect of the invention, there is provided a kind of line design method.
Line design method of the invention includes: according to the multiple demand route vectors of user demand information architecture；It calculates each
Similarity between demand route vector, and similarity is greater than the demand route vector of preset threshold to as route to be optimized
Vector pair；To the route vector to be optimized to being iterated optimization processing, and according to route vector after optimization and similar
The demand route vector that degree is less than or equal to preset threshold generates layout of roads result.
Optionally, it is described to the route vector to be optimized to including: according to similar the step of being iterated optimization processing
Spend descending sequence, successively to each route vector to be optimized to optimize processing；Wherein, to each route to be optimized
Vector includes: to judge route vector to be optimized to whether meeting merging condition to the optimization processing of progress；Meeting merging condition
When, the website of the route vector centering to be optimized is merged.
Optionally, the merging condition includes: to estimate in the case that route vector to be optimized to profit when merging
Value be greater than to route vector to be optimized to the profit discreet value under without combination situation.
Optionally, it calculates according to the following formula and route vector to be optimized is estimating the profit under without combination situation
Value:
Wherein, F indicates profit discreet value, and Price is the price of every route, and n is number of users,Indicate final ginseng
With user's ratio, ∑ M indicates the sum of the website of all user demands, ∑ W indicate to route vector to be optimized to without
Practical the sum of the website being provided of all users under combination situation, K be to route vector to be optimized to without combination situation
Under required vehicle number, num (Li) indicate to route vector to be optimized to without route L under combination situationiNumber of users, Q
Indicate the number of users that each car can carry,Expression pairIt rounds up.
Optionally, the similarity between each demand route vector is calculated according to the following formula；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIt indicates j-th
Website Hosting included by demand route vector, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,
Mk) indicate to MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
Optionally, the method also includes: after generating layout of roads result, the layout of roads result is commented
Estimate, and assessment result is shown.
Optionally, the method also includes: receive user demand information, and the user demand information saved.
To achieve the above object, according to another aspect of the present invention, a kind of route design device is provided.
Route design device of the invention includes: building module, for according to the multiple demand lines of user demand information architecture
Road direction amount；Computing module, for calculating the similarity between each demand route vector, and the need by similarity greater than preset threshold
Ask route vector to as route vector pair to be optimized；Optimization module, for the route vector to be optimized to being iterated
Optimization processing, and according to after optimization route vector and similarity be less than or equal to preset threshold demand route vector it is raw
At layout of roads result.
Optionally, the optimization module includes: described excellent to optimization processing is iterated to the route vector to be optimized
Change the module sequence descending according to similarity, successively to each route vector to be optimized to optimizing processing；Wherein, institute
Stating optimization module includes: that the optimization module judges route to be optimized to the optimization processing of progress to each route vector to be optimized
Whether vector is to meeting merging condition；When meeting merging condition, the optimization module is by the route vector centering to be optimized
Website merges.
Optionally, the merging condition of optimization module configuration include: to route vector to be optimized to merging feelings
Profit discreet value under condition be greater than to route vector to be optimized to the profit discreet value under without combination situation.
Optionally, the optimization module calculate according to the following formula to route vector to be optimized to without combination situation
Under profit discreet value:
Wherein, F indicates profit discreet value, and Price is the price of every route, and n is number of users,Indicate final ginseng
With user's ratio, ∑ M indicates the sum of the website of all user demands, ∑ W indicate to route vector to be optimized to without
Practical the sum of the website being provided of all users under combination situation, K be to route vector to be optimized to without combination situation
Under required vehicle number, num (Li) indicate to route vector to be optimized to without route L under combination situationiNumber of users, Q
Indicate the number of users that each car can carry,Expression pairIt rounds up.
Optionally, the computing module calculates the similarity between each demand route vector according to the following formula；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIt indicates j-th
Website Hosting included by demand route vector, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,
Mk) indicate to MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
Optionally, described device further include: evaluation module, for the optimization module generate layout of roads result it
Afterwards, the layout of roads result is assessed, and assessment result is shown.
Optionally, described device further include: acquisition module, for receiving user demand information, and to the user demand
Information is saved.
To achieve the above object, according to a further aspect of the invention, a kind of server is provided.
Server of the invention, comprising: one or more processors；And storage device, for storing one or more
Program；When one or more of programs are executed by one or more of processors, so that one or more of processors
Realize line design method of the invention.
To achieve the above object, according to a further aspect of the invention, a kind of computer-readable medium is provided.
Computer-readable medium of the invention is stored thereon with computer program, real when described program is executed by processor
Existing line design method of the invention.
One embodiment in foregoing invention has the following advantages that or the utility model has the advantages that by according to user demand information architecture
Multiple demand route vectors calculate the similarity between each demand route vector, and similarity is greater than to the demand of preset threshold
Route vector to as route vector pair to be optimized, and, to the route vector to be optimized to being iterated optimization processing etc.
Step can automatically generate layout of roads as a result, mitigating the workload that route formulates personnel.In addition, can by above step
The layout of roads result optimal to tourist corporation is generated under the premise of meeting users ' individualized requirement as far as possible.
Further effect possessed by above-mentioned non-usual optional way adds hereinafter in conjunction with specific embodiment
With explanation.
Detailed description of the invention
Attached drawing for a better understanding of the present invention, does not constitute an undue limitation on the present invention.Wherein:
Fig. 1 is the key step schematic diagram of line design method according to an embodiment of the invention；
Fig. 2 is the key step schematic diagram of line design method according to another embodiment of the present invention；
Fig. 3 is the main modular schematic diagram of route design device according to an embodiment of the invention；
Fig. 4 is the main modular schematic diagram of route design device according to another embodiment of the present invention；
Fig. 5 is that the embodiment of the present invention can be applied to exemplary system architecture figure therein；
Fig. 6 is adapted for the structural schematic diagram for the computer system for realizing the server of the embodiment of the present invention.
Specific embodiment
Below in conjunction with attached drawing, an exemplary embodiment of the present invention will be described, including the various of the embodiment of the present invention
Details should think them only exemplary to help understanding.Therefore, those of ordinary skill in the art should recognize
It arrives, it can be with various changes and modifications are made to the embodiments described herein, without departing from scope and spirit of the present invention.Together
Sample, for clarity and conciseness, descriptions of well-known functions and structures are omitted from the following description.
It should be pointed out that in the absence of conflict, the feature in embodiment and embodiment in the present invention can be with
It is combined with each other.
Fig. 1 is the key step schematic diagram of line design method according to an embodiment of the invention.The embodiment of the present invention
Method can be applied to several scenes, such as tourist service scene, trip service scenarios.As shown in Figure 1, the embodiment of the present invention
Line design method includes:
Step S101, according to the multiple demand route vectors of user demand information architecture.
Wherein, the user demand information can include: the website that user identifier (ID), user select.Step S101 can be wrapped
Include: the demand information submitted to user is counted, is arranged, to obtain all demand routes, and by each demand circuit table
It is shown as the format of vector.Since each demand route may be corresponding with one or more users, demand route number be less than or
Equal to number of users.
For example, the user that ID is 10001 and ID is 10005 selected from optional website (for example being 7) A,
B, tri- websites of C, then the two users correspond to same demand route, can be expressed as vector: (1,1,1,0,0,0,
0).In the vector, seven components represent seven website A to G, and component " 1 " indicates the website that user chooses, composition
Element " 0 " indicates the website that user does not choose.
Illustratively, in tourist service scene, the user demand information can be tourism demand information, the demand
Route vector can be tourism demand route vector；In trip service scenarios, the user demand information can need for trip
Information is sought, the demand route vector can be trip requirements route vector.
Step S102, the similarity between each demand route vector is calculated, and similarity is greater than to the demand of preset threshold
Route vector is to as route vector pair to be optimized.
Wherein, the similarity between the demand route vector is used to measure the phase of website included by two demand routes
Like degree (or being overlapping degree).Similarity is higher, shows that the similarity degree for the website that two demand routes include is higher, uses
Family demand is more similar；Similarity is lower, shows that the similarity degree for the website that two demand routes include is lower, user demand is more not
It is similar.In this step, pass through the demand route vector pair by similarity greater than preset threshold (such as 0.5,0.7 or other values)
It is optimized as route vector to be optimized to and by step S103, and is less than or equal to the need of preset threshold to similarity
It asks route vector to without optimization, can generate under the premise of meeting users ' individualized requirement as far as possible to service provider
Optimal layout of roads is as a result, such as minimize cost of serving.
Step S103, to the route vector to be optimized to being iterated optimization processing, and according to the line after the optimization
The demand route vector that road direction amount and similarity are less than or equal to preset threshold generates layout of roads result.
Wherein, the layout of roads result can include: finally obtained one or more planning travelling route.For example, its
May is that by after optimizing route and similarity be less than or equal to preset threshold demand railway superstructures sets of lines.
In embodiments of the present invention, layout of roads can be automatically generated by above step as a result, mitigating route formulates people
The workload of member.In addition, can be generated under the premise of meeting users ' individualized requirement as far as possible to tourism by above step
The optimal layout of roads of company is as a result, improve the reasonability of route design.
Fig. 2 is the key step schematic diagram of line design method according to another embodiment of the present invention.As shown in Fig. 2, this
The line design method of inventive embodiments includes:
Step S201, user demand information is received, and the user demand information is saved.
Illustratively, in tourist service scene, the user demand information can be tourism demand information.Specific implementation
When, optional site information can be showed into user by way of webpage or the APP page, in order to which user is in webpage or APP
The website for wanting to travel is selected on the page.Such as, it is assumed that design the travelling products of 11 vacations, then it can be before 11
Acquire the tourism demand information of user.After receiving the tourism demand information that user submits, it can save it in database,
It is as shown in table 1 to save format.
Table 1 shows a kind of preservation format of optional tourism demand information.As shown in table 1, the tourism demand information
It include: the website (or for sight spot) that user identifier (ID), user select.User ID is unique identification of the user in website, is led to
The user can be uniquely determined by crossing User ID.The website of user's selection includes one or more site numbers, multiple site numbers
Between can be separated with comma, pause mark or other symbols.The first row data in table 1 indicate: the user that ID is 10001 selects
Three are wanted website A, B, C of tourism.
Table 1
| User ID | The website of user's selection |
| 10001 | A, B, C |
| 10002 | A, E |
| 10003 | G, B, E |
| 10004 | F, B, A, E |
| 10005 | D,G |
| …… | …… |
Step S202, according to the multiple demand route vectors of user demand information architecture.
Illustratively, the demand route vector can be tourism demand route vector.In this example, step S202 packet
Include: the tourism demand information submitted to user is counted, is arranged, to obtain all tourism demand routes, and by each trip
Trip demand route is expressed as the format of vector.Since each tourism demand route may be corresponding with one or more users,
Tourism demand route number is less than or equal to number of users.For example, it is assumed that be 7 for the website number that user selects, number of users n
It is a, it is m by counting obtained tourism demand route, then can establishes the matrix W of a m row 7 column, every a line in matrix W
It can indicate a tourism demand route vector, as shown in table 2.In table 2, the component 1 of matrix indicates every tourism demand
The website that route includes, component 0 indicate every tourism demand route website not to be covered.For example, demand route vector L1
For (0,1,1,0,0,0,1), indicate that the tourism demand route is made of tri- websites of B, C, G.
Table 2
| A | B | C | D | E | F | G | |
| L1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
| L2 | 1 | 0 | 0 | 0 | 0 | 1 | 0 |
| L3 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
| L4 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
| …… | |||||||
| Lm | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
Step S203, the similarity between each demand route vector is calculated, and similarity is greater than to the demand of preset threshold
Route is to as route vector pair to be optimized.
Illustratively, the similarity between each demand route vector can be calculated according to the following formula；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIt indicates j-th
Website Hosting included by demand route vector, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,
Mk) indicate to MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
For example, Website Hosting M1 is { B, C, G }, Website Hosting M2 for demand route vector L1, L2 in table 2
For { A, F }, then the union of Website Hosting M1 and M2 shares 5 websites, and the intersection of Website Hosting M1 and M2 share 0 website, then
The similarity S that formula according to the example is calculated1,2It is 0.For another example, demand route vector L1, L4 in table 2 are come
It says, Website Hosting M1 is { B, C, G }, and Website Hosting M4 is { B, D }, then the union of Website Hosting M1 and M4 shares 4 websites, stands
The intersection of point set M1 and M2 share 1 website, then the similarity S that formula according to the example is calculated1,4It is 0.25.
After the similarity being calculated according to above formula between each demand route vector, similarity is greater than default
The demand route vector of threshold value (such as 0.5) optimizes processing to it to as vector pair to be optimized, and according to step S204.
It should be pointed out that a kind of preferred embodiment of similarity of the above example between calculating demand route vector.?
In the case where not influencing present invention implementation, demand route vector similarity can also be calculated according to other modes, for example calculating need to
Hamming distance, Euclidean distance or the COS distance between route vector are sought, and using calculated result as between demand route vector
Similarity.
Step S204, sequence descending according to similarity successively optimizes place to each route vector to be optimized
Reason.
It wherein, include: to judge route vector to be optimized to being to the optimization processing of progress to each route vector to be optimized
It is no to meet merging condition；When meeting merging condition, the website of the route vector centering to be optimized is merged；It is being unsatisfactory for
When merging condition, then the website of the route vector centering to be optimized is not merged.Illustratively, the merging condition packet
Include: in the case that route vector to be optimized to profit discreet value when merging be greater than to route vector to be optimized to not into
Profit discreet value under row combination situation.
In embodiments of the present invention, by merging the website in route vector pair to be optimized when meeting merging condition,
The item number that the travelling route actually formulated can be reduced reduces the expenditure cost of tourist corporation, reduces tourist vehicle, tour guide et al.
The waste of power material resources.
Further, in this example, can calculate according to the following formula to route vector to be optimized to without merge feelings
Profit discreet value under condition:
Wherein, F is indicated to route vector to be optimized, to the profit discreet value under without combination situation, Price is every
The price of route, n is number of users,Indicate the user's ratio finally participated in, ∑ M indicates the website of all user demands
The sum of, ∑ W indicate to route vector to be optimized to without practical the sum of the website being provided of users all under combination situation,
K be to route vector to be optimized to without the vehicle number needed under combination situation, num (Li) indicate to route to be optimized
Vector is to without route L under combination situationiNumber of users, Q indicates the number of users that can carry of each car,Expression pairIt rounds up.
And calculate according to the following formula in the case that route vector to be optimized to profit discreet value when merging:
Wherein, F' indicates that route vector to be optimized, to the profit discreet value in the case of merging, Price is every line
The price on road, n are number of users,Indicating the user's ratio finally participated in, ∑ M indicates the sum of the website of all user demands,
∑ W' indicates in the case that route vector to be optimized the sum of the website being provided practical to users all when merging, K' be
Vehicle number needed in the case of being merged to route to be optimized, num (Li') indicate merging situation to route to be optimized
Lower route Li' number of users, Q indicates the number of users that can carry of each car,Expression pairInto
Row rounds up.
After F, F' is calculated according to above-mentioned formula, compare the size of the two, if F' is greater than F, to this
The website of the route vector centering to be optimized of iterative processing merges, and then realizes the update to matrix W.For example, matrix W
In route vector to be optimized to including: route vector L3(1,0,1,1,1,0,1), L4(0,1,1,1,1,0,1), then after merging
Route vector L3'、L4' it is (1,1,1,1,1,0,1).Optimize by successive ignition, route vector after being optimized, with
And similarity is less than or equal to the demand route vector of preset threshold.
In the specific implementation, for the ease of carry out data processing, obtain the similarity between each demand route vector it
Afterwards, the similarity matrix S of m row m column can be constructed.Then, circulation finds maximum value in matrix S, and finds most every time
After big value, executes following below scheme: the maximum value in matrix S being set as 0, judges the route to be optimized of the maximum value position
Whether the website of vector centering can merge, and carry out when meeting merging condition to the website in route vector pair to be optimized
Merging treatment；Value until being not greater than preset threshold in matrix S.
Further, since matrix S is symmetrical matrix, in order to reduce the number that circulation finds maximum value in matrix S,
Data processing speed is improved, matrix S can be handled as follows: before the maximum value that circulation finds in matrix S by matrix S
In diagonal line and the component value of lower delta-shaped region be set as 0.
Step S205, according to after the optimization route vector and similarity be less than or equal to preset threshold demand
Route vector generates layout of roads result.
Illustratively, the step can include: first from after optimization routing matrix (i.e. include optimization after route vector and
Similarity be less than or equal to preset threshold demand route vector matrix) in pick out unduplicated route, then, it is determined that often
The visit order of website included by a route picked out, then based on the route generation layout of roads knot for determining visit order
Fruit.
In the specific implementation, website included by every route can be determined based on the route function of third party's map software
Visit order.
Step S206, the layout of roads result is assessed, and assessment result is shown.
Wherein, the layout of roads result can include: the route of one or more planning；The assessment result can include:
The indexs such as range of driving time-consuming, route duration, line cost, route price and user satisfaction.Wherein, range of driving time-consuming refer to from
Route starting point starts, by way of each website, until the time of vehicle operation of route terminal；Route duration refer to range of driving time-consuming with it is each
Website is played the sum of time；Line cost refers to the cost of serving that company is paid for the route；Route price refers to each
The expense paid needed for one route of personal travel；User satisfaction can be with finally obtainedTo measure.For example, for
The assessment result of a certain route includes: the range of driving time-consuming when being 3 hours, route, and 10 hours a length of, line cost is 400 yuan, route
Price is 50 yuan, user satisfaction 9.5.
In embodiments of the present invention, layout of roads can be automatically generated by above step as a result, mitigating route maker
Tedious manual work, improve route design reasonability.In addition, being converged by the individual demand to a large amount of crowds
Always, and by similarity calculation, iteration optimization, the personalization that meet different user can be maximized with lower cost
Demand reduces the cost of travel service providers, reduces the waste of the tourist resources such as human and material resources.
Fig. 3 is the main modular schematic diagram of route design device according to an embodiment of the invention.As shown in figure 3, this
The route design device 300 of inventive embodiments includes: building module 301, computing module 302, optimization module 303.
Module 301 is constructed, for according to the multiple demand route vectors of user demand information architecture.
Wherein, the user demand information can include: the website that user identifier (ID), user select.Building module 301
According to the multiple demand route vectors of user demand information architecture can include: the demand information that user submits is counted, is arranged, with
All demand routes are obtained, and each demand route is expressed as to the format of vector.Since each demand route may be with one
A or multiple users are corresponding, and therefore, demand route number is less than or equal to number of users.
For example, the user that ID is 10001 and ID is 10005 selected from optional website (for example being 7) A,
B, tri- websites of C, then the two users correspond to same demand route, can be expressed as vector: (1,1,1,0,0,0,
0).In the vector, seven components represent seven website A to G, and component " 1 " indicates the website that user chooses, composition
Element " 0 " indicates the website that user does not choose.
Illustratively, in tourist service scene, the user demand information can be tourism demand information, the demand
Route vector can be tourism demand route vector；In trip service scenarios, the user demand information can need for trip
Information is sought, the demand route vector can be trip requirements route vector.
Computing module 302 is greater than preset threshold for calculating the similarity between each demand route vector, and by similarity
Demand route vector to as route vector pair to be optimized.
Wherein, the similarity between the demand route vector is used to measure the phase of website included by two demand routes
Like degree (or being overlapping degree).Similarity is higher, shows that the similarity degree for the website that two demand routes include is higher, uses
Family demand is more similar；Similarity is lower, shows that the similarity degree for the website that two demand routes include is lower, user demand is more not
It is similar.
In embodiments of the present invention, by computing module 302 by similarity be greater than preset threshold (such as 0.5,0.7 or its
His value) demand route vector optimized to as route vector to be optimized to and by optimization module 303, and to similar
Degree is less than or equal to the demand route vector of preset threshold to without optimization, can meet as far as possible users ' individualized requirement
Under the premise of generate the layout of roads result optimal to service provider.
Optimization module 303, for the route vector to be optimized to being iterated optimization processing, and according to the optimization
The demand route vector that route vector and similarity afterwards is less than or equal to preset threshold generates layout of roads result.
Wherein, the layout of roads result can include: finally obtained one or more planning travelling route.For example, its
May is that by after optimizing route and similarity be less than or equal to preset threshold demand railway superstructures sets of lines.
The device of the embodiment of the present invention can automatically generate layout of roads as a result, mitigating the workload that route formulates personnel.
In addition, the device of the embodiment of the present invention can generate under the premise of meeting users ' individualized requirement as far as possible to service provider
Optimal layout of roads is as a result, improve the reasonability of route design.
Fig. 4 is the main modular schematic diagram of route design device according to another embodiment of the present invention.As shown in figure 4, this
The route design device 400 of inventive embodiments includes: acquisition module 401, building module 402, computing module 403, optimization module
404, evaluation module 405.
Acquisition module 401 is saved for receiving user demand information, and to the user demand information.
Illustratively, in tourist service scene, the user demand information is tourism demand information.When it is implemented,
Optional site information can be showed into user by way of webpage or the APP page, in order to which user is in webpage or the APP page
The website of tourism is wanted in upper selection.Such as, it is assumed that the travelling products of 11 vacations are designed, then can be passed through before 11
The tourism demand information of the acquisition user of acquisition module 401.After receiving the tourism demand information that user submits, it can be saved
In the database.Wherein, it is stored in the tourism demand information of database can include: user identifier (ID), user select
Website.For example, the user that ID is 10001 has selected three website A, B, C for wanting tourism.
Module 402 is constructed, for according to the multiple demand route vectors of user demand information architecture.
Illustratively, the demand route vector can be tourism demand route vector.In this example, module is constructed
402 according to the multiple demand route vectors of user demand information architecture include: to user submit tourism demand information count,
It arranges, to obtain all tourism demand routes, and each tourism demand route is expressed as to the format of vector.
For example, it is assumed that being 7 for the website number that user selects, number of users is n, and building module 402 is by counting
To m tourism demand route, then the matrix W of a m row 7 column can be established.Every a line in matrix W can indicate a tourism demand
Route vector, the component 1 of matrix indicate that the website that every tourism demand route includes, component 0 indicate every tourism
Demand route website not to be covered.For example, the demand route vector L1 in the matrix is (0,1,1,0,0,0,1), indicating should
Tourism demand route is made of tri- websites of B, C, G.
Computing module 403 is greater than preset threshold for calculating the similarity between each demand route vector, and by similarity
Demand route to as route vector pair to be optimized.
Illustratively, computing module 403 can calculate the similarity between each demand route vector according to the following formula；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIt indicates j-th
Website Hosting included by demand route vector, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,
Mk) indicate to MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
After the similarity that computing module 403 is calculated between each demand route vector according to above formula, by phase
Then demand route vector like degree greater than preset threshold (such as 0.5) passes through optimization module 404 to as vector pair to be optimized
Processing is optimized to it.
It should be pointed out that above example is the one kind for the similarity that computing module 403 calculates between demand route vector
Preferred embodiment.In the case where not influencing present invention implementation, computing module 403 can also calculate demand route according to other modes
Vector similarity, such as computing module 403 calculate Hamming distance, Euclidean distance or the COS distance between demand route vector,
And using calculated result as the similarity between demand route vector.
Optimization module 404 successively carries out each route vector to be optimized for the sequence descending according to similarity
Optimization processing, it may include: optimization module 404 judges route vector to be optimized to whether meeting merging condition；Merge item meeting
When part, optimization module 404 merges the website of the route vector centering to be optimized；It is when being unsatisfactory for merging condition, then excellent
Change module 404 not merge the website of the route vector centering to be optimized.
Illustratively, the merging condition includes: in the case that pre- to profit when merging to route vector to be optimized
Valuation be greater than to route vector to be optimized to the profit discreet value under without combination situation.In embodiments of the present invention, excellent
Change module 404 by merging the website in route vector pair to be optimized when meeting merging condition, practical formulation can be reduced
Travelling route item number, reduce the expenditure cost of tourist corporation, reduce the wave of the human and material resources such as tourist vehicle, tour guide
Take.
In an optional embodiment, optimization module 404 can be calculated according to the following formula to route vector pair to be optimized
Without the profit discreet value under combination situation:
Wherein, F is indicated to route vector to be optimized, to the profit discreet value under without combination situation, Price is every
The price of route, n is number of users,Indicate the user's ratio finally participated in, ∑ M indicates the website of all user demands
The sum of, ∑ W indicate to route vector to be optimized to without practical the sum of the website being provided of users all under combination situation,
K be to route vector to be optimized to without the vehicle number needed under combination situation, num (Li) indicate to route to be optimized
Vector is to without route L under combination situationiNumber of users, Q indicates the number of users that can carry of each car,Expression pairIt rounds up.
And optimization module 404 calculate according to the following formula in the case that route vector to be optimized to when merging
Profit discreet value:
Wherein, F' indicates that route vector to be optimized, to the profit discreet value in the case of merging, Price is every line
The price on road, n are number of users,Indicating the user's ratio finally participated in, ∑ M indicates the sum of the website of all user demands,
∑ W' indicates in the case that route vector to be optimized the sum of the website being provided practical to users all when merging, K' be
Vehicle number needed in the case of being merged to route to be optimized, num (Li') indicate merging situation to route to be optimized
Lower route Li' number of users, Q indicates the number of users that can carry of each car,Expression pairInto
Row rounds up.
After F, F' is calculated according to above-mentioned formula, optimization module 404 compares the size of the two, if F' is greater than
F then merges the website of the route vector centering to be optimized of this iterative processing, and then realizes the update to matrix W.
For example, route vector to be optimized is to including: route vector L in matrix W3(1,0,1,1,1,0,1), L4(0,1,1,1,1,0,1),
Route vector L after then merging3'、L4' it is (1,1,1,1,1,0,1).Optimize by successive ignition, the line after being optimized
Road direction amount and similarity are less than or equal to the demand route vector of preset threshold.
It in the specific implementation, can be by computing module 403 in order to improve the data processing speed of optimization module 404
To after the similarity between each demand route vector, the similarity matrix S of m row m column is constructed.Then, by optimizing mould
The circulation of block 404 finds maximum value in matrix S, and after each maximizing, executes following below scheme: will be in matrix S
Maximum value is set as 0, judges whether the website of the route vector centering to be optimized of the maximum value position can merge, Yi Ji
Processing is merged to the website of route vector centering to be optimized when meeting merging condition；It is default until being not greater than in matrix S
The value of threshold value.
Further, since matrix S is symmetrical matrix, it is found in matrix S most to reduce the circulation of optimization module 404
The number being worth greatly improves data processing speed, can be before optimization module 404 recycles the maximum value found in matrix S, to matrix
S is handled as follows: the component value of diagonal line and lower delta-shaped region in matrix S is set as 0.
Optimization module 404, be also used to according to after the optimization route vector and similarity be less than or equal to default threshold
The demand route vector of value generates layout of roads result.
Specifically, optimization module 404 (includes first the route vector and phase after optimizing from the routing matrix after optimization
Like degree be less than or equal to preset threshold demand route vector matrix) in pick out unduplicated route, then, optimization module
404 determine the visit order of website included by the route each picked out, then based on the route generation line for determining visit order
Circuit planning result.In the specific implementation, optimization module 404 can determine every line based on the route function of third party's map software
The visit order of website included by road.
Evaluation module 405 for assessing the layout of roads result, and assessment result is shown.
Wherein, the layout of roads result can include: the route of one or more planning；The assessment result can include:
The indexs such as range of driving time-consuming, route duration, line cost, route price and user satisfaction.For example, for a certain route
Assessment result includes: the range of driving time-consuming when being 3 hours, route, and 10 hours a length of, line cost is 400 yuan, and route price is 50 yuan,
User satisfaction is 9.5.
The device of the embodiment of the present invention can automatically generate layout of roads as a result, mitigating the tedious craft of route maker
Work improves the reasonability of route design.In addition, by acquisition module, building module to the individual demand of a large amount of crowds into
Row summarizes, and calculates the similarity of demand route vector by computing module, passes through optimization module to route vector pair to be optimized
It is iterated optimization etc., the individual demand for meeting different user can be maximized with lower cost, reduces tourist service
The cost of supplier reduces the waste of the tourist resources such as human and material resources.
Fig. 5 is shown can be using the exemplary system of line design method or route the design device of the embodiment of the present invention
Framework 500.
As shown in figure 5, system architecture 500 may include terminal device 501,502,503, network 504 and server 505.
Network 504 between terminal device 501,502,503 and server 505 to provide the medium of communication link.Network 504 can be with
Including various connection types, such as wired, wireless communication link or fiber optic cables etc..
User can be used terminal device 501,502,503 and be interacted by network 504 with server 505, to receive or send out
Send message etc..Various telecommunication customer end applications, such as the application of shopping class, net can be installed on terminal device 501,502,503
The application of page browsing device, searching class application, instant messaging tools, mailbox client, social platform software etc..
Terminal device 501,502,503 can be the various electronic equipments with display screen and supported web page browsing, packet
Include but be not limited to smart phone, tablet computer, pocket computer on knee and desktop computer etc..
Server 505 can be to provide the server of various services, such as utilize terminal device 501,502,503 to user
The shopping class website browsed provides the back-stage management server supported.Back-stage management server can believe the product received
The data such as breath inquiry request carry out the processing such as analyzing, and processing result is fed back to terminal device.
It should be noted that line design method provided by the embodiment of the present invention is generally executed by server 505, accordingly
Ground, route design device are generally positioned in server 505.
It should be understood that the number of terminal device, network and server in Fig. 5 is only schematical.According to realization need
It wants, can have any number of terminal device, network and server.
Fig. 6 shows the structural schematic diagram for being suitable for the computer system 600 for the server for being used to realize the embodiment of the present invention.
Server shown in Fig. 6 is only an example, should not function to the embodiment of the present invention and use scope bring any restrictions.
As shown in fig. 6, computer system 600 includes central processing unit (CPU) 601, it can be read-only according to being stored in
Program in memory (ROM) 602 or be loaded into the program in random access storage device (RAM) 603 from storage section 608 and
Execute various movements appropriate and processing.In RAM 603, also it is stored with system 600 and operates required various programs and data.
CPU 601, ROM 602 and RAM 603 are connected with each other by bus 604.Input/output (I/O) interface 605 is also connected to always
Line 604.
I/O interface 605 is connected to lower component: the importation 606 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 607 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 608 including hard disk etc.；
And the communications portion 609 of the network interface card including LAN card, modem etc..Communications portion 609 via such as because
The network of spy's net executes communication process.Driver 610 is also connected to I/O interface 605 as needed.Detachable media 611, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 610, in order to read from thereon
Computer program be mounted into storage section 608 as needed.
Particularly, disclosed embodiment, the process described above with reference to flow chart may be implemented as counting according to the present invention
Calculation machine software program.For example, embodiment disclosed by the invention includes a kind of computer program product comprising be carried on computer
Computer program on readable medium, the computer program include the program code for method shown in execution flow chart.?
In such embodiment, which can be downloaded and installed from network by communications portion 609, and/or from can
Medium 611 is dismantled to be mounted.When the computer program is executed by central processing unit (CPU) 601, system of the invention is executed
The above-mentioned function of middle restriction.
It should be noted that computer-readable medium shown in the present invention can be computer-readable signal media or meter
Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not
Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter
The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires
Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage
Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device,
Or above-mentioned any appropriate combination.In the present invention, computer readable storage medium can be it is any include or storage journey
The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this
In invention, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium
Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned
Any appropriate combination.
Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more
Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box
The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical
On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants
It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule
The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction
It closes to realize.
Being described in module involved in the embodiment of the present invention can be realized by way of software, can also be by hard
The mode of part is realized.Described module also can be set in the processor, for example, can be described as: a kind of processor packet
Include building module, computing module, optimization module.Wherein, the title of these modules is not constituted under certain conditions to the module
The restriction of itself, for example, building module is also described as " building demand route vector field homoemorphism block ".
As on the other hand, the present invention also provides a kind of computer-readable medium, which be can be
Included in equipment described in above-described embodiment；It is also possible to individualism, and without in the supplying equipment.Above-mentioned calculating
Machine readable medium carries one or more program, when said one or multiple programs are executed by the equipment, makes
It obtains the equipment and executes following below scheme: according to the multiple demand route vectors of user demand information architecture；Calculate each demand route vector
Between similarity, and by similarity be greater than preset threshold demand route vector to as route vector pair to be optimized；To institute
Route vector to be optimized is stated to being iterated optimization processing, and according to after optimization route vector and similarity be less than or wait
Layout of roads result is generated in the demand route vector of preset threshold.
Above-mentioned specific embodiment, does not constitute a limitation on the scope of protection of the present invention.Those skilled in the art should be bright
It is white, design requirement and other factors are depended on, various modifications, combination, sub-portfolio and substitution can occur.It is any
Made modifications, equivalent substitutions and improvements etc. within the spirit and principles in the present invention, should be included in the scope of the present invention
Within.
Claims (16)
1. a kind of line design method, which is characterized in that the described method includes:
According to the multiple demand route vectors of user demand information architecture；
The similarity between each demand route vector is calculated, and similarity is greater than the demand route vector of preset threshold to conduct
Route vector pair to be optimized；
To the route vector to be optimized to being iterated optimization processing, and according to the route vector and similarity after optimization
Demand route vector less than or equal to preset threshold generates layout of roads result.
2. the method according to claim 1, wherein described excellent to being iterated to the route vector to be optimized
Changing the step of handling includes:
According to the sequence that similarity is descending, successively to each route vector to be optimized to optimize processing；Wherein, to every
One route vector to be optimized includes: to judge route vector to be optimized to whether meeting merging condition to the optimization processing of progress；?
When meeting merging condition, the website of the route vector centering to be optimized is merged.
3. according to the method described in claim 2, it is characterized in that, the merging condition includes:
In the case that route vector to be optimized to profit discreet value when merging be greater than to route vector to be optimized to not
Profit discreet value in the case of merging.
4. according to the method described in claim 3, it is characterized in that, being calculated according to the following formula to route vector pair to be optimized
Without the profit discreet value under combination situation:
Wherein, F indicates profit discreet value, and Price is the price of every route, and n is number of users,What expression finally participated in
User's ratio, ∑ M indicate the sum of the website of all user demands, ∑ W indicate to route to be optimized without combination situation under
Practical the sum of the website being provided of all users, K be to route vector to be optimized to without the vehicle needed under combination situation
Number, num (Li) indicate to route vector to be optimized to without route L under combination situationiNumber of users, Q indicate each car
The number of users that can be carried,Expression pairIt rounds up.
5. the method according to claim 1, wherein being calculated between each demand route vector according to the following formula
Similarity；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIndicate j-th of demand line
Website Hosting included by road direction amount, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,Mk) indicate
To MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
6. the method according to claim 1, wherein the method also includes:
After generating layout of roads result, the layout of roads result is assessed, and assessment result is shown.
7. the method according to claim 1, wherein the method also includes:
User demand information is received, and the user demand information is saved.
8. a kind of route designs device, which is characterized in that described device includes:
Module is constructed, for according to the multiple demand route vectors of user demand information architecture；
Computing module, for calculating the similarity between each demand route vector, and the demand by similarity greater than preset threshold
Route vector is to as route vector pair to be optimized；
Optimization module, for the route vector to be optimized to being iterated optimization processing, and according to the route after optimization to
The demand route vector that amount and similarity are less than or equal to preset threshold generates layout of roads result.
9. device according to claim 8, which is characterized in that the optimization module to the route vector to be optimized into
Row iteration optimization processing includes:
The optimization module sequence descending according to similarity, successively to each route vector to be optimized to optimize place
Reason；Wherein, the optimization module includes: that the optimization module judges to the optimization processing of progress to each route vector to be optimized
Whether route vector to be optimized is to meeting merging condition；When meeting merging condition, the optimization module is by the route to be optimized
The website of vector centering merges.
10. device according to claim 9, which is characterized in that the merging condition of optimization module configuration includes:
In the case that route vector to be optimized to profit discreet value when merging be greater than to route vector to be optimized to not
Profit discreet value in the case of merging.
11. device according to claim 10, which is characterized in that the optimization module calculates according to the following formula to be treated
Optimize route vector to without the profit discreet value under combination situation:
Wherein, F indicates profit discreet value, and Price is the price of every route, and n is number of users,What expression finally participated in
User's ratio, ∑ M indicate the sum of the website of all user demands, ∑ W indicate to route vector to be optimized to without merging
In the case of practical the sum of the website being provided of all users, K for route vector to be optimized to without combination situation under institute
The vehicle number needed, num (Li) indicate to route vector to be optimized to without route L under combination situationiNumber of users, Q indicate
The number of users that each car can carry,Expression pairIt rounds up.
12. device according to claim 8, which is characterized in that the computing module calculates each demand according to the following formula
Similarity between route vector；
Wherein, Sj,kIndicate the similarity of j-th of demand route vector and k-th of demand route vector, MjIndicate j-th of demand line
Website Hosting included by road direction amount, MkIndicate the set of website included by k-th of demand route vector, ∩ (Mj,Mk) indicate
To MjWith MkWebsite number after taking intersection, ∪ (Mj,Mk) indicate to MjWith MkWebsite number after taking union.
13. device according to claim 8, which is characterized in that described device further include:
Evaluation module, for commenting the layout of roads result after the optimization module generates layout of roads result
Estimate, and assessment result is shown.
14. device according to claim 8, which is characterized in that described device further include:
Acquisition module is saved for receiving user demand information, and to the user demand information.
15. a kind of server characterized by comprising
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real
The now method as described in any in claim 1 to 7.
16. a kind of computer-readable medium, is stored thereon with computer program, which is characterized in that described program is held by processor
The method as described in any in claim 1 to 7 is realized when row.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711457148.8A CN109978209B (en) | 2017-12-28 | 2017-12-28 | Line design method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711457148.8A CN109978209B (en) | 2017-12-28 | 2017-12-28 | Line design method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109978209A true CN109978209A (en) | 2019-07-05 |
| CN109978209B CN109978209B (en) | 2022-04-12 |
Family
ID=67074451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711457148.8A Active CN109978209B (en) | 2017-12-28 | 2017-12-28 | Line design method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109978209B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150207321A1 (en) * | 2012-10-01 | 2015-07-23 | Fujitsu Limited | Power distribution management apparatus, pattern extraction method, and recording medium |
| CN105069522A (en) * | 2015-07-24 | 2015-11-18 | 重庆大学 | Touring line evaluation and improvement method in scenic area |
| CN106033589A (en) * | 2015-03-10 | 2016-10-19 | 上海昕鼎网络科技有限公司 | Personalized service method and system for tour route |
| CN106233094A (en) * | 2014-04-22 | 2016-12-14 | 丰田自动车株式会社 | Route generation device and route generation method |
| CN106296488A (en) * | 2016-08-08 | 2017-01-04 | 武汉理工大学 | A kind of intelligent tourism system based on mass-rent pattern and method |
| CN106651027A (en) * | 2016-12-21 | 2017-05-10 | 北京航空航天大学 | Internet regular bus route optimization method based on social network |
| CN107423837A (en) * | 2017-04-12 | 2017-12-01 | 宁夏丝路风情旅游网络股份有限公司 | The Intelligent planning method and system of tourism route |
-
2017
- 2017-12-28 CN CN201711457148.8A patent/CN109978209B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150207321A1 (en) * | 2012-10-01 | 2015-07-23 | Fujitsu Limited | Power distribution management apparatus, pattern extraction method, and recording medium |
| CN106233094A (en) * | 2014-04-22 | 2016-12-14 | 丰田自动车株式会社 | Route generation device and route generation method |
| CN106033589A (en) * | 2015-03-10 | 2016-10-19 | 上海昕鼎网络科技有限公司 | Personalized service method and system for tour route |
| CN105069522A (en) * | 2015-07-24 | 2015-11-18 | 重庆大学 | Touring line evaluation and improvement method in scenic area |
| CN106296488A (en) * | 2016-08-08 | 2017-01-04 | 武汉理工大学 | A kind of intelligent tourism system based on mass-rent pattern and method |
| CN106651027A (en) * | 2016-12-21 | 2017-05-10 | 北京航空航天大学 | Internet regular bus route optimization method based on social network |
| CN107423837A (en) * | 2017-04-12 | 2017-12-01 | 宁夏丝路风情旅游网络股份有限公司 | The Intelligent planning method and system of tourism route |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109978209B (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105300398B (en) | The methods, devices and systems of gain location information | |
| CN106484766B (en) | Searching method and device based on artificial intelligence | |
| CN110020143A (en) | A kind of landing page generation method and device | |
| CN107590246A (en) | Method and apparatus for pushed information | |
| CN108520470A (en) | Method and apparatus for generating customer attribute information | |
| KR101707753B1 (en) | Method for personalized recommending affiliated store and affiliated store recommendation server | |
| CN109684624A (en) | A kind of method and apparatus in automatic identification Order Address road area | |
| CN107169077A (en) | Method and apparatus for pushed information | |
| Zhang et al. | A tourism route-planning approach based on comprehensive attractiveness | |
| CN107330091A (en) | Information processing method and device | |
| CN107590484A (en) | Method and apparatus for information to be presented | |
| CN110084658A (en) | The matched method and apparatus of article | |
| CN109961299A (en) | The method and apparatus of data analysis | |
| CN110427546A (en) | A kind of information displaying method and device | |
| CN109978213A (en) | A kind of task path planning method and device | |
| CN108537291A (en) | A kind of sample classification method and apparatus | |
| CN110309142A (en) | The method and apparatus of regulation management | |
| CN110490349A (en) | A kind of information recommendation method based on calendar, device, medium and electronic equipment | |
| CN110457607A (en) | A kind of partial journey information recommendation method, device, medium and electronic equipment | |
| CN109902848A (en) | The method and apparatus of regular bus Bus stop planning | |
| CN107844931A (en) | Information processing method and device | |
| CN111311469A (en) | Processing method of linkage additional service product and related device | |
| CN110381471A (en) | The method and apparatus for determining optimum base station for unmanned vehicle | |
| CN109978209A (en) | Line design method and device | |
| CN109388684A (en) | Method and apparatus for generating information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |