Travel information updating method, storage medium and electronic equipment
By obtaining and updating itinerary information and determining the replacement itinerary, the problem of missing information caused by itinerary changes is solved, the timely supplement and integrity of itinerary information is achieved, and the smooth progress of activity management is ensured.
Patent Information
- Application Number
- CN202411091420.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-08-09
AI Technical Summary
In major events, the itinerary information of participants is prone to change during the actual travel process, resulting in the original planned itinerary being no longer accurate and the personnel itinerary information is missing, affecting the smooth progress of the overall arrangement.
By obtaining the planned itinerary chain of the target person, obtaining the passenger ticket checking information list, confirming that the sub-its are not executed, generating replacement itinerary information, and traversing the set of trips to be detected in the preset travel period, comparing the arrival and adjacent places to determine the replacement Itinerary, send replacement itinerary information to the target personnel for confirmation and update.
Ensure the integrity of the itinerary information, fill in the missing information in a timely manner, and re-place relevant replacement itinerary orders to avoid plan failure caused by itinerary changes.
Smart Images

Figure CN119090422A_ABST
Abstract
Description
Background Art
[0002] In the organization and management of major events (such as international conferences, sports events, large-scale celebrations, etc.), it is particularly important to obtain the itinerary information of participants. It is related to the following aspects: security screening and risk management, public health management, transportation and accommodation arrangements, event schedule coordination and emergency response.
[0003] Usually, the itinerary information of the participants of relevant activities is registered in advance so as to make advance management arrangements. However, during the actual travel, due to various reasons, some people's itinerary chain may be partially or even completely changed, resulting in the original itinerary being inaccurate and the itinerary information of the people being missing, which ultimately leads to the problem that the relevant overall arrangements cannot be carried out smoothly. Summary of the invention
[0004] In view of the above technical problems, the technical solution adopted by the present invention is:
[0005] According to one aspect of the present invention, a method for updating itinerary information is provided, the method comprising the following steps:
[0006] Get the planned itinerary chain of the target person (D1, D2, ..., D i , …, D n ). Among them, D i is the information of the sub-trip ranked in the i-th position in the planned trip chain, D i =(SP i ,ST i , E.P. i , E.T. i , F i ),SP i and EP i D i Departure and destination. ST i and ET i D i Departure time and arrival time. i D i The trip ID of the
[0007] When the time reaches the actual departure time corresponding to any sub-trip information, obtain the passenger ticket checking information list of the corresponding departure place in the sub-trip information.
[0008] If the ticket checking information corresponding to the target person does not exist in the passenger ticket checking information list, it is determined that the trip corresponding to the sub-trip information is an unexecuted sub-trip.
[0009] According to the information in the planned itinerary chain, the itinerary information of the unexecuted sub-trips is updated to generate the replacement itinerary information of the target person.
[0010] The replacement itinerary information is sent to the terminal corresponding to the target person for confirmation.
[0011] Based on the confirmation information, the itinerary chain information of the target person is replaced and updated to generate the actual itinerary chain.
[0012] The update process includes:
[0013] Obtain a set of itinerary information to be detected for the target person in the preset travel period. The set of itinerary information to be detected includes sub-trip information corresponding to the orders that have been carried out and the orders that have not been carried out in the preset travel period. The departure time of the unexecuted sub-trip is within the preset travel period.
[0014] The set of trip information to be detected is traversed. If the destination in any sub-trip information is the same as the destination corresponding to the unexecuted sub-trip, and the arrival time is earlier than the departure time corresponding to the next sub-trip adjacent to the unexecuted sub-trip, the sub-trip information is determined to be the replacement sub-trip information.
[0015] If the destinations in all subtrip information are different from the destinations corresponding to the unexecuted subtrip, then the adjacent destinations corresponding to the destinations in the unexecuted subtrip are obtained. The adjacent destinations are areas whose distance from the destinations in the unexecuted subtrip is less than a preset distance threshold.
[0016] The to-be-detected trip information set is traversed again. If the destination in any sub-trip information is the same as any adjacent destination, and the arrival time is earlier than the transfer departure time corresponding to the adjacent destination, the sub-trip information is determined to be replacement sub-trip information.
[0017] According to a second aspect of the present invention, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned method for updating travel information is implemented.
[0018] According to a third aspect of the present invention, an electronic device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned method for updating travel information when executing the computer program.
[0019] The present invention has at least the following beneficial effects:
[0020] When a person's itinerary changes, usually, the departure place, destination and final arrival time will not change, and generally some sub-trips in multiple itinerary chains will be replaced and changed. Therefore, they will re-place orders for related replacement trips. Based on this, in the present invention, by comparing the arrival place in the itinerary information set to be detected with the arrival place and nearby places corresponding to the unexecuted sub-trip, as well as the relevant arrival times during the update process, it is possible to determine the replacement itinerary corresponding to one or several sub-trips. After determining the replacement itinerary, the corresponding replacement information is sent to the target person for reconfirmation, and then updated according to the confirmation result. In this way, the missing itinerary information of the target person can be supplemented and updated more timely to ensure the integrity of the itinerary information of the target person. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0022] Figure 1 The present invention provides a flowchart of a method for updating travel information according to an embodiment of the present invention.
[0023] Figure 2 A flowchart of a method for generating a personnel travel missing warning provided in an embodiment of the present invention. DETAILED DESCRIPTION
[0024] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.
[0025] As a possible embodiment of the present invention, Figure 1 As shown, a method for updating itinerary information is provided, the method comprising the following steps:
[0026] S100: Obtain the planned itinerary chain (D1, D2, ..., D i , …, D n ). Among them, D i is the information of the sub-trip ranked in the i-th position in the planned trip chain, D i =(SP i ,ST i , E.P. i , E.T. i, F i ),SP i and EP i D i Departure and destination. ST i and ET i D i Departure time and arrival time. i D i The itinerary ID. For example, F i It can be a flight number, a train number, a bus number, or a ferry number. It can also be the order number corresponding to each itinerary order. Usually, the above itinerary information can obtain the corresponding itinerary information data from the corresponding travel management platform. And the itinerary information data also needs to set the corresponding update frequency. Since there will be different degrees of delays in the actual operation process, it will usually cause changes in the departure time and arrival time of the corresponding itinerary information. Therefore, in order to ensure the accuracy of the actual departure time in S200, the itinerary information needs to be updated, such as every 5 minutes or 10 minutes. The target person in this step can be a participant in a certain activity, such as a contestant in a sports meeting.
[0027] S200: When the time reaches the actual departure time corresponding to any sub-trip information, a passenger ticket checking information list of the corresponding departure place in the sub-trip information is obtained.
[0028] S300: If the ticket checking information corresponding to the target person does not exist in the passenger ticket checking information list, it is determined that the trip corresponding to the sub-trip information is an unexecuted sub-trip.
[0029] Usually, before the corresponding trip begins, the passengers will be checked in, such as the check-in ticket check at the airport and the ticket check-in at the high-speed rail station. Therefore, the corresponding passenger information will be collected in the passenger ticket check information list. Therefore, the passenger ticket check information can be used to know whether the target person has taken the corresponding flight or train as planned. Then the unexecuted sub-trip can be determined.
[0030] S400: updating the itinerary information of the unexecuted sub-trips according to the information in the planned itinerary chain, and generating replacement itinerary information of the target person.
[0031] The update process includes:
[0032] S401: Obtain a set of itinerary information to be detected of a target person in a preset travel period. The set of itinerary information to be detected includes sub-trip information corresponding to the orders that have been carried out and the orders that have not been carried out in the preset travel period. The departure time of the unexecuted sub-trip is within the preset travel period.
[0033] Usually the preset travel time period can be determined based on the earliest and latest time of all optional change itineraries corresponding to the target person.
[0034] Specifically, the preset travel time period is obtained according to the following steps:
[0035] S411: The arrival time of the last sub-trip in the planned trip chain is used as the end time of the preset travel period.
[0036] The arrival time of the last sub-trip may also be replaced by the latest arrival time allowed by the target person according to actual conditions.
[0037] S421: Obtain the departure time and departure place of the unexecuted sub-trip.
[0038] S431: Determine the retention coefficient corresponding to the departure place according to the preset mapping table. The retention coefficient is used to indicate the degree of influence of different attributes of the departure place on the retention time of the target person in the local area.
[0039] The preset mapping table needs to be determined in advance, where the detention attributes corresponding to the departure place may include whether the departure place is a tourist city, whether there are people with high relevance to the target person (such as family members) at the departure place, and the weather conditions at the departure place during the corresponding departure period. The corresponding detention coefficient can be roughly determined based on the influence of the above attributes on the length of the person's detention time, Q zl It can be the sum of all retention coefficient terms.
[0040] S441: According to the retention coefficient Q zl and the departure time ST of the unexecuted sub-trip, determine the starting time T of the preset travel period qs . T qs The following conditions must be met:
[0041] T2 is the basic length of stay. For example, T2 can be two days.
[0042] Generally, if the target person needs to stay at the corresponding departure place for a certain period of time, he / she will advance the original departure time by the corresponding length of stay time and arrive at the departure place in advance to reserve time for staying there. Therefore, the departure time in the unexecuted sub-trip can be determined according to the stay coefficient to determine the start time of the preset travel period.
[0043] S402: Traverse the set of trip information to be detected. If the destination in any sub-trip information is the same as the destination corresponding to the unexecuted sub-trip, and the arrival time is earlier than the departure time corresponding to the next sub-trip adjacent to the unexecuted sub-trip, then determine that the sub-trip information is replacement sub-trip information.
[0044] S403: If the destinations in all subtrip information are different from the destinations corresponding to the unexecuted subtrip, obtain the adjacent destinations corresponding to the destinations in the unexecuted subtrip. The adjacent destination is an area whose distance from the destination in the unexecuted subtrip is less than a preset distance threshold. The preset distance threshold may be 100 km.
[0045] Usually, when replacing an itinerary, the destination can also be selected as a city near the original destination (i.e., a nearby destination). For example, if the original destination is Tianjin Station, the corresponding nearby destinations can include Beijing, Tangshan, Langfang, Cangzhou, etc. Nearby destinations are generally based on prefecture-level cities as the smallest unit. The original destination can generally be the corresponding airport, station or dock, etc. The distance between the nearby destination and the destination in the unexecuted sub-trip can be obtained through the map navigation platform, and the distance can be the maximum self-driving distance.
[0046] Then, the user drives the vehicle or uses other methods to reach the next departure point. Therefore, when performing traversal comparison, the user should not only compare the original destination, but also compare the nearby destination of the original destination to improve the accuracy of determining the replacement itinerary.
[0047] S404: traverse the trip information set to be detected again, and if the destination in any sub-trip information is the same as any adjacent destination, and the arrival time is earlier than the transfer departure time corresponding to the adjacent destination, determine that the sub-trip information is replacement sub-trip information.
[0048] Specifically, the transfer departure time corresponding to any nearby destination is obtained by following the steps below:
[0049] S414: Obtain the subsequent departure location and the subsequent departure time T corresponding to the unexecuted sub-trip jx The subsequent departure place and the subsequent departure time are respectively the departure place and departure time of the next sub-trip in the planned trip chain that is adjacent to the unexecuted sub-trip.
[0050] S424: Obtain the longest travel time T from the nearest arrival point to the subsequent departure point MAX . The longest travel time is T MAX Generally, it can be the driving time.
[0051] S434: According to T jx and T Max , generate the transfer departure time T corresponding to the destination zc . T zc The following conditions must be met:
[0052] T zc =T jx -T Max -T1. T1 is the preset additional time. For example, T1 = 20 minutes.
[0053] This step can more accurately calculate the longest time from the nearest arrival point to the subsequent departure point, and then determine the departure time based on this time, where T1 is used to represent the reserved time corresponding to the ticket inspection at the station.
[0054] S405: If the destinations in all the sub-trip information are different from each adjacent destination, the next sub-trip in the planned trip chain adjacent to the current unexecuted sub-trip is used as a new unexecuted sub-trip.
[0055] S406: Update the itinerary information of the new unexecuted sub-trip to generate replacement itinerary information of the target person.
[0056] Using the new unexecuted sub-trip, steps S401 to S404 are repeatedly executed in a loop to update each sub-trip in the planned trip chain in turn.
[0057] Since the target person may directly replace the original two or more connected sub-trips with a longer sub-trip when changing the travel plan, the corresponding replacement trip can only be determined when the last replaced sub-trip is regarded as an unexecuted sub-trip in the update comparison. Therefore, it is necessary to perform a cyclic comparison all the time.
[0058] And if the unexecuted sub-trip is the last sub-trip in the planned trip chain, the generation of new unexecuted sub-trips will be stopped after the update process is completed.
[0059] S500: Send the replacement itinerary information to the terminal corresponding to the target person for confirmation.
[0060] In this step, the determined replacement itinerary information is sent to the target person for reconfirmation. At the same time, the target person can also be allowed to edit the itinerary replacement information again to ensure the accuracy of the itinerary replacement information.
[0061] S600: According to the confirmation information, the itinerary chain information of the target person is replaced and updated to generate an actual itinerary chain.
[0062] In this embodiment, by comparing the destination in the itinerary information set to be detected with the destination and nearby destinations corresponding to the unexecuted sub-trips, as well as the relevant arrival times, a replacement itinerary corresponding to one or several sub-trips can be determined in the update process. After the replacement itinerary is determined, the corresponding replacement information is sent to the target person for reconfirmation, and then updated according to the confirmation result. In this way, the missing itinerary information of the target person can be supplemented and updated more timely to ensure the integrity of the itinerary information of the target person.
[0063] As another possible embodiment of the present invention, Figure 2As shown, a method for generating a missing trip warning for a person is also provided, which is used to determine the number of missing trips according to the above-mentioned replacement trip determination method, and generate a warning accordingly. The method comprises the following steps:
[0064] W100: Get the total number W of sub-trips included in the planned trip chain of the target person.
[0065] W200: During the process of executing the trip, when there is an unexecuted sub-trip, obtain the trip information set to be detected of the target person in the preset travel period. The trip information set to be detected includes the sub-trip information corresponding to the orders that have been traveled and the orders that have not been traveled in the preset travel period. The departure time of the unexecuted sub-trip is within the preset travel period.
[0066] W300: Perform trip replacement processing on the trip information in the planned trip chain according to the trip information set to be detected, and generate the number U of missing sub-trips corresponding to the planned trip chain.
[0067] The itinerary replacement process includes:
[0068] W301: Compare and count the sub-trips that are not currently executed with each sub-trip in the trip information set to be detected, and generate the number of replacement sub-trips and missing sub-trips corresponding to the sub-trips that are not currently executed.
[0069] Comparison counting processing includes:
[0070] W311: Traverse the set of itinerary information to be checked. If the destination in any sub-trip information is different from the destination corresponding to the unexecuted sub-trip and the adjacent destination corresponding to the unexecuted sub-trip, the unexecuted sub-trip is determined to be missing, and the number of missing sub-trips corresponding to the planned itinerary chain is accumulated and added by one. The adjacent destination is an area whose distance from the corresponding destination is less than a preset distance threshold.
[0071] W321: Traverse the set of itinerary information to be checked. If the destination in any sub-trip information is the same as the destination corresponding to the unexecuted sub-trip, and the arrival time is earlier than the departure time corresponding to the next sub-trip adjacent to the unexecuted sub-trip, then determine that the sub-trip is the replacement sub-trip corresponding to the unexecuted sub-trip, and configure the number of missing sub-trips corresponding to the planned itinerary chain to zero.
[0072] W331: If the destinations in all sub-trip information are different from the destinations corresponding to the unexecuted sub-trips, obtain the adjacent destinations corresponding to the destinations in the unexecuted sub-trips.
[0073] W341: Traverse the trip information set to be checked again. If the destination in any sub-trip information is the same as any adjacent destination, and the arrival time is earlier than the transfer departure time corresponding to the adjacent destination, then the sub-trip is determined to be a replacement sub-trip corresponding to the unexecuted sub-trip, and the number of missing sub-trips corresponding to the planned trip chain is configured to zero.
[0074] W302: If there is no replacement subtrip for the current unexecuted subtrip, the next subtrip adjacent to the current unexecuted subtrip in the planned trip chain is used as the new unexecuted subtrip. If the unexecuted subtrip is the last subtrip in the planned trip chain, stop generating new unexecuted subtrips after the update process is completed.
[0075] The method for determining the replacement sub-stroke corresponding to the current unexecuted sub-stroke in the above comparison and counting process is the same as the method for determining the replacement sub-stroke in the above embodiment. In this embodiment, only the method for counting the number of missing sub-strokes is added. Specifically, when any current unexecuted sub-stroke does not have a corresponding replacement sub-stroke, the number of missing sub-strokes will be accumulated by 1, and a new unexecuted sub-stroke will be determined, and then the determination of the replacement sub-stroke corresponding to the new unexecuted sub-stroke will continue. Once it is determined that any current unexecuted sub-stroke has a corresponding replacement sub-stroke, the number of missing sub-strokes will be cleared. In this way, the number of missing strokes is determined.
[0076] W400: Generate the trip missing level L corresponding to the target person based on W and U. L satisfies the following conditions:
[0077] L=U / W.
[0078] W500: Generates corresponding warning information according to the level of trip loss and sends it to the preset terminal.
[0079] The preset terminals include the background detection terminal and the mobile terminal held by the target personnel. Different levels of missing itinerary will generate different colors of warning information.
[0080] In this embodiment, when there is an unexecuted sub-trip, each sub-trip in the target person's to-be-detected trip information set will be used to compare and process with each sub-trip included in the planned trip chain to determine whether there is a related replacement trip for one or several original sub-trips. And according to the situation of the replacement trip finally determined, the missing trips are counted, and finally it is determined how many trips are missing in the actual execution of the original planned trip chain, that is, U. And finally the trip missing level L is generated. L is proportional to the number of missing trips, and can further indicate the severity of the trip missing. Therefore, based on L, the management personnel of the background detection terminal can implement the subsequent corresponding remedial measures more reasonably and efficiently.
[0081] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.
[0082] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0083] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
[0084] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".
[0085] The electronic device according to this embodiment of the present invention is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0086] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).
[0087] The storage stores program codes, which can be executed by the processor, so that the processor executes the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification.
[0088] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).
[0089] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.
[0090] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.
[0091] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may communicate with one or more devices that enable a user to interact with the electronic device, and / or may communicate with any device (e.g., routers, modems, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may be performed through an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter. The network adapter communicates with other modules of the electronic device through a bus. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0092] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0093] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.
[0094] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
[0095] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0096] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0097] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).
[0098] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.
[0099] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.
[0100] The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims
1. A method for updating itinerary information, characterized in that: The method comprises the following steps: Get the planned itinerary chain of the target person (D1, D2, ..., D i , …, D n ), where D i is the information of the sub-trip ranked in the i-th position in the planned trip chain, D i =(SP i ,ST i , E.P. i , E.T. i , F i ),SP i and EP i D i Departure and destination of ST i and ET i D i Departure time and arrival time; F i D i The trip ID of When the time reaches the actual departure time corresponding to any sub-trip information, obtain the passenger ticket checking information list of the corresponding departure place in the sub-trip information; If the ticket checking information corresponding to the target person does not exist in the passenger ticket checking information list, determining that the trip corresponding to the sub-trip information is an unexecuted sub-trip; According to the information in the planned itinerary chain, updating the itinerary information of the unexecuted sub-trips to generate replacement itinerary information of the target person; Sending the replacement itinerary information to the terminal corresponding to the target person for confirmation; According to the confirmation information, the itinerary chain information of the target person is replaced and updated to generate an actual itinerary chain; The update process includes: Acquire a set of itinerary information to be detected of a target person in a preset travel period; the set of itinerary information to be detected includes sub-trip information corresponding to the orders that have been carried out and the orders that have not been carried out in the preset travel period; the departure time of the sub-trip that has not been carried out is within the preset travel period; Traversing the set of itinerary information to be detected, if the arrival place in any sub-trip information is the same as the arrival place corresponding to the unexecuted sub-trip, and the arrival time is earlier than the departure time corresponding to the next sub-trip adjacent to the unexecuted sub-trip, then determining that the sub-trip information is replacement sub-trip information; If the destinations in all subtrip information are different from the destinations corresponding to the unexecuted subtrip, then obtaining the adjacent destinations corresponding to the destinations in the unexecuted subtrip; the adjacent destinations are areas whose distance from the destination in the unexecuted subtrip is less than a preset distance threshold; The to-be-detected trip information set is traversed again. If the destination in any sub-trip information is the same as any adjacent destination, and the arrival time is earlier than the transfer departure time corresponding to the adjacent destination, the sub-trip information is determined to be replacement sub-trip information.
2. The method according to claim 1, characterized in that The transfer departure time corresponding to any of the adjacent destinations is obtained by following the steps below: Get the subsequent departure place and the subsequent departure time T corresponding to the unexecuted sub-trip jx ; The subsequent departure place and the subsequent departure time are respectively the departure place and departure time of the next sub-trip adjacent to the unexecuted sub-trip in the planned trip chain; Obtain the longest travel time T from the adjacent arrival point to the subsequent departure point MAX ; According to T jx and T Max , generate the transfer departure time T corresponding to the nearby arrival place zc ; T zc The following conditions must be met: T zc =T jx -T Max -T1; T1 is the preset additional time.
3. The method according to claim 1, characterized in that After traversing the to-be-detected trip information set again, the method further includes: If the destination in all sub-trip information is different from each adjacent destination, the next sub-trip in the planned trip chain adjacent to the current unexecuted sub-trip is used as a new unexecuted sub-trip; The itinerary information of the new unexecuted sub-trip is updated to generate replacement itinerary information of the target person.
4. The method according to claim 3, characterized in that If the unexecuted subtrip is the last subtrip in the planned trip chain, the generation of new unexecuted subtrips will be stopped after the update process is completed.
5. The method according to claim 1, characterized in that The preset travel time period is obtained according to the following steps: Using the arrival time of the last sub-trip in the planned trip chain as the end time of the preset travel period; Obtaining the departure time and departure place of the unexecuted sub-trip; Determine the retention coefficient corresponding to the departure place according to a preset mapping table; the retention coefficient is used to indicate the degree of influence of different attributes of the departure place on the length of stay of the target person in the local area; According to the retention coefficient Q zl and the departure time ST in the unexecuted sub-trip, determine the starting time T of the preset travel period qs ; T qs The following conditions must be met: T2 is the basic detention duration.
6. The method according to claim 1, characterized in that F i The flight number or train number.
7. The method according to claim 1, characterized in that T1=20min.
8. The method according to claim 5, characterized in that T2 is two days.
9. A non-transitory computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, a method for updating travel information as described in any one of claims 1 to 8 is implemented.
10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for updating travel information as described in any one of claims 1 to 8 is implemented.
Citation Information
Patent Citations
Updating an entire itinerary based on modifying a single travel reservation
CN109146099A
Automatic ticket checking method and device, computer equipment and storage medium
CN113516787A
Business travel service method, device and system and computing equipment
CN114065977A
Safe travel control method and device, electronic equipment and storage medium
CN114971340A
Car sharing method and device, electronic equipment, medium and program product
CN116228503A
Cited By
Travel information processing method and device
CN120670862A
Method and apparatus for processing itinerary information
CN120670862B
