A method for updating travel information, a storage medium, and an electronic device

Abstract

The present application relates to the field of data processing, in particular to a kind of itinerary information updating method, storage medium and electronic equipment.It includes: according to the information in planned itinerary chain, the itinerary information of unexecuted sub itinerary is updated and handled, and the replacement itinerary information of target person is generated.Sending replacement itinerary information to the terminal corresponding to target person is confirmed.And the itinerary chain information of target person is replaced and updated, and actual itinerary chain is generated.In the present application, by comparing the arrival place in the to-be-detected itinerary information set, the arrival place corresponding to unexecuted sub itinerary and adjacent place, and the related arrival time in the updating process, the replacement itinerary corresponding to one or several sub itinerary can be determined.The corresponding replacement information is sent to the target person for reconfirmation, and then updated according to the confirmation result.Thereby, the missing itinerary information can be filled and updated more timely, to ensure the integrity of itinerary information.

Description

Technical Field

[0001] This invention relates to the field of data processing, and in particular to a method for updating travel information, a storage medium, and an electronic device. Background Technology

[0002] In the organization and management of major events (such as international conferences, sporting events, and large-scale celebrations), obtaining travel information of participants is particularly important. This relates to several aspects, including: safety screening and risk management, public health management, transportation and accommodation arrangements, event schedule coordination, and emergency response.

[0003] Typically, travel information for participants is registered in advance for management and arrangements. However, during actual travel, various reasons often lead to changes in some or all sub-itineraries of a participant's itinerary, rendering the original itinerary inaccurate and resulting in missing travel information. Ultimately, this can disrupt the overall coordination and arrangements. Summary of the Invention

[0004] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0005] According to one aspect of the present invention, a method for updating trip information is provided, the method comprising the following steps:

[0006] Obtain the target personnel's planned itinerary chain (D1, D2, ..., D... i D n ), where D i For the sub-trip information ordered at position i in the planned trip chain, D i =(SP i ST i EP i ET i F i ),SP i and EP i D respectively i The origin and destination. ST i and ET i D respectively i Departure and arrival times. F i D i The itinerary ID.

[0007] When the time reaches the actual departure time corresponding to any sub-trip information, retrieve the passenger check-in information list for the corresponding departure point in the sub-trip information.

[0008] If the passenger check-in information list does not contain the check-in information for the target person, then the trip corresponding to the sub-trip information is determined to be an unexecuted sub-trip.

[0009] Based on the information in the planned itinerary chain, update the itinerary information of the unexecuted sub-itineraries and generate replacement itinerary information for the target personnel.

[0010] The replacement itinerary information will be sent to the target person's corresponding terminal for confirmation.

[0011] Based on the confirmed information, the travel itinerary information of the target personnel is replaced and updated to generate the actual travel itinerary.

[0012] The update process includes:

[0013] Retrieve the set of travel information to be detected for target individuals within a preset travel time period. This set includes sub-travel information corresponding to both completed and uncompleted orders within the preset travel time period. The departure times of uncompleted sub-travels fall within the preset travel time period.

[0014] Traverse the set of trip information to be tested. If the destination in any sub-trip information is the same as the destination of the unexecuted sub-trip, and the arrival time is earlier than the departure time of the next sub-trip adjacent to the unexecuted sub-trip, then the sub-trip information is determined to be replacement sub-trip information.

[0015] If the destination in all sub-trip information is different from the destination of the unexecuted sub-trip, then the nearest destination corresponding to the destination in the unexecuted sub-trip is obtained. The nearest destination is the area whose distance from the destination in the unexecuted sub-trip is less than a preset distance threshold.

[0016] The set of itinerary information to be tested is traversed again. If the destination in any sub-trip information is the same as any nearby destination, and the arrival time is earlier than the departure time of the connecting trip corresponding to the nearby destination, then the sub-trip information is determined to be the replacement sub-trip information.

[0017] According to a second aspect of the present invention, a non-transitory computer-readable storage medium is provided, which stores a computer program that, when executed by a processor, implements the above-described method for updating travel information.

[0018] According to a third aspect of the present invention, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described method for updating travel information.

[0019] The present invention has at least the following beneficial effects:

[0020] When an individual's itinerary changes, their departure point, destination, and final arrival time usually remain the same; the changes typically involve replacements of some sub-itineraries within a multi-itinerary chain. Consequently, they will rebook the relevant replacement itineraries. Based on this, this invention, through the update process, compares the arrival points in the itinerary information set to be detected with the arrival points and nearby locations corresponding to the unexecuted sub-itineraries, as well as the relevant arrival times, to determine replacement itineraries corresponding to one or more sub-itineraries. After determining the replacement itineraries, the corresponding replacement information is sent to the target individual for reconfirmation, and then updated based on the confirmation result. This allows for more timely filling and updating of missing itinerary information for the target individual, ensuring the completeness of their itinerary information. Attached Figure Description

[0021] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a flowchart of a method for updating travel information provided in an embodiment of the present invention.

[0023] Figure 2 This is a flowchart of a method for generating a personnel travel omission warning, provided in an embodiment of the present invention. Detailed Implementation

[0024] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0025] As one possible embodiment of the present invention, such as Figure 1 As shown, a method for updating itinerary information is provided, which includes the following steps:

[0026] S100: Obtain the target personnel's planned travel chain (D1, D2, ..., D...). i D n ), where D i For the sub-trip information ordered at position i in the planned trip chain, D i =(SP i ST i EP i ET iF i ),SP i and EP i D respectively i The origin and destination. ST i and ET i D respectively i Departure and arrival times. F i D i The itinerary ID. For example, F i This can be a flight number, train number, bus number, or ferry number. It can also be the order number corresponding to each trip order. Typically, the above trip information can be obtained from the corresponding travel management platform. Furthermore, this trip information data needs to be updated at a set frequency. Due to varying degrees of delays during actual operation, the departure and arrival times of the corresponding trip information usually change. Therefore, to ensure the accuracy of the actual departure time in S200, the trip information needs to be updated, such as every 5 or 10 minutes. The target personnel in this step can be participants in an activity, such as athletes in a sports meet.

[0027] S200: When the time reaches the actual departure time corresponding to any sub-trip information, retrieve the passenger check-in information list of the corresponding departure point in the sub-trip information.

[0028] S300: If the passenger check-in information list does not contain check-in information for the target person, then the trip corresponding to the sub-trip information is determined to be an unexecuted sub-trip.

[0029] Typically, passengers undergo ticket checks before the start of their journey, such as airport check-in and high-speed rail station entry. This process collects passenger information in a passenger ticket check list. By analyzing this passenger ticket check information, it's possible to determine whether a specific individual has boarded their planned flight or train, thus identifying any unexecuted sub-trips.

[0030] S400: Based on the information in the planned itinerary chain, update the itinerary information of the unexecuted sub-itiners and generate replacement itinerary information for the target personnel.

[0031] The update process includes:

[0032] S401: Obtain the set of travel information to be detected for the target personnel within the preset travel time period. The set of travel information to be detected includes the sub-travel information corresponding to both traveled and untraveled orders within the preset travel time period. The departure time of unexecuted sub-travels is within the preset travel time period.

[0033] Typically, the preset travel time can be determined based on the earliest and latest times among all available change of itineraries for the target personnel.

[0034] Specifically, the preset travel time can be obtained by following these steps:

[0035] S411: Use the arrival time of the last sub-trip in the planned itinerary chain as the end time of the preset travel period.

[0036] The arrival time of the final sub-trip can also be replaced with the latest arrival time allowed by the target personnel, depending on the actual situation.

[0037] S421: Get the departure time and departure location of the unexecuted sub-trip.

[0038] S431: Determine the dwell coefficient corresponding to the departure location based on the preset mapping table. The dwell coefficient is used to represent the degree to which different attributes of the departure location affect the duration of the target personnel's stay in the local area.

[0039] This pre-defined mapping table needs to be determined in advance. The dwell time attributes corresponding to the departure point can include whether the departure point is a tourist city, whether there are highly relevant individuals (such as family members) at the departure point, and the weather conditions at the departure point during the corresponding departure time. The dwell time coefficient, Q, can be roughly determined based on the impact of these attributes on the length of stay. zl It can be the sum of all retention coefficient terms.

[0040] S441: Based on the retention coefficient Q zl And the departure time ST of the unexecuted sub-trip, determine the start time T of the preset travel period. qs T qs The following conditions must be met:

[0041] T2 is the base length of stay. For example, T2 can be two days.

[0042] Typically, if the target person needs to stay at the corresponding departure point for a certain period of time, they will arrive at the departure point earlier by the corresponding length of stay, allowing sufficient time for their stay. Therefore, the departure time of any unexecuted sub-trips can be determined based on the stay coefficient, thus determining 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 of the unexecuted sub-trip, and the arrival time is earlier than the departure time of the next sub-trip adjacent to the unexecuted sub-trip, then the sub-trip information is determined to be replacement sub-trip information.

[0044] S403: If the destination in all sub-trip information is different from the destination corresponding to the unexecuted sub-trip, then obtain the nearest destination corresponding to the destination in the unexecuted sub-trip. The nearest destination is the area whose distance from the destination in the unexecuted sub-trip is less than a preset distance threshold. The preset distance threshold can be 100km.

[0045] Typically, when changing itineraries, the destination can be a nearby city (i.e., a nearby arrival point) of the original destination. For example, if the original destination is Tianjin Station, nearby arrival points could include Beijing, Tangshan, Langfang, Cangzhou, etc. Nearby arrival points are generally listed in prefecture-level cities as the smallest unit. The original destination can typically be the corresponding airport, train station, or port. The distance between the nearby arrival point and the destination in the unexecuted sub-trip can be obtained through a map navigation platform; this distance can be the maximum driving distance.

[0046] Then, the journey continues by car or other means to the next departure point. Therefore, when performing a comprehensive comparison, it is necessary not only to compare the original destination but also to compare the nearest destinations to the original destination in order to improve the accuracy of determining the alternative itinerary.

[0047] S404: Iterate through the set of itinerary information to be detected again. If the destination in any sub-itin information is the same as any nearby destination, and the arrival time is earlier than the transfer departure time of the nearby destination, then determine the sub-itin information as the replacement sub-itin information.

[0048] Specifically, the departure time for any nearby arrival point can be obtained by following these steps:

[0049] S414: Obtain the starting point and departure time T of the unexecuted sub-trip. jx The next departure point and the next departure time are the departure point and departure time of the next sub-trip adjacent to the unexecuted sub-trip in the planned itinerary chain, respectively.

[0050] S424: Get the longest travel time T from the nearest arrival point to the next departure point. MAX Longest travel time T MAX This can generally be the driving time.

[0051] S434: According to T jx and T Max Generate the transfer departure time T corresponding to the nearest destination. zc T zc The following conditions must be met:

[0052] T zc =T jx -T Max -T1. T1 is the preset additional duration. For example, T1 = 20 minutes.

[0053] This step can more accurately calculate the longest time from the nearest arrival point to the next departure point, and determine the departure time based on this time, where T1 is used to represent the reserved time for boarding and ticket checking.

[0054] S405: If the destination in all sub-trip information is different from each adjacent destination, then the next sub-trip in the planned trip chain that is adjacent to the currently unexecuted sub-trip will be taken as the new unexecuted sub-trip.

[0055] S406: Update the itinerary information for new unexecuted sub-trips and generate replacement itinerary information for the target personnel.

[0056] Using the new unexecuted sub-process, repeat steps S401 to S404 in a loop to update each sub-process in the planned process chain in turn.

[0057] Because target individuals may replace two or more consecutive sub-trips with a single, longer sub-trip when changing their travel plans, the replacement trip can only be determined during the update comparison if the last replaced sub-trip is treated as an unexecuted sub-trip. Therefore, a continuous, iterative comparison is necessary.

[0058] Furthermore, if the unexecuted sub-process is the last sub-process in the planned process chain, then the generation of new unexecuted sub-processes will stop 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 alternative itinerary information is sent to the target personnel for further confirmation. At the same time, the target personnel can also edit this itinerary replacement information to ensure its accuracy.

[0061] S600: Based on the confirmed information, replace and update the travel chain information of the target personnel to generate the actual travel chain.

[0062] In this embodiment, by comparing the arrival locations in the set of travel information to be detected with the arrival locations and nearby locations corresponding to the unexecuted sub-travels, as well as the relevant arrival times, during the update process, alternative travel itineraries corresponding to one or more sub-travels can be determined. After determining the alternative travel itineraries, the corresponding alternative information is sent to the target personnel for reconfirmation, and then updated based on the confirmation result. This allows for more timely filling and updating of missing travel information for the target personnel, ensuring the integrity of their travel information.

[0063] As another possible embodiment of the present invention, such as Figure 2As shown, a method for generating a personnel travel shortage warning is also provided. This method is used to determine the number of missing travels based on the aforementioned method for determining replacement travels, and then generate a warning accordingly. The method includes the following steps:

[0064] W100: The total number W of sub-trips included in the target person's planned trip chain.

[0065] W200: During trip execution, when an unexecuted sub-trip occurs, it retrieves a set of trip information to be detected for the target personnel within a preset travel time period. This set includes sub-trip information corresponding to both completed and unexecuted orders within the preset travel time period. The departure time of the unexecuted sub-trip falls within the preset travel time period.

[0066] W300: Based on the set of trip information to be detected, perform trip replacement processing on the trip information in the planned trip chain to generate the number U of missing sub-trips corresponding to the planned trip chain.

[0067] Trip replacement processing includes:

[0068] W301: Compare and count the currently unexecuted sub-processes with each sub-process in the process information set to be detected, and generate the replacement sub-processes and the number of missing sub-processes corresponding to the currently unexecuted sub-processes.

[0069] The comparison counting process includes:

[0070] W311: Traverse the set of trip information to be detected. If the destination in any sub-trip information is different from both the destination of the unexecuted sub-trip and the nearest destination of the unexecuted sub-trip, then the unexecuted sub-trip is identified as a missing sub-trip, and the number of missing sub-trips corresponding to the planned trip chain is incremented by one. The nearest destination is the area whose distance from the corresponding destination is less than a preset distance threshold.

[0071] W321: Traverse the set of trip information to be detected. If the destination in any sub-trip information is the same as the destination of the unexecuted sub-trip, and the arrival time is earlier than the departure time of the next sub-trip adjacent to the unexecuted sub-trip, then the sub-trip is determined to be the 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.

[0072] W331: If the destination in all sub-trip information is different from the destination corresponding to the unexecuted sub-trip, then obtain the nearest destination corresponding to the destination in the unexecuted sub-trip.

[0073] W341: Iterate through the set of trip information to be tested again. If the destination in any sub-trip information is the same as any nearby destination, and the arrival time is earlier than the departure time of the transfer corresponding to the nearby destination, 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 trip chain to zero.

[0074] W302: If there is no replacement sub-process for the currently unexecuted sub-process, the next sub-process adjacent to the currently unexecuted sub-process in the planned process chain will be taken as the new unexecuted sub-process. If the unexecuted sub-process is the last sub-process in the planned process chain, the generation of new unexecuted sub-processes will stop after the update process is completed.

[0075] The method for determining the replacement sub-routine corresponding to the currently unexecuted sub-routine in the above comparison and counting process is the same as the method for determining the replacement sub-routine in the above embodiment. This embodiment only adds a method for counting the number of missing sub-routines. Specifically, when any currently unexecuted sub-routine has no corresponding replacement sub-routine, the number of missing sub-routines is incremented by 1, a new unexecuted sub-routine is determined, and then the process of determining the replacement sub-routine corresponding to the new unexecuted sub-routine continues. Once it is determined that any currently unexecuted sub-routine has a corresponding replacement sub-routine, the number of missing sub-routines is reset to zero. This is how the number of missing routes is determined.

[0076] W400: Based on W and U, generate the trip missing level L for the target personnel. L satisfies the following condition:

[0077] L = U / W.

[0078] W500: Generates corresponding warning information based on 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. Furthermore, different levels of missing trips correspond to different colors in the generated warning messages.

[0080] In this embodiment, when an unexecuted sub-trip occurs, each sub-trip in the target personnel's to-be-detected trip information set is compared with each sub-trip included in the planned trip chain to determine if there are any replacement trips for one or more original sub-trips. Based on the finally determined replacement trips, a missing trip count is performed to ultimately determine how many trips, or U, were missing during the actual execution of the original planned trip chain. A trip missing level L is then generated. L is proportional to the number of missing trips, thus representing the severity of the trip missing. Therefore, based on L, the administrators of the backend detection terminal can implement subsequent remedial measures more rationally and efficiently.

[0081] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.

[0082] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0083] In an exemplary embodiment of this disclosure, an electronic device capable of implementing the above-described method is also provided.

[0084] Those skilled in the art will understand that various aspects of the present invention can be implemented as systems, methods, or program products. Therefore, various aspects of the present invention can be specifically implemented in the following forms: entirely hardware implementations, entirely software implementations (including firmware, microcode, etc.), or implementations combining hardware and software aspects, collectively referred to herein as “circuits,” “modules,” or “systems.”

[0085] An electronic device according to this embodiment of the invention. The electronic device is merely an example and should not be construed as limiting the functionality or scope of the embodiments of the invention.

[0086] Electronic devices are manifested in the form of general-purpose computing devices. Components of an electronic device may include, but are not limited to: at least one processor, at least one memory, and buses connecting different system components (including memory and processor).

[0087] The memory stores program code that can be executed by a processor, causing the processor to perform the steps described in the "Exemplary Methods" section above, according to various exemplary embodiments of the present invention.

[0088] The storage may include readable media in the form of volatile storage, such as random access memory (RAM) and / or cache memory, and may further include read-only memory (ROM).

[0089] The storage may also include programs / utilities having a set (at least one) of program modules, including but not limited to: an operating system, one or more applications, other program modules, and program data, each or some combination of these examples may include an implementation of a network environment.

[0090] A bus can represent one or more of several bus architectures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus that uses any of the various bus architectures.

[0091] The electronic device can also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., routers, modems, etc.). This communication can be performed via input / output (I / O) interfaces. Furthermore, the electronic device can communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter. The network adapter communicates with other modules of the electronic device via a bus. It should be understood that, although not shown in the figures, other hardware and / or software modules can 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.

[0092] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, terminal device, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0093] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the methods described above is stored. In some possible embodiments, various aspects of the present invention may also be implemented as a program product comprising program code that, when the program product is run on a terminal device, causes the terminal device to perform the steps of the various exemplary embodiments of the present invention described in the "Exemplary Methods" section above.

[0094] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0095] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of sending, propagating, or transmitting programs for use by or in conjunction with an instruction execution system, apparatus, or device.

[0096] The program code contained on the readable medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0097] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0098] Furthermore, the above figures are merely illustrative of the processes included in the method according to exemplary embodiments of the present invention, and are not intended to be limiting. It is readily understood that the processes shown in the above figures do not indicate or limit the temporal order of these processes. Additionally, it is readily understood that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0099] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0100] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for updating itinerary information, characterized in that, The method includes the following steps: Obtain the target personnel's planned itinerary chain (D1, D2, ..., D... i D n ); where D i For the sub-trip information ordered at position i in the planned trip chain, D i =(SP i ST i EP i ET i F i SP i and EP i D respectively i The origin and destination; ST i and ET i D respectively i Departure and arrival times; F i D i Itinerary ID; When the time reaches the actual departure time corresponding to any sub-trip information, obtain the passenger check-in information list of the corresponding departure point in the sub-trip information; If the passenger check-in information list does not contain check-in information for the target person, then the trip corresponding to the sub-trip information is determined to be an unexecuted sub-trip. Based on the information in the planned itinerary chain, the itinerary information of the unexecuted sub-itineraries is updated to generate replacement itinerary information for the target personnel; The replacement itinerary information is sent to the terminal corresponding to the target person for confirmation. Based on the confirmed information, the travel chain information of the target personnel is replaced and updated to generate the actual travel chain; The update process includes: Obtain a set of travel information to be detected for target personnel within a preset travel period; the set of travel information to be detected includes sub-travel information corresponding to both completed and uncompleted orders within the preset travel period; the departure time of the uncompleted sub-travels is within the preset travel period; Traverse the set of trip information to be detected. If the destination in any sub-trip information is the same as the destination of the unexecuted sub-trip, and the arrival time is earlier than the departure time of the next sub-trip adjacent to the unexecuted sub-trip, then the sub-trip information is determined to be replacement sub-trip information. If the destination in all sub-trip information is different from the destination corresponding to the unexecuted sub-trip, then the nearest destination corresponding to the destination in the unexecuted sub-trip is obtained; the nearest destination is an area whose distance from the destination in the unexecuted sub-trip is less than a preset distance threshold. The set of travel information to be detected is traversed again. If the destination in any sub-travel information is the same as any nearby destination, and the arrival time is earlier than the transfer departure time corresponding to the nearby destination, then the sub-travel information is determined to be replacement sub-travel information.

2. The method according to claim 1, characterized in that, The departure time for any of the nearby arrival points is obtained according to the following steps: Obtain the starting point and departure time T of the unexecuted sub-trip. jx The following departure point and departure time are respectively the departure point and departure time of the next sub-trip adjacent to the unexecuted sub-trip in the planned itinerary chain; Obtain the longest travel time T from the nearest arrival point to the next departure point. Max ; According to T jx and T Max Generate the transfer departure time T corresponding to the nearest destination. zc ;T zc The following conditions must be met: T zc =T jx -T Max -T1; T1 is the preset additional duration.

3. The method according to claim 1, characterized in that, After iterating through the set of travel information to be detected again, the method further includes: If the destination in all sub-trip information is different from each of the adjacent destinations, then the next sub-trip adjacent to the currently unexecuted sub-trip in the planned trip chain is taken as the new unexecuted sub-trip; The itinerary information of the new unexecuted sub-trip is updated to generate replacement itinerary information for the target person.

4. The method according to claim 3, characterized in that, If the unexecuted sub-process is the last sub-process in the planned process chain, then the generation of new unexecuted sub-processes will stop 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: The arrival time of the last sub-trip in the planned itinerary chain is taken as the end time of the preset travel period. Obtain the departure time and departure location of the unexecuted sub-trip; The dwell coefficient corresponding to the departure point is determined according to a preset mapping table; the dwell coefficient is used to represent the degree of influence of different attributes of the departure point on the length of stay of the target personnel in the local area. According to the retention coefficient Q zl The start time T of the preset travel period is determined by considering the departure time ST of the unexecuted sub-trip. qs ;T qs The following conditions must be met: T2 is the base duration of stay.

6. The method according to claim 1, characterized in that, F i This refers to the flight number or train number.

7. The method according to claim 2, characterized in that, T1 = 20 min.

8. The method according to claim 5, characterized in that, T2 lasts for two days.

9. A non-transitory computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements a method for updating trip information as described in any one of claims 1 to 8.

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, it implements a method for updating trip information as described in any one of claims 1 to 8.

Images