WO2022134479A1 - 路线推荐方法、装置、电子设备和存储介质 - Google Patents
路线推荐方法、装置、电子设备和存储介质 Download PDFInfo
- Publication number
- WO2022134479A1 WO2022134479A1 PCT/CN2021/097905 CN2021097905W WO2022134479A1 WO 2022134479 A1 WO2022134479 A1 WO 2022134479A1 CN 2021097905 W CN2021097905 W CN 2021097905W WO 2022134479 A1 WO2022134479 A1 WO 2022134479A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- scenic spot
- duration
- scenic
- list
- itinerary
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004590 computer program Methods 0.000 claims description 12
- 238000005065 mining Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 11
- 238000004891 communication Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000009286 beneficial effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000007418 data mining Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 229920006395 saturated elastomer Polymers 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
Definitions
- the present application relates to the field of data processing, in particular to the field of intelligent recommendation.
- the route quality of self-driving tours is often the core of tourist satisfaction.
- users generally search for routes recommended by other users through the Internet, and select a route that is relatively more suitable for their own needs.
- the present application provides a route recommendation method, apparatus, electronic device and storage medium.
- a method for recommending a route comprising:
- a recommended route of the target itinerary is determined based on the scenic spot list.
- a route recommendation device comprising:
- the information acquisition module is used to acquire the information of the ith scenic spot input for the target itinerary; wherein, i is a positive integer;
- the duration determination module is used to update the scenic spot list of the target itinerary based on the information of the ith scenic spot, and determine the estimated tour duration based on the scenic spot list;
- the route determination module is configured to determine the recommended route of the target itinerary based on the scenic spot list when the difference between the planned itinerary duration of the target itinerary and the expected tour duration is less than a preset threshold.
- an electronic device comprising:
- the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor, so that the at least one processor can execute the method provided by the embodiments of the present application.
- a non-transitory computer-readable storage medium storing computer instructions
- the computer instructions are used to cause a computer to execute the method provided by the embodiments of the present application.
- a computer program product including a computer program, which implements the method in the embodiments of the present application when the computer program is executed by a processor.
- the scenic spot list can be updated based on the input scenic spot information, and the recommended route is determined when the gap between the estimated tour duration and the itinerary plan duration is determined based on the scenic spot list is small. Therefore, the list of scenic spots can be determined according to the user's input, the number of scenic spots in the itinerary can be reasonably set, and a high-quality recommended route that meets the user's personalized needs can be obtained.
- FIG. 1 is a schematic diagram of a route recommendation method provided by an embodiment of the present application.
- FIG. 2 is a schematic diagram of a route recommendation method provided by another embodiment of the present application.
- FIG. 3 is a schematic diagram of an application example of the route recommendation method of the present application.
- FIG. 4 is a schematic diagram of a route recommendation device provided by an embodiment of the present application.
- FIG. 5 is a schematic diagram of a route recommendation device provided by another embodiment of the present application.
- FIG. 6 is a block diagram of an electronic device used to implement the method for recommending a route according to an embodiment of the present application.
- FIG. 1 shows a schematic diagram of a route recommendation method provided by an embodiment of the present application. As shown in Figure 1, the method includes:
- Step S11 obtaining the information of the ith scenic spot input for the target itinerary; wherein, i is a positive integer;
- Step S12 based on the ith scenic spot information, update the scenic spot list of the target itinerary, and determine the estimated tour duration based on the scenic spot list;
- Step S13 when the difference between the planned itinerary duration of the target itinerary and the expected tour duration is less than a preset threshold, determine a recommended route for the target itinerary based on the scenic spot list.
- a scenic spot is an area including at least one scenic spot, which can provide users with relatively concentrated and rich landscapes, such as the Forbidden City scenic spot, Zhangjiajie scenic spot, and the like.
- scenic spots may refer to landscape units with relative independence and integrity, such as the Hall of Supreme Harmony scenic spot in the Forbidden City scenic spot, the Tianmen Mountain scenic spot in the Zhangjiajie scenic spot, and the like.
- the target itinerary may be the itinerary to which the recommended route for the user belongs.
- the user may input relevant information of the target itinerary, and the electronic device executing the above method may determine a recommended route for the target itinerary based on the acquired information input for the target itinerary.
- the relevant information of the target itinerary may include scenic spot information, travel start point, travel end point, travel start time, travel end time, travel days, and the like.
- the planned trip duration may be determined based on the trip start time and the trip end time.
- the user can input scenic spot information for the target itinerary, and the electronic device can obtain the scenic spot list according to the scenic spot information input by the user.
- the scenic spot information may include information such as the name, code, and initials of the scenic spot.
- the electronic device each time the user inputs scenic spot information, the electronic device adds the corresponding scenic spot name or code to the scenic spot list to update the scenic spot list once, and determines the estimated tour duration based on the scenic spot list. That is to say, after acquiring the information of the ith scenic spot, the scenic spot list may include the information of the ith scenic spot and the information of the X scenic spots obtained before. where X is an integer, for example, X can be 0.
- the user can be prompted to stop inputting scenic spot information, and the recommended route of the target trip can be determined based on the current scenic spot list.
- a prompt message for stopping the input of scenic spot information is output, and in the case where it is determined to stop inputting scenic spot information, for example, the user has input an instruction to determine to stop , and determine the recommended route for the target itinerary based on the list of scenic spots. Based on this, the recommended route can be determined when the number of scenic spots in the target itinerary is not completely saturated, so that the number of scenic spots in the target itinerary is reasonable and the itinerary can be arranged in an orderly manner.
- the (i+1)th scenic spot information input for the target itinerary can be acquired.
- the user can also be prompted to continue to input the scenic spot information, thereby continuing to update the scenic spot list.
- the above method may further include: when the difference between the planned itinerary duration of the target itinerary and the expected tour duration is greater than or equal to a preset threshold, outputting prompt information for continuing to input scenic spot information, and obtaining the input information for the target itinerary. (i+1)th scenic spot information. Based on this, as many scenic spots as possible can be set within the planned duration of the target itinerary, so that the user can visit and experience as much as possible.
- the scenic spot list can be updated based on the input scenic spot information, and the recommended route is determined when the difference between the estimated tour duration and the itinerary plan duration is determined based on the scenic spot list. Therefore, it is beneficial to reasonably set the number of scenic spots in the itinerary, and design high-quality routes that meet the individual needs of users. Avoid leaving too much spare time and causing users to visit insufficiently, or to miss some scenic spots in the itinerary due to excessively tight itinerary design.
- the estimated tour duration may be calculated based on the relevant information of the target itinerary and the relevant information of each scenic spot in the scenic spot list. As an example, as shown in FIG. 2, in the above step S12, the estimated tour duration is determined based on the list of scenic spots, including:
- Step S21 based on the travel start point, the travel end point of the target itinerary, and the location information of each scenic spot in the scenic spot list, calculate the journey time required for each scenic spot in the scenic spot list;
- Step S22 Determine the estimated tour duration based on the reasonable stay duration and journey duration of each scenic spot in the scenic spot list.
- the starting point of the target itinerary is P s
- the end point of the itinerary is Pe
- the journey duration T route can be calculated according to the following formula:
- each time length in formula (1) is the time required from the starting point of the itinerary P s to the 0th scenic spot P 0 in the scenic spot list, is the time required from the last scenic spot P n in the scenic spot list to the end of the trip Pe , is the time required to go from the (j-1)th scenic spot to the jth scenic spot in the scenic spot list.
- each duration in formula (1) may also be calculated in combination with the travel start time ts of the target travel. For example, call the future travel estimated time function in the map application program according to the travel start time t s of the target itinerary, and use the future travel estimated time function, based on the travel start point P s , the travel end point P e and the scenic spots in the scenic spot list. Location information to calculate the travel time required for each scenic spot in the list of scenic spots. The calculation results have high accuracy.
- the reasonable stay duration of each scenic spot in the scenic spot list can be obtained by mining based on historical data.
- the length of stay of multiple users in the scenic spot can be calculated according to the time when the multiple users enter and leave the scenic spot in the historical data.
- Statistics on the length of stay of multiple users in the scenic spot are performed to obtain the distribution information of the stay time.
- the distribution of residence time is generally Gaussian.
- the reasonable stay time of the scenic spot is determined. For example, take the median or expected value of the stay time as the reasonable stay time in the scenic spot.
- the distribution interval [T low , T high ] of the stay time of the X users with the longest stay time is taken as the reasonable stay time of the scenic spot; wherein, X is a positive integer, and X can be obtained based on a preset ratio, for example, X is 70%, 80% of the total number of users, etc.
- the total stay time T tour can be calculated according to the following formula:
- T j is the reasonable stay duration of the (j+1)th scenic spot, which is an arbitrary value in the distribution interval of stay duration [T iow , T high ].
- the estimated tour duration T can be determined according to the following formula:
- the starting point, the ending point of the itinerary and the location information of each scenic spot are used as the basis for calculation, and the length factors such as the length of the journey and the length of stay in the itinerary are fully considered. Therefore, the accurate estimated tour duration can be calculated, which is beneficial to Set the number of scenic spots accurately and reasonably to improve the itinerary experience.
- the estimated tour duration can be obtained based on the minimum value of the reasonable stay duration or the maximum value of the reasonable stay duration.
- the estimated tour duration can also be a certain duration interval, and when calculating the difference between the planned itinerary and the estimated tour duration, the calculation can be performed based on the maximum value of the duration interval to avoid excessive travel tension.
- the above-mentioned step S21 calculates the travel time required for each scenic spot in the scenic spot list, which may include:
- N tour orders Based on the list of scenic spots, determine N tour orders; wherein, N is a positive integer
- the itinerary end point of the target itinerary and the location information of each scenic spot in the scenic spot list calculate the N travel durations corresponding to the N tour sequences;
- the minimum value of the N journey durations is determined as the journey duration required to visit each scenic spot in the scenic spot list.
- all arrangements of the scenic spots in the scenic spot list can be traversed to obtain N tour orders. Then, based on each of the N tour orders, the journey duration is calculated according to formula (1) to obtain N journey durations. Take the minimum value as the travel time required to visit each scenic spot in the list of scenic spots.
- the length of the journey in the journey can be minimized, thereby improving the experience of the journey.
- the recommended route of the target itinerary is determined based on the list of scenic spots, including:
- the tour order corresponding to the minimum value of the N journey durations obtained based on the scenic spot list is determined as the tour order of each scenic spot in the recommended route of the target itinerary.
- the tour order corresponding to the minimum journey duration is determined as the tour order of each scenic spot in the recommended route of the target itinerary. Based on this, the recommended route can be optimized to the greatest extent.
- the electronic device can obtain the globally optimal scenic spot list and scenic spot tour order under the following constraints:
- argmin(T route ) means to minimize the journey duration T route .
- st(subject to) means that the following inequality needs to be satisfied, that is, the constraint condition is T duraion ⁇ T route +T tour ; among them, T duraion is the estimated travel time, T route is the travel time required for each scenic spot in the list of scenic spots, and T tour is the total length of stay.
- determining the recommended route of the target itinerary based on the scenic spot list may include:
- a route that meets the expected duration of stay is selected as the recommended route for the j-th scenic spot.
- the ratio of the expected staying time of each scenic spot may be determined based on the reasonable staying time of each scenic spot. According to this ratio and the difference between the planned itinerary duration of the target itinerary and the journey duration, the estimated stay duration of each scenic spot is determined.
- the recommended route based on the scenic spot list to determine the target itinerary includes a reasonable duration of stay as For the two scenic spots of 2.5h and 1.5h, the ratio of the estimated duration of stay in the two scenic spots should be 5:3. According to the difference between the planned duration of the itinerary and the duration of the journey of 6h and this ratio, the expected duration of stay in the two scenic spots can be calculated.
- the durations are 3.75h and 2.25h respectively.
- a set of high-quality routes for each scenic spot may be pre-configured.
- the set of high-quality routes can be derived based on historical data. For example, multiple user routes in the scenic spot are selected from historical data and added to the high-quality route set.
- the selection basis may be the popularity value of the user or the popularity value of the route, and the popularity value may be determined according to the number of times the user or the route has been viewed, the number of times the route has been commented, and the like.
- the duration interval corresponding to the high-quality route set may be divided into multiple sub-intervals. For example, if the duration of multiple users' routes in the scenic area is between 1h and 2h, the duration interval [1h, 2h] can be divided into sub-intervals [1h, 1.5h] and [1.5h, 2h]. If the estimated stay duration of the jth scenic spot in the scenic spot list is 1.75h, then the sub-interval [1.5h, 2h] is the one that matches the estimated stay duration, and the route with the stay duration in the sub-interval [1.5h, 2h] is determined as the Recommended routes for j scenic spots.
- the recommended route in the scenic spot can also be automatically determined for each scenic spot in the scenic spot list, which does not require the user to spend a lot of time and energy, and the recommendation efficiency is high.
- the embodiment of the present application also provides an exemplary way of determining a high-quality route corresponding to each scenic spot.
- the above route recommendation method may further include:
- L routes are selected from the M historical routes, and the set of high-quality routes corresponding to the jth scenic spot is obtained based on the L routes, where L is a positive integer less than or equal to M.
- statistics may be performed on the scenic spots passed by the M historical routes, and the Y scenic spots that have been passed the most times among them are determined as the core scenic spots.
- Y is a positive integer.
- M historical routes may be aggregated to obtain a set of historical routes to be selected.
- L routes may be selected according to the number of core scenic spots covered by each historical route in the route set of the area to be selected. For example, the number of core scenic spots in a scenic spot is 5. If the number of core scenic spots covered by a historical route is greater than 3, this route can be selected.
- obtaining a set of high-quality routes in the scenic spot based on the core scenic spots is beneficial to recommending routes in the scenic spot with high coverage of the core scenic spots and high experience for users.
- the embodiment of the present application also provides a method for determining the scenic spots passed by each historical route.
- the above route recommendation method may further include:
- P scenic spots associated with the P positioning point clusters are determined, and the P scenic spots are determined as the scenic spots passed by the kth historical route.
- clustering may be performed according to the spatial distances of user positioning points in each historical route to obtain multiple positioning point clusters, and the positioning point clusters with smaller positioning point density are eliminated to obtain the remaining P positioning point clusters. Then, according to the distance between the center of each positioning point cluster in the P positioning point clusters and each scenic spot in the scenic spot, each positioning point cluster is bound to the nearest scenic spot to obtain the scenic spots passed by the historical route.
- the scenic spots passed by the historical route can be accurately determined, thereby improving the accuracy of mining core scenic spots, which is conducive to recommending the most suitable routes in scenic spots for users.
- FIG. 3 shows a schematic diagram of an application example of the route recommendation method of the present application.
- the route recommendation method of the present application includes online service provision, offline data mining and estimated travel time in the future.
- offline data mining includes:
- Step S311 excavating a reasonable length of stay in the scenic spot
- Step S312 mining the core scenic spots of the scenic spot
- Step S313 determining the high-quality route set of the scenic spot.
- Online service offerings include:
- Step S321 setting relevant information of the target itinerary.
- the relevant information includes start time, end time, travel start point, travel end point, and the like. Based on the start time and end time, the planned duration of the itinerary can be calculated.
- Step S322 inputting a list of scenic spots.
- the polling access input module is adopted, the estimated tour duration is calculated after each input, and it is determined whether to continue the input until the estimated tour duration is close to the planned itinerary.
- the estimated tour duration can be calculated based on the reasonable stay duration in the scenic spot and the estimated travel time in the future.
- Step S323 determine the recommended route.
- the recommended route can be determined according to the core attractions of the scenic spot and the collection of high-quality routes.
- the scenic spot list can be updated based on the input scenic spot information, and the recommended route is determined when the difference between the estimated tour duration and the itinerary planned duration is determined based on the scenic spot list. Therefore, the list of scenic spots can be determined according to the user's input, the number of scenic spots in the itinerary can be reasonably set, and a high-quality recommended route that meets the user's personalized needs can be obtained.
- FIG. 4 shows a schematic diagram of a route recommendation device in an embodiment of the present application. As shown in Figure 4, the device includes:
- the information acquisition module 410 is used for acquiring the information of the ith scenic spot inputted for the target itinerary; wherein, i is a positive integer;
- a duration determination module 420 configured to update the scenic spot list of the target itinerary based on the ith scenic spot information, and determine the estimated tour duration based on the scenic spot list;
- the route determination module 430 is configured to determine the recommended route of the target itinerary based on the scenic spot list when the difference between the planned itinerary duration and the expected tour duration of the target itinerary is less than a preset threshold.
- the device further includes:
- the input determination module 510 is configured to obtain the (i+1)th scenic spot information input for the target itinerary when the difference between the planned itinerary duration and the expected tour duration of the target itinerary is greater than or equal to a preset threshold.
- the duration determination module 420 may include:
- the journey duration determination unit 421 is used to calculate the journey duration required for each scenic spot in the scenic spot list based on the journey start point, the journey end point of the target journey and the location information of each scenic spot in the scenic spot list;
- the total duration determining unit 422 is configured to determine the estimated tour duration based on the reasonable staying duration and the journey duration of each scenic spot in the scenic spot list.
- the journey duration determining unit 421 is used for:
- N tour orders Based on the list of scenic spots, determine N tour orders; wherein, N is a positive integer
- the itinerary end point of the target itinerary and the location information of each scenic spot in the scenic spot list calculate the N travel durations corresponding to the N tour sequences;
- the minimum value of the N journey durations is determined as the journey duration required to visit each scenic spot in the scenic spot list.
- the route determination module 430 is used to:
- the tour order corresponding to the minimum value of the N journey durations obtained based on the scenic spot list is determined as the tour order of each scenic spot in the recommended route of the target itinerary.
- the route determination module 430 may include:
- the stay duration determination unit 431 is used to determine the estimated stay duration of the jth scenic spot in the scenic spot list based on the planned trip duration of the target itinerary and the reasonable stay duration of each scenic spot in the scenic spot list;
- the scenic route determination unit 432 is configured to select a route that meets the expected stay duration from the set of high-quality routes corresponding to the jth scenic spot, as a recommended route for the jth scenic spot.
- the device further includes:
- the core scenic spot mining module 520 is used to determine the core scenic spot of the jth scenic spot from the scenic spots passed by the M historical routes of the jth scenic spot; wherein, M is a positive integer;
- the route selection module 530 is used to select L routes from M historical routes based on the core scenic spots of the jth scenic spot, and obtain a set of high-quality routes corresponding to the jth scenic spot based on the L routes, where L is less than or equal to M positive integer of .
- the device further includes:
- the positioning point clustering module 540 is used for clustering the user positioning points corresponding to the kth historical route in the M historical routes to obtain P positioning point clusters; wherein, k and P are both positive integers;
- the scenic spot determination module 550 is configured to determine P scenic spots associated with the P positioning point clusters based on the position information of each scenic spot in the j th scenic spot, and determine the P scenic spots as the scenic spots passed by the k th historical route.
- the apparatuses provided by the embodiments of the present application can implement the methods provided by the embodiments of the present application, and have corresponding beneficial effects.
- the present disclosure also provides an electronic device, a readable storage medium, and a computer program product.
- FIG. 6 shows a schematic block diagram of an example electronic device 600 that may be used to implement embodiments of the present disclosure.
- Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers.
- Electronic devices may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smart phones, wearable devices, and other similar computing devices.
- the components shown herein, their connections and relationships, and their functions are by way of example only, and are not intended to limit implementations of the disclosure described and/or claimed herein.
- the device 600 includes a computing unit 601 that can be executed according to a computer program stored in a read only memory (ROM) 602 or a computer program loaded from a storage unit 608 into a random access memory (RAM) 603 Various appropriate actions and handling. In the RAM 603, various programs and data required for the operation of the device 600 can also be stored.
- the computing unit 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604.
- An input/output (I/O) interface 605 is also connected to bus 604 .
- Various components in the device 600 are connected to the I/O interface 605, including: an input unit 606, such as a keyboard, mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a magnetic disk, an optical disk, etc. ; and a communication unit 609, such as a network card, a modem, a wireless communication transceiver, and the like.
- the communication unit 609 allows the device 600 to exchange information/data with other devices through a computer network such as the Internet and/or various telecommunication networks.
- Computing unit 601 may be various general-purpose and/or special-purpose processing components with processing and computing capabilities. Some examples of computing units 601 include, but are not limited to, central processing units (CPUs), graphics processing units (GPUs), various specialized artificial intelligence (AI) computing chips, various computing units that run machine learning model algorithms, digital signal processing processor (DSP), and any suitable processor, controller, microcontroller, etc.
- the computing unit 601 executes the various methods and processes described above, such as a route recommendation method.
- the route recommendation method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 608 .
- part or all of the computer program may be loaded and/or installed on device 600 via ROM 602 and/or communication unit 609.
- the computer program When the computer program is loaded into RAM 603 and executed by computing unit 601, one or more steps of the route recommendation method described above may be performed.
- the computing unit 601 may be configured to perform the route recommendation method by any other suitable means (eg, by means of firmware).
- Various implementations of the systems and techniques described herein above may be implemented in digital electronic circuitry, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips system (SOC), load programmable logic device (CPLD), computer hardware, firmware, software, and/or combinations thereof.
- FPGAs field programmable gate arrays
- ASICs application specific integrated circuits
- ASSPs application specific standard products
- SOC systems on chips system
- CPLD load programmable logic device
- computer hardware firmware, software, and/or combinations thereof.
- These various embodiments may include being implemented in one or more computer programs executable and/or interpretable on a programmable system including at least one programmable processor that
- the processor which may be a special purpose or general-purpose programmable processor, may receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device an output device.
- Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer or other programmable data processing apparatus, such that the program code, when executed by the processor or controller, performs the functions/functions specified in the flowcharts and/or block diagrams. Action is implemented.
- the program code may execute entirely on the machine, partly on the machine, partly on the machine and partly on a remote machine as a stand-alone software package or entirely on the remote machine or server.
- a machine-readable medium may be a tangible medium that may contain or store a program for use by or in connection with the instruction execution system, apparatus or device.
- the machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium.
- Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or devices, or any suitable combination of the foregoing.
- machine-readable storage media would include one or more wire-based electrical connections, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), fiber optics, compact disk read only memory (CD-ROM), optical storage, magnetic storage, or any suitable combination of the foregoing.
- RAM random access memory
- ROM read only memory
- EPROM or flash memory erasable programmable read only memory
- CD-ROM compact disk read only memory
- magnetic storage or any suitable combination of the foregoing.
- the systems and techniques described herein may be implemented on a computer having a display device (eg, a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user ); and a keyboard and pointing device (eg, a mouse or trackball) through which a user can provide input to the computer.
- a display device eg, a CRT (cathode ray tube) or LCD (liquid crystal display) monitor
- a keyboard and pointing device eg, a mouse or trackball
- Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (eg, visual feedback, auditory feedback, or tactile feedback); and can be in any form (including acoustic input, voice input, or tactile input) to receive input from the user.
- the systems and techniques described herein may be implemented on a computing system that includes back-end components (eg, as a data server), or a computing system that includes middleware components (eg, an application server), or a computing system that includes front-end components (eg, a user's computer having a graphical user interface or web browser through which a user may interact with implementations of the systems and techniques described herein), or including such backend components, middleware components, Or any combination of front-end components in a computing system.
- the components of the system may be interconnected by any form or medium of digital data communication (eg, a communication network). Examples of communication networks include: Local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
- a computer system can include clients and servers.
- Clients and servers are generally remote from each other and usually interact through a communication network.
- the relationship of client and server arises by computer programs running on the respective computers and having a client-server relationship to each other.
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
一种路线推荐方法、装置、电子设备和存储介质，涉及智能推荐领域。具体实现方案为：获取针对目标行程输入的第i个景区信息(S11)；其中，i为正整数；基于第i个景区信息，更新目标行程的景区列表，并基于景区列表确定预计游览时长(S12)；在目标行程的行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，基于景区列表确定目标行程的推荐路线(S13)。该方法可以得到符合用户个性化需求的高质量推荐路线。
Description
本申请涉及数据处理领域，尤其涉及智能推荐领域。
随着旅游业的蓬勃发展，人们对旅游质量的要求也快速提升。相对于跟团游或者借助公共交通工具出行的自助游而言，自驾游在出行时间安排和景点选择上都更自由，有效提高行程灵活性和体验感。因此，自驾游逐渐成为人们青睐的旅游方式之一。
自驾游的路线质量往往是旅游满意度的核心。目前，用户一般通过互联网查找其他用户推荐的路线，从中选择相对更符合自身需求的路线。
发明内容
本申请提供了一种路线推荐方法、装置、电子设备和存储介质。
根据本申请的一方面，提供了一种路线推荐方法，包括：
获取针对目标行程输入的第i个景区信息；其中，i为正整数；
基于第i个景区信息，更新目标行程的景区列表，并基于景区列表确定预计游览时长；
在目标行程的行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，基于景区列表确定目标行程的推荐路线。
根据本申请的另一方面，提供了一种路线推荐装置，包括：
信息获取模块，用于获取针对目标行程输入的第i个景区信息；其中，i为正整数；
时长确定模块，用于基于第i个景区信息，更新目标行程的景区列表，并基于景区列表确定预计游览时长；
路线确定模块，用于在目标行程的行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，基于景区列表确定目标行程的推荐路线。
根据本申请的另一方面，提供了一种电子设备，包括：
至少一个处理器；以及
与至少一个处理器通信连接的存储器；其中，
存储器存储有可被至少一个处理器执行的指令，指令被至少一个处理器执行，以使至少一个处理器能够执行本申请实施例提供的方法。
根据本申请的另一方面，提供了一种存储有计算机指令的非瞬时计算机可读存储介质，计算机指令用于使计算机执行本申请实施例提供的方法。
根据本申请的另一方面，提供了一种计算机程序产品，包括计算机程序，该计算机程序被处理器执行时实现本申请实施例中的方法。
根据本申请的技术方案，可以基于输入的景区信息更新景区列表，在 基于景区列表确定预计游览时长与行程计划时长的差距较小的情况下，确定推荐路线。因此，可以根据用户输入确定景区列表，合理设置行程中的景区数量，得到符合用户个性化需求的高质量推荐路线。
应当理解，本部分所描述的内容并非旨在标识本申请的实施例的关键或重要特征，也不用于限制本申请的范围。本申请的其它特征将通过以下的说明书而变得容易理解。
附图用于更好地理解本方案，不构成对本申请的限定。其中：
图1是本申请一个实施例提供的路线推荐方法的示意图；
图2是本申请另一个实施例提供的路线推荐方法的示意图；
图3是本申请路线推荐方法的一个应用示例的示意图；
图4是本申请一个实施例提供的路线推荐装置的示意图；
图5是本申请另一个实施例提供的路线推荐装置的示意图；
图6是用来实现本申请实施例的路线推荐方法的电子设备的框图。
以下结合附图对本申请的示范性实施例做出说明，其中包括本申请实施例的各种细节以助于理解，应当将它们认为仅仅是示范性的。因此，本领域普通技术人员应当认识到，可以对这里描述的实施例做出各种改变和修改，而不会背离本申请的范围和精神。同样，为了清楚和简明，以下的描述中省略了对公知功能和结构的描述。
图1示出了本申请一个实施例提供的路线推荐方法的示意图。如图1所示，该方法包括：
步骤S11，获取针对目标行程输入的第i个景区信息；其中，i为正整数；
步骤S12，基于第i个景区信息，更新目标行程的景区列表，并基于景区列表确定预计游览时长；
步骤S13，在目标行程的行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，基于景区列表确定目标行程的推荐路线。
本申请实施例中，景区是包括至少一个景点的区域，可以为用户提供较为集中且丰富的景观，例如故宫景区、张家界景区等。其中，景点可以指具有相对独立性和完整性的景观单元，例如故宫景区中的太和殿景点、张家界景区中的天门山景点等。
目标行程可以是为用户推荐的路线所属的行程。作为示例，用户可以输入目标行程的相关信息，执行上述方法的电子设备可以基于获取到的针对目标行程输入的信息，确定目标行程的推荐路线。其中，目标行程的相关信息可以包括景区信息、行程起点、行程终点、行程起始时间、行程结束 时间、行程天数等。其中，基于行程起始时间和行程结束时间可以确定行程计划时长。
在本申请实施例中，用户可以针对目标行程输入景区信息，电子设备可以根据用户输入的景区信息得到景区列表，如此，可以根据用户的个性化需求确定推荐路线。其中，景区信息可以包括景区的名称、编码、拼音首字母等信息。
示例性地，用户每输入一次景区信息，电子设备则将对应的景区名称或编码等信息添加到景区列表中，以更新一次景区列表，基于景区列表确定预计游览时长。也就是说，在获取到第i个景区信息之后，景区列表中可以包含第i个景区信息和之前获取到的X个景区信息。其中，X为整数，例如，X可以为0。
在行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，可通过提示用户的方式，使用户停止输入景区信息，并基于当前的景区列表确定目标行程的推荐路线。作为示例，在行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，输出停止输入景区信息的提示信息，在确定停止输入景区信息例如用户输入了确定停止的指令的情况下，基于景区列表确定目标行程的推荐路线。基于此，可以在目标行程的景区数量未完全饱和的情况下确定推荐路线，使得目标行程的景区数量合理，行程安排能够做到有条不紊。
在行程计划时长与预计游览时长之间的差值大于等于预设阈值的情况下，可以获取针对目标行程输入的第(i+1)个景区信息。其中，也可以通过提示用户的方式，使用户继续输入景区信息，从而继续更新景区列表。作为示例，上述方法还可以包括：在目标行程的行程计划时长与预计游览时长之间的差值大于等于预设阈值的情况下，输出继续输入景区信息的提示信息，并获取针对目标行程输入的第(i+1)个景区信息。基于此，可以在目标行程的行程计划时长内尽可能多设置景区，以便于用户尽可能多地游览和体验。
可见，基于本申请实施例的方法，可以基于输入的景区信息更新景区列表，在基于景区列表确定预计游览时长与行程计划时长的差距较小的情况下，确定推荐路线。因此，有利于合理设置行程中的景区数量，设计符合用户个性化需求的高质量路线。避免因为留出过多的富余时间而导致用户游览不充分，或者因为行程设计过度紧张而导致错过行程中某些景区。
其中，预计游览时长可以基于目标行程的相关信息以及景区列表中各景区的相关信息进行计算。作为示例，如图2所示，上述步骤S12中，基于景区列表确定预计游览时长，包括：
步骤S21，基于目标行程的行程起点、行程终点以及景区列表中各景区的位置信息，计算游览景区列表中各景区所需的路程时长；
步骤S22，基于景区列表中各景区的合理停留时长以及路程时长，确定 预计游览时长。
举例而言，目标行程的行程起点为P
s，行程终点为P
e，景区列表中有(n+1)个景区，其中，从0开始为各景区进行编号，第j个景区为P
j，可以根据以下公式计算路程时长T
route：
其中，
为从行程起点为P
s到景区列表中第0个景区P
0所需的时长，
为从景区列表中最后一个景区P
n到行程终点P
e所需的时长，
为从景区列表中第(j-1)个景区到第j个景区所需的时长。根据行程起点P
s、行程终点P
e和景区列表中各景区的位置信息，可以计算得到公式(1)中的各时长。
可选地，还可以结合目标行程的行程起始时间t
s，计算公式(1)中的各时长。例如，根据目标行程的行程起始时间t
s调用地图应用程序中的未来出行预估用时功能，利用未来出行预估用时功能，基于行程起点P
s、行程终点P
e和景区列表中各景区的位置信息，计算游览景区列表中各景区所需的路程时长。计算结果具有较高的准确度。
示例性地，景区列表中各景区的合理停留时长可以基于历史数据挖掘得到。具体而言，可以根据历史数据中多个用户进入景区和离开景区的时间，计算多个用户在景区中的停留时长。对多个用户在景区中的停留时长进行统计，得到停留时长分布信息。实际应用中，停留时长的分布一般呈高斯分布。基于停留时长分布信息，确定景区的合理停留时长。例如，将停留时长的中位数或期望值作为景区的合理停留时长。又如，将停留时长最大的X个用户的停留时长分布区间[T
low,T
high]，作为景区的合理停留时长；其中，X为正整数，且X可以基于预设比例得到，例如X为用户总数的70％、80％等。
基于各景区的合理停留时长，可以根据以下公式计算得到停留总时长T
tour：
其中，T
j为第(j+1)个景区的合理停留时长，其是停留时长分布区间[T
iow,T
high]中的任意值。
基于合理停留时长以及路程时长，可以根据以下公式确定预计游览时长T：
T＝T
route+T
tour。 公式(3)
可见，在上述示例中，以行程起点、行程终点以及各景区的位置信息为计算依据，全面考虑行程中的路程时长、停留时长等时长因素，因此，可以计算得到准确的预计游览时长，有利于准确、合理地设置景区数量，提高行程体验度。
需要说明的是，在景区的合理停留时长为区间的情况下，预计游览时 长可以基于合理停留时长的最小值得到，也可以基于合理停留时长的最大值得到。或者，预计游览时长也可以相应的为某个时长区间，在计算行程计划用时和预计游览时长之间的差值时，可以基于该时长区间的最大值进行计算，避免行程过度紧张。
作为一种示例性的实施方式，上述步骤S21，基于目标行程的行程起点、行程终点以及景区列表中各景区的位置信息，计算游览景区列表中各景区所需的路程时长，可以包括：
基于景区列表，确定N个游览次序；其中，N为正整数；
基于目标行程的行程起点、行程终点以及景区列表中各景区的位置信息，计算与N个游览次序分别对应的N个路程时长；
将N个路程时长中的最小值，确定为游览景区列表中各景区所需的路程时长。
示例性地，可以遍历景区列表中各景区的所有排列方式，得到N个游览次序。然后，基于N个游览次序中的每个游览次序，根据公式(1)计算路程时长，得到N个路程时长。将其中的最小值作为游览景区列表中各景区所需的路程时长。
根据上述实施方式，可以使行程中的路程时长最小，从而提高行程体验度。
可选的，上述步骤S13中，基于景区列表确定目标行程的推荐路线，包括：
将基于景区列表得到的N个路程时长中的最小值所对应的游览次序，确定为目标行程的推荐路线中各景区的游览次序。
也就是说，将最小的路程时长所对应的游览次序，确定为目标行程的推荐路线中各景区的游览次序。基于此，可以最大程度地优化推荐路线。
可见，根据上述各实施方式，电子设备可以得到以下约束条件下的全局最优的景区列表以及景区游览次序：
argmin(T
route)s.t.T
duraion≥T
route+T
tour
其中，argmin(T
route)表示使路程时长T
route最小。s.t.(subject to)表示需满足后面的不等式，即约束条件为T
duraion≥T
route+T
tour；其中，T
duraion为行程预计时长，T
route为游览景区列表中各景区所需的路程时长，T
tour为停留总时长。
在本申请的一些实施例中，不仅能优化景区列表以及景区游览次序，满足用户的个性化需求且为用户提供充分而不紧张的行程体验，还能够针对各景区提供优化的景区内路线。具体的，上述步骤S13中，基于景区列表确定目标行程的推荐路线，可以包括：
基于目标行程的行程计划时长以及景区列表中各景区的合理停留时长，确定景区列表中第j个景区的预计停留时长；
在第j个景区对应的优质路线集合中选取符合预计停留时长的路线， 作为第j个景区的推荐路线。
示例性地，可以基于各景区的合理停留时长，确定各景区的预计停留时长的比例。根据该比例以及目标行程的行程计划时长与路程时长的差值，确定各景区的预计停留时长。
举例而言，在行程计划时长为7h(小时)，预计游览时长为5h，其中路程时长为1h，停留总时长为4h的情况下，基于景区列表确定目标行程的推荐路线中包含合理停留时长为2.5h和1.5h的两个景区，则两个景区的预计停留时长的比例应为5:3，根据行程计划时长与路程时长的差值6h和该比例，可以计算得到两个景区的预计停留时长分别为3.75h和2.25h。
本申请实施例中，可以预先配置各景区的优质路线集合。该优质路线集合可以基于历史数据得到。例如从历史数据中选取多个用户在景区内的路线，添加到该优质路线集合中。其中，选取的依据可以是用户的热度值或路线的热度值，热度值可以根据用户或路线被浏览次数、被评论次数等确定。
实际应用中，可以将优质路线集合对应的时长区间划分为多个子区间。例如，多个用户在景区内的路线所用时长均在1h至2h之间，则可以将时长区间[1h,2h]划分为子区间[1h,1.5h]和[1.5h,2h]。如果景区列表中第j个景区的预计停留时长为1.75h，则符合该预计停留时长的为子区间[1.5h,2h]，将停留时长在子区间[1.5h,2h]的路线确定为第j个景区的推荐路线。
根据上述实施方式，在确定景区列表的基础上，还可以针对景区列表中各景区，自动确定景区内的推荐路线，无需用户耗费大量时间和精力，推荐效率高。
本申请实施例还提供一种示例性的确定各景区对应的优质路线的方式。具体而言，上述路线推荐方法还可以包括：
从第j个景区的M个历史路线所经过的景点中，确定第j个景区的核心景点；其中，M为正整数；
基于第j个景区的核心景点，从M个历史路线中选取L个路线，并基于L个路线得到第j个景区对应的优质路线集合，其中，L为小于等于M的正整数。
示例性地，可以对M个历史路线所经过的景点进行统计，将其中被经过次数最多的Y个景点确定为核心景点。其中，Y为正整数。
示例性地，可以先对M个历史路线进行聚合处理，得到待选取的历史路线集合。例如，将M个历史路线
中覆盖的景点完全一致的路线视为同一路线，统计不同路线在
中的出现次数；将出现次数小于次数阈值例如3次、4次的路线剔除，基于剩余的路线得到待选区的历史路线集合。
示例性地，可以根据待选区的路线集合中每个历史路线所覆盖的核心景点的数量，选取L个路线。例如，景区中核心景点的数量为5，如果某个 历史路线覆盖的核心景点数量大于3，则可以选取该路线。
根据上述实施方式，基于核心景点得到景区内的优质路线集合，有利于为用户推荐核心景点覆盖率高、体验度高的景区内路线。
本申请实施例还提供一种确定各历史路线所经过的景点的方式。具体而言，上述路线推荐方法还可以包括：
对M个历史路线中的第k个历史路线所对应的用户定位点进行聚类，得到P个定位点簇；其中，k和P均为正整数；
基于第j个景区中各景点的位置信息，确定与P个定位点簇关联的P个景点，并将P个景点确定为第k个历史路线所经过的景点。
示例性地，可以根据各历史路线中用户定位点的空间距离进行聚类，得到多个定位点簇，剔除其中定位点密度较小的定位点簇，得到剩余的P个定位点簇。再根据P个定位点簇中每个定位点簇的中心与景区中各景点的距离，将每个定位点簇与最近的景点进行绑定，得到该历史路线所经过的景点。
利用聚类的方式，可以准确确定历史路线所经过的景点，从而提高挖掘核心景点的准确性，有利于为用户推荐最合适的景区内路线。
图3示出了本申请路线推荐方法的一个应用示例的示意图。如图3所示，本申请路线推荐方法，包括在线服务提供、离线数据挖掘和未来出行预估用时。
其中，离线数据挖掘包括：
步骤S311，挖掘景区的合理停留时长；
步骤S312，挖掘景区的核心景点；
步骤S313，确定景区的优质路线集合。
基于离线数据挖掘得到的信息，将被用于提供在线服务。
在线服务提供包括：
步骤S321，设置目标行程的相关信息。其中，相关信息包括起始时间、结束时间、行程起点、行程终点等。基于起始时间、结束时间可以计算得到行程计划时长。
步骤S322，输入景区列表。其中，采用轮询访问输入模块的方式，每次输入后计算预计游览时长，确定是否继续输入，直至预计游览时长与行程计划时长接近。其中，预计游览时长可根据景区的合理停留时长，结合未来出行预估用时进行计算。
步骤S323，确定推荐路线。其中，推荐路线可根据景区的核心景点以及优质路线集合确定。
根据本申请实施例的方法，可以基于输入的景区信息更新景区列表，在基于景区列表确定预计游览时长与行程计划时长的差距较小的情况下，确定推荐路线。因此，可以根据用户输入确定景区列表，合理设置行程中的景区数量，得到符合用户个性化需求的高质量推荐路线。
作为上述各方法的实现，本申请还提供了一种路线推荐装置。图4示出了本申请一个实施例中路线推荐装置的示意图。如图4所示，该装置包括：
信息获取模块410，用于获取针对目标行程输入的第i个景区信息；其中，i为正整数；
时长确定模块420，用于基于第i个景区信息，更新目标行程的景区列表，并基于景区列表确定预计游览时长；
路线确定模块430，用于在目标行程的行程计划时长与预计游览时长之间的差值小于预设阈值的情况下，基于景区列表确定目标行程的推荐路线。
示例性地，如图5所示，该装置还包括：
输入确定模块510，用于在目标行程的行程计划时长与预计游览时长之间的差值大于等于预设阈值的情况下，获取针对目标行程输入的第(i+1)个景区信息。
示例性地，如图5所示，时长确定模块420可以包括：
路程时长确定单元421，用于基于目标行程的行程起点、行程终点以及景区列表中各景区的位置信息，计算游览景区列表中各景区所需的路程时长；
总时长确定单元422，用于基于景区列表中各景区的合理停留时长以及路程时长，确定预计游览时长。
示例性地，路程时长确定单元421用于：
基于景区列表，确定N个游览次序；其中，N为正整数；
基于目标行程的行程起点、行程终点以及景区列表中各景区的位置信息，计算与N个游览次序分别对应的N个路程时长；
将N个路程时长中的最小值，确定为游览景区列表中各景区所需的路程时长。
示例性地，路线确定模块430用于：
将基于景区列表得到的N个路程时长中的最小值所对应的游览次序，确定为目标行程的推荐路线中各景区的游览次序。
示例性地，如图5所示，路线确定模块430可以包括：
停留时长确定单元431，用于基于目标行程的行程计划时长以及景区列表中各景区的合理停留时长，确定景区列表中第j个景区的预计停留时长；
景区路线确定单元432，用于在第j个景区对应的优质路线集合中选取符合预计停留时长的路线，作为第j个景区的推荐路线。
示例性地，如图5所示，该装置还包括：
核心景点挖掘模块520，用于从第j个景区的M个历史路线所经过的景点中，确定第j个景区的核心景点；其中，M为正整数；
路线选取模块530，用于基于第j个景区的核心景点，从M个历史路线中选取L个路线，并基于L个路线得到第j个景区对应的优质路线集合，其中，L为小于等于M的正整数。
示例性地，如图5所示，该装置还包括：
定位点聚类模块540，用于对M个历史路线中的第k个历史路线所对应的用户定位点进行聚类，得到P个定位点簇；其中，k和P均为正整数；
景点确定模块550，用于基于第j个景区中各景点的位置信息，确定与P个定位点簇关联的P个景点，并将P个景点确定为第k个历史路线所经过的景点。
本申请实施例提供的装置，能够实现本申请实施例提供的方法，具备相应的有益效果。
根据本公开的实施例，本公开还提供了一种电子设备、一种可读存储介质和一种计算机程序产品。
图6示出了可以用来实施本公开的实施例的示例电子设备600的示意性框图。电子设备旨在表示各种形式的数字计算机，诸如，膝上型计算机、台式计算机、工作台、个人数字助理、服务器、刀片式服务器、大型计算机、和其它适合的计算机。电子设备还可以表示各种形式的移动装置，诸如，个人数字处理、蜂窝电话、智能电话、可穿戴设备和其它类似的计算装置。本文所示的部件、它们的连接和关系、以及它们的功能仅仅作为示例，并且不意在限制本文中描述的和/或者要求的本公开的实现。
如图6所示，设备600包括计算单元601，其可以根据存储在只读存储器(ROM)602中的计算机程序或者从存储单元608加载到随机访问存储器(RAM)603中的计算机程序，来执行各种适当的动作和处理。在RAM 603中，还可存储设备600操作所需的各种程序和数据。计算单元601、ROM 602以及RAM 603通过总线604彼此相连。输入/输出(I/O)接口605也连接至总线604。
设备600中的多个部件连接至I/O接口605，包括：输入单元606，例如键盘、鼠标等；输出单元607，例如各种类型的显示器、扬声器等；存储单元608，例如磁盘、光盘等；以及通信单元609，例如网卡、调制解调器、无线通信收发机等。通信单元609允许设备600通过诸如因特网的计算机网络和/或各种电信网络与其他设备交换信息/数据。
计算单元601可以是各种具有处理和计算能力的通用和/或专用处理组件。计算单元601的一些示例包括但不限于中央处理单元(CPU)、图形处理单元(GPU)、各种专用的人工智能(AI)计算芯片、各种运行机器学习模型算法的计算单元、数字信号处理器(DSP)、以及任何适当的处理器、控制器、微控制器等。计算单元601执行上文所描述的各个方法和处理，例如路线推荐方法。例如，在一些实施例中，路线推荐方法可被实现为计算机软件程序，其被有形地包含于机器可读介质，例如存储单元608。在一 些实施例中，计算机程序的部分或者全部可以经由ROM 602和/或通信单元609而被载入和/或安装到设备600上。当计算机程序加载到RAM 603并由计算单元601执行时，可以执行上文描述的路线推荐方法的一个或多个步骤。备选地，在其他实施例中，计算单元601可以通过其他任何适当的方式(例如，借助于固件)而被配置为执行路线推荐方法。
本文中以上描述的系统和技术的各种实施方式可以在数字电子电路系统、集成电路系统、场可编程门阵列(FPGA)、专用集成电路(ASIC)、专用标准产品(ASSP)、芯片上系统的系统(SOC)、负载可编程逻辑设备(CPLD)、计算机硬件、固件、软件、和/或它们的组合中实现。这些各种实施方式可以包括：实施在一个或者多个计算机程序中，该一个或者多个计算机程序可在包括至少一个可编程处理器的可编程系统上执行和/或解释，该可编程处理器可以是专用或者通用可编程处理器，可以从存储系统、至少一个输入装置、和至少一个输出装置接收数据和指令，并且将数据和指令传输至该存储系统、该至少一个输入装置、和该至少一个输出装置。
用于实施本公开的方法的程序代码可以采用一个或多个编程语言的任何组合来编写。这些程序代码可以提供给通用计算机、专用计算机或其他可编程数据处理装置的处理器或控制器，使得程序代码当由处理器或控制器执行时使流程图和/或框图中所规定的功能/操作被实施。程序代码可以完全在机器上执行、部分地在机器上执行，作为独立软件包部分地在机器上执行且部分地在远程机器上执行或完全在远程机器或服务器上执行。
在本公开的上下文中，机器可读介质可以是有形的介质，其可以包含或存储以供指令执行系统、装置或设备使用或与指令执行系统、装置或设备结合地使用的程序。机器可读介质可以是机器可读信号介质或机器可读储存介质。机器可读介质可以包括但不限于电子的、磁性的、光学的、电磁的、红外的、或半导体系统、装置或设备，或者上述内容的任何合适组合。机器可读存储介质的更具体示例会包括基于一个或多个线的电气连接、便携式计算机盘、硬盘、随机存取存储器(RAM)、只读存储器(ROM)、可擦除可编程只读存储器(EPROM或快闪存储器)、光纤、便捷式紧凑盘只读存储器(CD-ROM)、光学储存设备、磁储存设备、或上述内容的任何合适组合。
为了提供与用户的交互，可以在计算机上实施此处描述的系统和技术，该计算机具有：用于向用户显示信息的显示装置(例如，CRT(阴极射线管)或者LCD(液晶显示器)监视器)；以及键盘和指向装置(例如，鼠标或者轨迹球)，用户可以通过该键盘和该指向装置来将输入提供给计算机。其它种类的装置还可以用于提供与用户的交互；例如，提供给用户的反馈可以是任何形式的传感反馈(例如，视觉反馈、听觉反馈、或者触觉反馈)；并且可以用任何形式(包括声输入、语音输入或者、触觉输入)来接收来自用户的输入。
可以将此处描述的系统和技术实施在包括后台部件的计算系统(例如，作为数据服务器)、或者包括中间件部件的计算系统(例如，应用服务器)、或者包括前端部件的计算系统(例如，具有图形用户界面或者网络浏览器的用户计算机，用户可以通过该图形用户界面或者该网络浏览器来与此处描述的系统和技术的实施方式交互)、或者包括这种后台部件、中间件部件、或者前端部件的任何组合的计算系统中。可以通过任何形式或者介质的数字数据通信(例如，通信网络)来将系统的部件相互连接。通信网络的示例包括：局域网(LAN)、广域网(WAN)和互联网。
计算机系统可以包括客户端和服务器。客户端和服务器一般远离彼此并且通常通过通信网络进行交互。通过在相应的计算机上运行并且彼此具有客户端-服务器关系的计算机程序来产生客户端和服务器的关系。
应该理解，可以使用上面所示的各种形式的流程，重新排序、增加或删除步骤。例如，本公开中记载的各步骤可以并行地执行也可以顺序地执行也可以不同的次序执行，只要能够实现本公开公开的技术方案所期望的结果，本文在此不进行限制。
上述具体实施方式，并不构成对本公开保护范围的限制。本领域技术人员应该明白的是，根据设计要求和其他因素，可以进行各种修改、组合、子组合和替代。任何在本公开的精神和原则之内所作的修改、等同替换和改进等，均应包含在本公开保护范围之内。
Claims (19)
- 一种路线推荐方法，包括：获取针对目标行程输入的第i个景区信息；其中，i为正整数；基于所述第i个景区信息，更新所述目标行程的景区列表，并基于所述景区列表确定预计游览时长；在所述目标行程的行程计划时长与所述预计游览时长之间的差值小于预设阈值的情况下，基于所述景区列表确定所述目标行程的推荐路线。
- 根据权利要求1所述的方法，还包括：在所述目标行程的行程计划时长与所述预计游览时长之间的差值大于等于预设阈值的情况下，获取针对所述目标行程输入的第(i+1)个景区信息。
- 根据权利要求1或2所述的方法，其中，所述基于所述景区列表确定预计游览时长，包括：基于所述目标行程的行程起点、行程终点以及所述景区列表中各景区的位置信息，计算游览所述景区列表中各景区所需的路程时长；基于所述景区列表中各景区的合理停留时长以及所述路程时长，确定所述预计游览时长。
- 根据权利要求3所述的方法，其中，所述基于所述目标行程的行程起点、行程终点以及所述景区列表中各景区的位置信息，计算游览所述景区列表中各景区所需的路程时长，包括：基于所述景区列表，确定N个游览次序；其中，N为正整数；基于所述目标行程的行程起点、行程终点以及所述景区列表中各景区的位置信息，计算与所述N个游览次序分别对应的N个路程时长；将所述N个路程时长中的最小值，确定为游览所述景区列表中各景区所需的路程时长。
- 根据权利要求4所述的方法，其中，所述基于所述景区列表确定所述目标行程的推荐路线，包括：将基于所述景区列表得到的所述N个路程时长中的最小值所对应的游览次序，确定为所述目标行程的推荐路线中各景区的游览次序。
- 根据权利要求1或2所述的方法，其中，所述基于所述景区列表确定所述目标行程的推荐路线，包括：基于所述目标行程的行程计划时长以及所述景区列表中各景区的合理停留时长，确定所述景区列表中第j个景区的预计停留时长；在所述第j个景区对应的优质路线集合中选取符合所述预计停留时长的路线，作为所述第j个景区的推荐路线。
- 根据权利要求6所述的方法，还包括：从所述第j个景区的M个历史路线所经过的景点中，确定所述第j个景区的核心景点；其中，M为正整数；基于所述第j个景区的核心景点，从所述M个历史路线中选取L个路线，并基于所述L个路线得到所述第j个景区对应的优质路线集合，其中，L为小于等于M的正整数。
- 根据权利要求7所述的方法，还包括：对所述M个历史路线中的第k个历史路线所对应的用户定位点进行聚类，得到P个定位点簇；其中，k和P均为正整数；基于所述第j个景区中各景点的位置信息，确定与所述P个定位点簇关联的P个景点，并将所述P个景点确定为所述第k个历史路线所经过的景点。
- 一种路线推荐装置，包括：信息获取模块，用于获取针对目标行程输入的第i个景区信息；其中，i为正整数；时长确定模块，用于基于所述第i个景区信息，更新所述目标行程的景区列表，并基于所述景区列表确定预计游览时长；路线确定模块，用于在所述目标行程的行程计划时长与所述预计游览时长之间的差值小于预设阈值的情况下，获取针对所述目标行程输入的第(i+1)个景区信息。
- 根据权利要求9所述的装置，还包括：输入确定模块，用于在所述目标行程的行程计划时长与所述预计游览时长之间的差值大于等于预设阈值的情况下，确定继续针对所述目标行程输入景区信息。
- 根据权利要求9或10所述的装置，其中，所述时长确定模块包括：路程时长确定单元，用于基于所述目标行程的行程起点、行程终点以及所述景区列表中各景区的位置信息，计算游览所述景区列表中各景区所需的路程时长；总时长确定单元，用于基于所述景区列表中各景区的合理停留时长以及所述路程时长，确定所述预计游览时长。
- 根据权利要求11所述的装置，其中，所述路程时长确定单元用于：基于所述景区列表，确定N个游览次序；其中，N为正整数；基于所述目标行程的行程起点、行程终点以及所述景区列表中各景区的位置信息，计算与所述N个游览次序分别对应的N个路程时长；将所述N个路程时长中的最小值，确定为游览所述景区列表中各景区所需的路程时长。
- 根据权利要求12所述的装置，其中，所述路线确定模块用于：将基于所述景区列表得到的所述N个路程时长中的最小值所对应的游览次序，确定为所述目标行程的推荐路线中各景区的游览次序。
- 根据权利要求9或10所述的装置，其中，所述路线确定模块包括：停留时长确定单元，用于基于所述目标行程的行程计划时长以及所述 景区列表中各景区的合理停留时长，确定所述景区列表中第j个景区的预计停留时长；景区路线确定单元，用于在所述第j个景区对应的优质路线集合中选取符合所述预计停留时长的路线，作为所述第j个景区的推荐路线。
- 根据权利要求14所述的装置，还包括：核心景点挖掘模块，用于从所述第j个景区的M个历史路线所经过的景点中，确定所述第j个景区的核心景点；其中，M为正整数；路线选取模块，用于基于所述第j个景区的核心景点，从所述M个历史路线中选取L个路线，并基于所述L个路线得到所述第j个景区对应的优质路线集合，其中，L为小于等于M的正整数。
- 根据权利要求15所述的装置，还包括：定位点聚类模块，用于对所述M个历史路线中的第k个历史路线所对应的用户定位点进行聚类，得到P个定位点簇；其中，k和P均为正整数；景点确定模块，用于基于所述第j个景区中各景点的位置信息，确定与所述P个定位点簇关联的P个景点，并将所述P个景点确定为所述第k个历史路线所经过的景点。
- 一种电子设备，其特征在于，包括：至少一个处理器；以及与所述至少一个处理器通信连接的存储器；其中，所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行权利要求1-8中任一项所述的方法。
- 一种存储有计算机指令的非瞬时计算机可读存储介质，其特征在于，所述计算机指令用于使计算机执行权利要求1-8中任一项所述的方法。
- 一种计算机程序产品，包括计算机程序，该计算机程序在被处理器执行时实现根据权利要求1-8中任一项所述的方法。
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP21790349.1A EP4044048A4 (en) | 2020-12-24 | 2021-06-02 | ROUTE RECOMMENDATION METHOD AND APPARATUS, ELECTRONIC DEVICE AND STORAGE MEDIA |
| JP2021564193A JP2023510659A (ja) | 2020-12-24 | 2021-06-02 | 経路推奨方法、装置、電子デバイス、記憶媒体、及びプログラム |
| KR1020217041176A KR20220003624A (ko) | 2020-12-24 | 2021-06-02 | 노선 추천 방법, 장치, 전자기기, 저장매체 및 컴퓨터 프로그램 |
| US17/594,655 US20240110796A1 (en) | 2020-12-24 | 2021-06-02 | Route recommendation method, electronic device, and storage medium |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011573267.1A CN112559891A (zh) | 2020-12-24 | 2020-12-24 | 路线推荐方法、装置、电子设备和存储介质 |
| CN202011573267.1 | 2020-12-24 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2022134479A1 true WO2022134479A1 (zh) | 2022-06-30 |
Family
ID=75033509
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2021/097905 WO2022134479A1 (zh) | 2020-12-24 | 2021-06-02 | 路线推荐方法、装置、电子设备和存储介质 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112559891A (zh) |
| WO (1) | WO2022134479A1 (zh) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114997531A (zh) * | 2022-07-20 | 2022-09-02 | 枣庄山好科技有限公司 | 一种实时运力智能推荐方法及系统 |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559891A (zh) * | 2020-12-24 | 2021-03-26 | 北京百度网讯科技有限公司 | 路线推荐方法、装置、电子设备和存储介质 |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106886837A (zh) * | 2017-02-21 | 2017-06-23 | 携程旅游网络技术（上海）有限公司 | 基于时间规划的自由行行程推荐方法 |
| US20180094943A1 (en) * | 2016-08-22 | 2018-04-05 | Microsoft Technology Licensing, Llc | Generating personalized routes with user route preferences |
| CN109165786A (zh) * | 2018-08-31 | 2019-01-08 | 深圳春沐源控股有限公司 | 一种导游方案的规划方法及服务器 |
| CN111768035A (zh) * | 2020-06-29 | 2020-10-13 | 北京三快在线科技有限公司 | 路径推荐信息推送方法、装置、计算机设备及存储介质 |
| CN112559891A (zh) * | 2020-12-24 | 2021-03-26 | 北京百度网讯科技有限公司 | 路线推荐方法、装置、电子设备和存储介质 |
-
2020
- 2020-12-24 CN CN202011573267.1A patent/CN112559891A/zh active Pending
-
2021
- 2021-06-02 WO PCT/CN2021/097905 patent/WO2022134479A1/zh active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180094943A1 (en) * | 2016-08-22 | 2018-04-05 | Microsoft Technology Licensing, Llc | Generating personalized routes with user route preferences |
| CN106886837A (zh) * | 2017-02-21 | 2017-06-23 | 携程旅游网络技术（上海）有限公司 | 基于时间规划的自由行行程推荐方法 |
| CN109165786A (zh) * | 2018-08-31 | 2019-01-08 | 深圳春沐源控股有限公司 | 一种导游方案的规划方法及服务器 |
| CN111768035A (zh) * | 2020-06-29 | 2020-10-13 | 北京三快在线科技有限公司 | 路径推荐信息推送方法、装置、计算机设备及存储介质 |
| CN112559891A (zh) * | 2020-12-24 | 2021-03-26 | 北京百度网讯科技有限公司 | 路线推荐方法、装置、电子设备和存储介质 |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114997531A (zh) * | 2022-07-20 | 2022-09-02 | 枣庄山好科技有限公司 | 一种实时运力智能推荐方法及系统 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112559891A (zh) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10578445B2 (en) | Method and apparatus for building an itinerary-planning model and planning a traveling itinerary | |
| WO2022134479A1 (zh) | 路线推荐方法、装置、电子设备和存储介质 | |
| US20190329788A1 (en) | Road condition status prediction method, device, and server, and storage medium | |
| JP6660467B2 (ja) | 旅行ルート計画方法、計画サーバー及び記憶媒体 | |
| US11630560B2 (en) | Map information display method and apparatus, electronic device, and computer storage medium | |
| US20230243661A1 (en) | Navigation path planning method and apparatus, device, and storage medium | |
| JP6787624B2 (ja) | 音声指紋の照合のための方法、マシン可読媒体及びシステム | |
| CN104156897A (zh) | 基于情景感知的室内导览系统 | |
| US20230063099A1 (en) | Method and apparatus for correcting positioning information, and storage medium | |
| WO2023168909A1 (zh) | 地理预训练模型的预训练方法及模型微调方法 | |
| US11954084B2 (en) | Method and apparatus for processing table, device, and storage medium | |
| US20230195998A1 (en) | Sample generation method, model training method, trajectory recognition method, device, and medium | |
| US20230100734A1 (en) | Positioning method and apparatus, device, system, medium and self-driving vehicle | |
| US11816443B2 (en) | Method, device, and storage medium for generating response | |
| CN113326450B (zh) | 一种兴趣点召回方法、装置、电子设备和存储介质 | |
| US20230229913A1 (en) | Method and Apparatus for Training Information Adjustment Model of Charging Station, and Storage Medium | |
| US20230075033A1 (en) | Ride-hailing method and apparatus, electronic device and readable storage medium | |
| CN116186200B (zh) | 模型训练方法、装置、电子设备和存储介质 | |
| CN113836446B (zh) | 出行信息的向量化表示方法及装置 | |
| US11934449B2 (en) | Method and apparatus for processing map information, and storage medium | |
| US20210389156A1 (en) | Map rendering method and apparatus, device, and storage medium | |
| US20220276068A1 (en) | Navigation method, navigation apparatus, device and storage medium | |
| US11976935B2 (en) | Route recommendation method, electronic device, and storage medium | |
| EP4044048A1 (en) | Route recommendation method and apparatus, electronic device, and storage medium | |
| CN113361574A (zh) | 数据处理模型的训练方法、装置、电子设备及存储介质 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| ENP | Entry into the national phase |
Ref document number: 2021564193 Country of ref document: JP Kind code of ref document: A |
|
| ENP | Entry into the national phase |
Ref document number: 2021790349 Country of ref document: EP Effective date: 20211027 |
|
| ENP | Entry into the national phase |
Ref document number: 20217041176 Country of ref document: KR Kind code of ref document: A |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 17594655 Country of ref document: US |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |