CN117077950A

CN117077950A - Scheduling method, device, electronic equipment and medium for sharing travel

Info

Publication number: CN117077950A
Application number: CN202311047424.9A
Authority: CN
Inventors: 张海斌; 史笛扬; 麻天宇
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2023-08-18
Filing date: 2023-08-18
Publication date: 2023-11-17

Abstract

The scheduling method, the scheduling device, the electronic equipment and the medium for the shared travel can be applied to the technical field of big data and the technical field of Internet of things. The method comprises the following steps: the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N; issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer; selecting a target server from the M servers; and executing the scheduling of the scheduling task based on the target server.

Description

Scheduling method, device, electronic equipment and medium for sharing travel

Technical Field

The invention relates to the technical field of big data and the technical field of the Internet of things, in particular to a scheduling method, a scheduling device, electronic equipment and a scheduling medium for sharing travel.

Background

The shared travel provides a flexible, convenient and environmentally friendly transportation travel solution, wherein the shared bicycle is used as a convenient and environmentally friendly transportation means, solves the problem of last kilometer of travel, and is widely welcome in cities. At present, the release of the sharing bicycle is mainly concentrated in hot areas, such as business centers, scenic spots and communities with dense people, and the scheduling design enables most people to conveniently find and use the sharing bicycle for short-distance travel so as to reduce urban traffic jams and environmental pollution.

However, for the scheduling case of the current-stage shared bicycle, there are the following problems: as the single car throwing range is generally within 2-3 km in hot areas, once the single car throwing range exceeds the range, the number of the single cars is drastically reduced, so that a part of people cannot conveniently go out; the shared bicycle in some areas is accumulated too much, so that the bicycle is idle; in addition, although the bicycle software can display the bicycle distribution nearby, the situation that the bicycle is too far away from the bicycle driver and cannot be quickly used still exists.

Therefore, an optimization method is needed to solve the above problems, so as to reasonably schedule the bicycle resources, ensure that the scheduling result can meet the requirements of users in time, and improve the resource utilization rate.

Disclosure of Invention

In view of the above-mentioned problems, according to a first aspect of the present invention, there is provided a escort line selection method based on a trust allocation, the method comprising: the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N; issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer; selecting a target server from the M servers; and executing the scheduling of the scheduling task based on the target server.

According to some exemplary embodiments, the selecting a target service party from the M service parties specifically includes: calculating second priority levels of the M service parties, and sequencing the second priority levels according to the sequence from high to low to obtain the service party with the highest second priority level; obtaining geographic position information of the service side with the highest second priority level, and performing target vehicle matching operation by using the geographic position information to obtain a target vehicle matching result; if the target vehicle matching result is successful, the service side with the highest second priority level is taken as a target service side; and if the target vehicle matching result is failure, sequentially selecting the service parties of the second priority level, which are ranked from the second position to the Mth position, re-acquiring the geographical position information of the selected service party, performing target vehicle matching operation and acquiring the target vehicle matching result until the target vehicle matching result is successful.

According to some exemplary embodiments, calculating the first priority levels of the N requesters and selecting to obtain the ith requester specifically includes: acquiring first priority factors of N demanding parties, wherein the first priority factors comprise the grade of the demanding party, the release demand frequency, the first historical credit condition, the first historical evaluation condition and additional compensation; calculating a first priority level based on the first priority factor and a pre-assigned first parameter weight; and sorting based on the first priority level, and selecting the demanding party with the highest first priority level as the ith demanding party.

According to some exemplary embodiments, the calculating the second priority levels of the M service parties specifically includes: acquiring second priority factors of M service parties, wherein the second priority factors comprise grades, service frequencies, second historical credit conditions, second historical evaluation conditions and accumulated service duration of the service parties; a second priority level is calculated based on the second priority factor and a pre-assigned second parameter weight.

According to some exemplary embodiments, the performing the target vehicle matching operation by using the geographic location information, and obtaining a target vehicle matching result specifically includes: based on the geographic position information, obtaining L shared vehicles in a second position range, wherein L is a positive integer; if L is not 0, outputting a matching result of the target vehicle to be successful; and if L is 0, outputting the matching result of the target vehicle as failure.

According to some exemplary embodiments, when the matching result is successful, the method further comprises: acquiring positioning information of the L shared vehicles; and judging based on the positioning information, and selecting the shared vehicle with the smallest distance as the dispatching vehicle.

According to some exemplary embodiments, the method further comprises: acquiring dispatching cost, wherein the dispatching cost is calculated according to the number of the adjustable vehicles; and distributing the scheduling cost to the target service side according to a preset proportion.

According to some exemplary embodiments, the method further comprises: and when the grade of the demand side meets a first upgrading condition, upgrading the grade of the demand side by one grade, wherein the first upgrading condition is that accumulated points obtained by issuing and settling scheduling tasks exceed a first threshold value.

According to some exemplary embodiments, the method further comprises: and when the grade of the service party meets a second upgrading condition, upgrading the grade of the service party by one grade, wherein the second upgrading condition is that the accumulated integral obtained by completing the task exceeds a second threshold value.

According to a second aspect of the present invention, there is provided a scheduling apparatus for sharing a trip, the apparatus comprising: a scheduled task acquisition module, configured to: a scheduled task acquisition module, configured to: the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N; the server side acquisition module is used for: issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer; a target service side selection module, configured to: selecting a target server from the M servers; a scheduling execution module, configured to: and executing the scheduling of the scheduling task based on the target server.

According to some exemplary embodiments, the scheduling task acquiring module further includes a first priority factor acquiring unit, a first priority level calculating unit, and an i-th demander acquiring unit.

According to some exemplary embodiments, the first priority factor obtaining unit may be configured to obtain first priority factors of the N requesters, where the first priority factors include a rank of the requesters, a distribution demand frequency, a first historical credit condition, a first historical evaluation condition, and an additional compensation.

According to some example embodiments, the first priority level calculating unit may be configured to calculate a first priority level based on the first priority factor and a first parameter weight assigned in advance.

According to some exemplary embodiments, the ith party obtaining unit may be configured to sort the first priority levels, and select a party with the highest first priority level as the ith party.

According to some example embodiments, the server acquisition module comprises: and the target service side selection module.

According to some exemplary embodiments, the target service side selection module includes a selection module, a target vehicle matching result acquisition module, a first setting unit, and a second setting unit.

According to some exemplary embodiments, the ranking module may be configured to calculate a second priority level of the M service parties, and rank the second priority levels in order from high to low, so as to obtain a service party with a highest second priority level.

According to some exemplary embodiments, the target vehicle matching result obtaining module may be configured to obtain geographic location information of the service party with the highest second priority, and perform a target vehicle matching operation using the geographic location information, to obtain a target vehicle matching result.

According to some exemplary embodiments, the first setting unit may be configured to take the service party with the highest second priority level as the target service party if the target vehicle matching result is successful.

According to some exemplary embodiments, the second setting unit may be configured to sequentially select the service parties of the second priority level, which are ranked from the second position to the mth position, re-acquire the geographic location information of the selected service party, perform the target vehicle matching operation, and acquire the target vehicle matching result until the target vehicle matching result is successful.

According to some exemplary embodiments, the ranking module includes a second priority factor obtaining unit, a second priority level calculating unit.

According to some exemplary embodiments, the second priority factor obtaining unit may be configured to obtain second priority factors of the M service parties, where the second priority factors include a class of the service party, a service frequency, a second historical credit condition, a second historical evaluation condition, and an accumulated service duration.

According to some example embodiments, the second priority level calculating unit may be configured to calculate a second priority level based on the second priority factor and a second parameter weight assigned in advance.

According to some exemplary embodiments, the target vehicle matching result acquisition module includes: a success result output unit and a failure result output unit.

According to some exemplary embodiments, the shared vehicle number acquisition unit may be configured to acquire L shared vehicles in a second location range based on the geographical location information.

According to some exemplary embodiments, the success result output unit may be configured to output the target vehicle matching result as success if L is not 0.

According to some exemplary embodiments, the failure result output unit may be configured to output the target vehicle matching result as failure if L is 0.

According to some exemplary embodiments, the scheduling device for the shared travel further includes: and a positioning information acquisition unit and a dispatching vehicle acquisition unit.

According to some exemplary embodiments, the positioning information obtaining unit may be configured to obtain positioning information of the L shared vehicles.

According to some exemplary embodiments, the scheduled vehicle obtaining unit may be configured to determine, based on the positioning information, to select the shared vehicle with the smallest distance as the scheduled vehicle.

According to some exemplary embodiments, the apparatus further comprises: a scheduling fee acquisition unit and a scheduling fee distribution unit.

According to some exemplary embodiments, the scheduling fee acquisition unit may be configured to acquire a scheduling fee, wherein the scheduling fee is calculated according to the number of the adjustable vehicles.

According to some exemplary embodiments, the scheduling fee allocation unit may be configured to allocate the scheduling fee to the target service side in a preset ratio.

According to a third aspect of the present invention, there is provided an electronic device comprising: one or more processors; and a storage device for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method as described above.

According to a fourth aspect of the present invention there is provided a computer readable storage medium having stored thereon executable instructions which when executed by a processor cause the processor to perform a method as described above.

According to a fifth aspect of the present invention there is provided a computer program product comprising a computer program which, when executed by a processor, implements a method as described above.

One or more of the above embodiments have the following advantages or benefits: the scheduling method of the shared travel can add a new scheduling mechanism to the existing platform of the shared travel, thereby improving the scheduling efficiency of the platform; meanwhile, the time for searching vehicles, which is spent by the demander in realizing the sharing trip, can be greatly shortened, so that the user satisfaction is improved, the resource utilization rate is improved, and the benefit of the whole sharing trip platform is improved. In addition, the data analysis processing is utilized, so that the respective demands of the demand party and the service party can be further met, and the scheduling strategy of the sharing travel is optimized.

Drawings

The foregoing and other objects, features and advantages of the invention will be apparent from the following description of embodiments of the invention with reference to the accompanying drawings, in which:

fig. 1 schematically illustrates an application scenario diagram of a method, an apparatus, a device and a medium for scheduling a shared trip according to an embodiment of the present invention.

Fig. 2 schematically shows a flow chart of a method of scheduling shared trips according to an embodiment of the invention.

Fig. 3 schematically shows a flow chart of a method of acquiring an i-th party by calculation and selection according to an embodiment of the invention.

Fig. 4 schematically shows a flow chart of a method of selecting a target service party according to an embodiment of the invention.

Fig. 5 schematically shows a flow chart of a method of calculating a second priority level according to an embodiment of the invention.

Fig. 6 schematically shows a flow chart of a method of performing a matching operation according to an embodiment of the invention.

Fig. 7 schematically shows a flow chart of a method of selecting a dispatch vehicle according to an embodiment of the invention.

Fig. 8 schematically shows a flow chart of a method of acquiring and allocating scheduling costs according to an embodiment of the invention.

Fig. 9 schematically shows a block diagram of a structure of a scheduling apparatus for sharing travel according to an embodiment of the present invention.

Fig. 10 schematically shows a block diagram of an electronic device adapted to implement a scheduling method for shared travel according to an embodiment of the invention.

Detailed Description

Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. It should be understood that the description is only illustrative and is not intended to limit the scope of the invention. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention. It may be evident, however, that one or more embodiments may be practiced without these specific details. In addition, in the following description, descriptions of well-known structures and techniques are omitted so as not to unnecessarily obscure the present invention.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The terms "comprises," "comprising," and/or the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It should be noted that the terms used herein should be construed to have meanings consistent with the context of the present specification and should not be construed in an idealized or overly formal manner.

Where expressions like at least one of "A, B and C, etc. are used, the expressions should generally be interpreted in accordance with the meaning as commonly understood by those skilled in the art (e.g.," a system having at least one of A, B and C "shall include, but not be limited to, a system having a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

In the technical scheme of the invention, the acquisition, storage, application and the like of the related personal information of the user accord with the regulations of related laws and regulations, necessary security measures are taken, and the public order harmony is not violated.

First, technical terms described herein are explained and illustrated as follows.

Sharing travel: based on the support of the shared platform and technology, vehicles (such as bicycles, automobiles and the like) are provided for the vast customers to use temporarily so as to meet the travel demands of the customers. The core idea of the shared travel is to separate the use right and the ownership of the vehicle, and connect the vehicle owner and the user through the sharing platform, so as to realize the sharing and the optimal utilization of resources.

With the development of socioeconomic performance, the shared travel is accepted and used by more and more people as an emerging travel mode. The shared travel provides a flexible, convenient, economical and environment-friendly traffic solution, helps to reduce the individual vehicle possession, relieves traffic jams, saves resources and reduces carbon emissions, and also provides more travel options and convenience. Shared travel has become an important transportation means in many cities and has a positive impact on the sustainable development of cities and optimization of transportation systems.

In each mode of sharing travel, the sharing bicycle is used as a convenient and environment-friendly transportation tool, has lower use cost and wide application range, and therefore becomes the most popular mode of sharing travel, and a user can rent the sharing bicycle through the sharing bicycle platform to carry out short-distance travel so as to conveniently and rapidly reach a destination.

However, for the scheduling case of the current-stage shared bicycle, there are the following problems: as the single car throwing range is generally within 2-3 km in hot areas, once the single car throwing range exceeds the range, the number of the single cars is drastically reduced, so that a part of people cannot conveniently go out; the flow direction of the shared bicycle in the morning and evening peak time is single, and the shared bicycle flows to hot spot areas in a concentrated way, so that the bicycles in the areas such as subways, buses and the like are piled up, the traffic is influenced, and the repeated utilization rate of the bicycles is not high; in addition, although the bicycle software can display the bicycle distribution nearby, the situation that the bicycle is too far away from the bicycle driver and cannot be quickly used still exists. Moreover, for users with special requirements, such as reserving a bicycle in advance or requiring the bicycle to reach a designated location in advance to avoid waiting, the current platform cannot meet the requirements thereof, thereby affecting the user experience.

Based on this, an embodiment of the present invention provides a scheduling method for a shared trip, the method including: the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N; issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer; selecting a target server from the M servers; and executing the scheduling of the scheduling task based on the target server. In the method according to the embodiment of the invention, a new scheduling mechanism can be added to the existing platform sharing the travel, so that the scheduling efficiency of the platform is improved; meanwhile, the time for searching vehicles, which is spent by the demander in realizing the sharing trip, can be greatly shortened, so that the user satisfaction is improved, the resource utilization rate is improved, and the benefit of the whole sharing trip platform is improved. In addition, the data analysis processing is utilized, so that the respective demands of the demand party and the service party can be further met, and the scheduling strategy of the sharing travel is optimized.

It should be noted that the scheduling method, device, equipment and medium for sharing travel, which are determined by the invention, can be used in the technical field of big data and the technical field of internet of things, can also be used in the financial field, and can also be used in various fields except the technical field of big data, the technical field of internet of things and the financial field. The application fields of the shared travel scheduling method, the shared travel scheduling device, the shared travel scheduling equipment and the shared travel scheduling medium provided by the embodiment of the invention are not limited.

As shown in fig. 1, an application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) may be installed on the terminal devices 101, 102, 103.

The terminal devices 101, 102, 103 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (by way of example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and process the received data such as the user request, and feed back the processing result (e.g., the web page, information, or data obtained or generated according to the user request) to the terminal device.

It should be noted that, the scheduling method of the shared travel provided in the embodiment of the present invention may be generally executed by the server 105. Accordingly, the scheduling device for sharing travel provided in the embodiment of the present invention may be generally set in the server 105. The scheduling method of the shared travel provided by the embodiment of the present invention may also be performed by a server or a server cluster which is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the scheduling device for sharing travel provided in the embodiment of the present invention may also be provided in a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105.

It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

For convenience of explanation, the scheduling method of sharing travel according to the embodiment of the present invention will be explained below by taking the scheduling method of sharing bicycles as an example.

As shown in fig. 2, the scheduling method 200 of the shared travel of this embodiment may include operations S210 to S240.

In operation S210, a scheduling task of an ith demand side is obtained, where the ith demand side is obtained by calculating and selecting a first priority level of N demand sides, i and N are both positive integers, and i is less than or equal to N.

In the embodiment of the invention, before the scheduling task of the ith demand party is acquired, the demand party and the service party can interact through the shared bicycle platform, a bank can establish a linkage mechanism with the shared bicycle platform, functions are added in channels such as WeChat applet, APP and the like, the demand party and the riding party can register, and after real-name authentication, the bank card of the demand party and the riding party can be bound.

In an embodiment of the present invention, a first priority level of the N requesters may be calculated, and the i-th ranked requester may be selected as the target requester. The acquisition of the target demander means that the user's demand can be preferentially satisfied, and thus the selection process needs to be reasonable and fair.

As shown in fig. 3, the method of acquiring the i-th demander through calculation and selection of the embodiment may include operations S310 to S330.

In operation S310, first priority factors of the N requesters are acquired, wherein the first priority factors include a rank of the requester, a distribution demand frequency, a first historical credit condition, a first historical evaluation condition, and an additional consideration.

In an embodiment of the invention, the level C of the demand side _l Reflecting the activity degree and contribution degree of the user in the platform, the user with higher level can enjoy some privileges or preferential, and the demands of the user can be prioritized; publication demand frequency C _f The overall demand degree of the demand party on the scheduling service can be reflected; first historical credit case C _h Can be assessed by the behavior and interactions of the demander in the platform; first historical evaluation case C _c The historical evaluation condition of the demand party to the service party can be reflected; additional reward C _T Is an incentive mechanism that may increase the priority of its demand based on the additional consideration provided by the requesting party, and a requesting party providing a higher consideration may be more likely to attract attention and response to the serving party, and thus should have a higher priority.

In an embodiment of the present invention, when the level of the demander meets a first upgrade condition, the level of the demander is increased by one level, wherein the first upgrade condition is that a cumulative score obtained by issuing a scheduling task and settling exceeds a first threshold value.

Specifically, after the demander normally issues the scheduling task and the service side completes the scheduling task, the demander settles the accounts on time (for example, within 5 minutes) and integrates 5 points at a time; after use, the settlement is not carried out on time (for example, 5 minutes to half an hour), the settlement is carried out for 3 points, the settlement is carried out for 1 point over a certain time (for example, half an hour), and none of the settlement is carried out.

In operation S320, a first priority level is calculated based on the first priority factor and a pre-assigned first parameter weight.

In the embodiment of the invention, the first parameter weights can be respectively allocated to the first priority factors, and in the process of allocating the parameter weights, the importance of each factor and the influence on the first priority level need to be considered, which can be evaluated according to priori knowledge, expert strategies and analysis results of historical data. Specifically, the user's rank reflects their status and contribution in the platform, and higher-rank users may have greater impact on the stable operation of the platform and the user's ecosystem, so higher-rank users may be given higher weights to prioritize their needs, e.g., higher weights may be assigned to rank factors, such as 0.4; the additional compensation is the additional compensation that the demander is willing to provide, and is used for attracting the service party to provide better riding service, so that the user giving the additional compensation and/or the user with higher additional compensation can be given a higher weight, such as 0.3; the first historical credit condition, the first historical evaluation condition and the release demand frequency can be taken as secondary consideration factors and can be assigned with a weight of 0.1, so that the calculation formula of the first priority level is as follows:

C _p ＝C _l *0.4+C _f *0.1+C _h *0.1+C _c *0.1+C _T *0.3 (1)

In the embodiment of the present invention, the first priority factors of each of the demanding parties may be weighted and summed according to the pre-assigned parameter weights, so as to obtain the first priority level of each of the demanding parties, and a higher total score indicates a higher priority level.

In operation S330, the sorting is performed based on the first priority level, and the party with the highest first priority level is selected as the i-th party.

In the embodiment of the invention, the N demanding parties are ranked according to the first priority level obtained by calculation, the demanding party with the highest priority level is ranked in front, and the ith demanding party is selected from the ranking result as the target demanding party.

In the embodiment of the invention, the scheduling task of the i-th demand side can be obtained according to the position information of the demand side and the available condition of the peripheral sharing bicycle, wherein the scheduling task can comprise information such as the starting position, the destination, the estimated vehicle time and the like of the demand side.

Referring back to fig. 2, in operation S220, the scheduling task is issued in a first location range, and M service sides responding to the scheduling task are obtained, where M is a positive integer.

In an embodiment of the present invention, a first location range may be determined based on the location of the i-th demander and the scheduling task demand, with the servers within that range being potential matching candidates.

In operation S230, a target service party is selected from the M service parties.

As shown in fig. 4, the method of selecting a target service side of this embodiment may include operations S410 to S440.

In operation S410, second priority levels of the M service parties are calculated, and the second priority levels are ordered in order from high to low, so as to obtain the service party with the highest second priority level.

As shown in fig. 5, the method of calculating the second priority level of this embodiment may include operations S510 to S520.

In operation S510, second priority factors of the M service parties are acquired, where the second priority factors include a class of the service party, a service frequency, a second historical credit condition, a second historical evaluation condition, and an accumulated service duration.

In the practice of the inventionIn an embodiment, class D of the service party _l Is an important index for measuring the status and experience of the service side in the platform, a higher-level service side possibly has more abundant experience and skills, can provide riding service with higher quality, and the grade can be determined according to the quantity and punctuality of orders completed by the service side; service frequency D _f The activity degree and the availability of the service side are reflected; second historical credit case D _h Refers to the credit performance of the service party in past riding instead of tasks; second historical evaluation case D _c The evaluation and feedback of other users to the service side are referred; accumulated service duration D _t Representing the total time that the service party provides the ride-on service in the platform.

In an embodiment of the present invention, when the level of the service side satisfies a second upgrade condition, the level of the service side is increased by one level, wherein the second upgrade condition is that an accumulated point obtained by completing a task exceeds a second threshold.

In an embodiment of the invention, the second upgrade condition is that the accumulated points obtained by completing the mission exceeds a second threshold, which means that the service party will obtain corresponding points when completing the riding mission, and after the accumulated points reach a certain threshold, the service party is eligible to upgrade to the next level. Specifically, the following integration method can be referred to: riding to a designated place for 5 points in the quasi-era; 3 minutes of time delay within 5 minutes; delay from 5 minutes to half hour integration 1 point, over half hour no integration.

In operation S520, a second priority level is calculated based on the second priority factor and a second parameter weight assigned in advance.

In the embodiment of the present invention, the second priority factor of each server may be weighted and summed according to the second parameter weight allocated in advance, so as to obtain the second priority level of each server. Each factor is multiplied by its corresponding parameter weight using a weighted sum, and then all weighted values are added to get a total score, with higher total score representing higher priority. Similar to operation S320, weights may be set for the class of the service party, the service frequency, the second historical credit condition, the second historical evaluation condition, and the accumulated service duration according to the prior knowledge, the expert policy, and the analysis result of the historical data, respectively: 0.4, 0.1, 0.2, 0.1, the calculation formula of the second priority level is as follows:

D _p ＝D _l *0.4+D _f *0.1+D _h *0.2+D _c *0.2+D _t *0.1 (2)

according to the embodiment of the invention, the target service side is obtained through calculation and selection, so that the platform can flexibly distribute tasks, improve efficiency and punctual wakefulness, and motivate the performance of a riding person.

Referring back to fig. 4, in operation S420, the geographic location information of the service party with the highest second priority level is obtained, and the target vehicle matching operation is performed by using the geographic location information, so as to obtain a target vehicle matching result.

According to the embodiment of the invention, in order to avoid the task requirement of the demander not being satisfied, the service quality and punctuality are improved, and the matching operation can be further set.

As shown in fig. 6, the method of performing the matching operation of this embodiment may include operations S610 to S630.

In operation S610, L shared vehicles are acquired in a second location range based on the geographical location information.

In the embodiment of the invention, the geographic position information of the service party can be obtained through personal information provided by the service party in the platform and through terminal positioning with the service party. The information may include the current location coordinates of the service party, the city or area in which the service party is located, etc.

In an embodiment of the invention, the second location range may be within a distance range relative to the current location of the server. The range may be determined based on platform settings or user requirements, such as a range within 0.5 km or 1 km.

In an embodiment of the present invention, based on the geographic location information of the service party and the second location range, shared vehicle information available within the range may be obtained, which may include location coordinates of the shared vehicle, a status (available or already reserved), and the like. Specifically, a positioning device (e.g., a GPS module) and a sensor may be mounted on each shared bicycle, and position and status information may be transmitted to the background through wireless communication, so as to implement real-time monitoring and scheduling. Based on the shared vehicle information, L shared vehicles may be acquired.

In operation S620, if L is not 0, the target vehicle matching result is output as successful.

In operation S630, if L is 0, the output target vehicle matching result is failure.

In an embodiment of the present invention, if the acquired number L of available shared bicycles is not 0, that is, there are available shared bicycles in the second location range, the platform may mark the matching result as successful. The matching results may also include information of the service party, information of the sharing bicycle, and other related information, so that the service party and the demand party view the matching results.

In the embodiment of the present invention, if L is 0 and the output matching result is failure, the platform may need to reselect the target service party for the i-th demander.

In operation S430, if the target vehicle matching result is successful, the service party with the highest second priority level is taken as the target service party.

In operation S440, if the target vehicle matching result is failure, sequentially selecting the service parties of the second priority level, which are ranked from the second position to the mth position, re-acquiring the geographic location information of the selected service party, performing the target vehicle matching operation, and acquiring the target vehicle matching result until the target vehicle matching result is successful.

In an embodiment of the invention, to further ensure service punctuality and scheduling efficiency, the embodiment of the invention also provides a method for selecting and scheduling vehicles.

As shown in fig. 7, the method of selecting a dispatch vehicle of this embodiment may include operations S710 to S720.

In operation S710, positioning information of the L shared vehicles is acquired.

In an embodiment of the invention, for each available shared bicycle within the second location range, the platform may obtain its exact geographic location information, including longitude and latitude coordinates.

In operation S720, a determination is made based on the positioning information, and the shared vehicle having the smallest distance is selected as the dispatching vehicle.

In the embodiment of the invention, the distances between all available sharing bicycles and the target service party can be compared, and the sharing bicycle with the smallest distance is selected as the dispatching vehicle. The shared bicycle with the smallest distance means that the shared bicycle is closest to the target service party, so that the bicycle is selected as a scheduling target, and riding time and riding distance can be reduced to the greatest extent.

In the embodiment of the invention, the method provided by the embodiment of the invention can acquire the geographic position information of the target service party according to the service requirement of the target service party, and then search for available sharing vehicles in the second position range. Such a process helps to ensure that the physical distances between the service party, the demand party and the dispatching vehicle are relatively close, and to improve the dispatching efficiency and user satisfaction of the shared vehicles.

It should be noted that, once the i-th demander issues the scheduling task and the target service side receives the order successfully, there is a single car locked, and the single car cannot be used by other people within a certain time range.

In addition, the bicycle riding costs are additionally increased in consideration of the cost. The added cost may be designed as a fixed cost, such as 3-member each time; the scheduling fee may also be calculated on demand based on the remaining condition of the vehicle, e.g., based on the number of vehicles available for deployment.

As shown in fig. 8, the method of acquiring and allocating scheduling costs of this embodiment may include operations S810 to S820.

In operation S810, a scheduling fee is acquired, wherein the scheduling fee is calculated according to the number of the scalable vehicles.

In an embodiment of the present invention, the on-demand charging may be calculated according to the following method:

wherein F is a single increase in riding cost; s is a platform-adjustable vehicle.

In operation S820, the scheduling fee is allocated to the target service side in a preset ratio.

According to the embodiment of the invention, for the increased bicycle use fee, the bicycle can be proportionally divided into the riding substitutes and the shared bicycle platform, and the concrete division situation can be dynamically adjusted according to the actual use situation.

Referring back to fig. 2, in operation S240, scheduling of the scheduling task is performed based on the target service side.

In an embodiment of the present invention, server 105 may schedule according to selected target service parties, including vehicle location monitoring, route planning, and traffic condition considerations, among others.

In the embodiment of the invention, the route optimization and navigation can be performed by applying the technology of the Internet of things so as to improve the dispatching efficiency and accuracy. Specifically, according to the positioning information of the sharing bicycle and the service side, the platform can acquire real-time traffic information, monitor traffic conditions and road condition information in real time by utilizing the internet of things technology and perform dynamic route adjustment, so that intelligent route planning and navigation guidance are performed.

In the embodiment of the invention, a punishment mechanism can be set for the demander and the service side. Specifically, the service side can integrate after riding is finished, and after a certain score (for example, 500 minutes) is reached, the activities of WeChat standing and subtracting gold, credit card integration, coupon and sharing earn integration can be replaced; the bicycle platform can issue rewarding tasks, so that various achievement incentives are designed for a demand party and a service party, and the viscosity of a client is increased; for the demand party without on-time settlement or the service party without the quasi-time riding, deduction is carried out according to the rule, and once the deduction reaches a certain standard (for example, less than 0 score), a task cannot be issued or a receipt cannot be carried out for a period of time (for example, within a week).

The scheduling method of the shared travel can add a new scheduling mechanism to the existing platform of the shared travel, thereby improving the scheduling efficiency of the platform; meanwhile, the time for searching vehicles, which is spent by the demander in realizing the sharing trip, can be greatly shortened, so that the user satisfaction is improved, the resource utilization rate is improved, and the benefit of the whole sharing trip platform is improved. In addition, the data analysis processing is utilized, so that the respective demands of the demand party and the service party can be further met, and the scheduling strategy of the sharing travel is optimized. Therefore, the existing bicycle use mechanism can be optimized, the bicycle use rate is improved, and the four-win situation of a bicycle man, a riding person, a bicycle enterprise and a bank is achieved.

Based on the scheduling method of the shared travel, the invention also provides a scheduling device of the shared travel. The device will be described in detail below in connection with fig. 9.

As shown in fig. 9, the scheduling apparatus 900 for sharing a trip according to this embodiment includes a scheduling task acquisition module 910, a server acquisition module 920, a target server selection module 930, and a scheduling execution module 940.

The scheduled task obtaining module 910 may be configured to obtain scheduled tasks of an ith demand party, where the ith demand party calculates a first priority level of N demand parties and selects the first priority level, where i and N are positive integers, and i is less than or equal to N. In an embodiment, the scheduled task acquisition module 910 may be configured to perform the operation S210 described above, which is not described herein.

The server obtaining module 920 may be configured to issue the scheduled task in a first location range, and obtain M servers that respond to the scheduled task, where M is a positive integer. In an embodiment, the service side obtaining module 920 may be configured to perform the operation S220 described above, which is not described herein.

The target server selection module 930 may be configured to select a target server from the M servers. In an embodiment, the target server selection module 930 may be configured to perform the operation S230 described above, which is not described herein.

The schedule execution module 940 may be configured to execute the scheduling of the scheduled task based on the target server. In an embodiment, the scheduling execution module 940 may be configured to execute the operation S240 described above, which is not described herein.

In the embodiment of the present invention, the scheduled task acquisition module 910 further includes a first priority factor acquisition unit, a first priority level calculation unit, and an i-th demander acquisition unit.

The first priority factor obtaining unit may be configured to obtain first priority factors of the N requesters, where the first priority factors include a rank of the requester, a distribution demand frequency, a first historical credit condition, a first historical evaluation condition, and an additional compensation. In an embodiment, the first priority factor obtaining unit may be configured to perform the operation S310 described above, which is not described herein.

The first priority level calculating unit may be configured to calculate a first priority level based on the first priority factor and a first parameter weight assigned in advance. In an embodiment, the first priority level calculating unit may be configured to perform the operation S320 described above, which is not described herein.

The i-th party obtaining unit may be configured to sort the first priority levels, and select a party with the highest first priority level as the i-th party. In an embodiment, the i-th demander obtaining unit may be configured to perform the operation S330 described above, which is not described herein.

According to an embodiment of the present invention, the service side obtaining module 920 includes: and the target service side selection module.

The target service side selection module comprises a sequencing module, a target vehicle matching result acquisition module, a first setting unit and a second setting unit.

The ranking module may be configured to calculate a second priority level of the M service parties, rank the second priority levels in order from high to low, and obtain a service party with a highest second priority level. In an embodiment, the sorting module may be configured to perform the operation S410 described above, which is not described herein.

The target vehicle matching result obtaining module may be configured to obtain geographic location information of the service side with the highest second priority level, and perform a target vehicle matching operation by using the geographic location information, so as to obtain a target vehicle matching result. In an embodiment, the target vehicle matching result obtaining module may be configured to perform the operation S420 described above, which is not described herein.

The first setting unit may be configured to take the service party with the highest second priority level as the target service party if the target vehicle matching result is successful. In an embodiment, the first setting unit may be configured to perform the operation S430 described above, which is not described herein.

The second setting unit may be configured to sequentially select the service parties of the second priority level ordered from the second position to the mth position if the target vehicle matching result is failure, re-acquire geographic location information of the selected service party, perform the target vehicle matching operation, and acquire the target vehicle matching result. In an embodiment, the second setting unit may be configured to perform the operation S440 described above, which is not described herein.

The selection module comprises a second priority factor acquisition unit and a second priority level calculation unit.

The second priority factor obtaining unit may be configured to obtain second priority factors of M service parties, where the second priority factors include a class of service parties, a service frequency, a second historical credit condition, a second historical evaluation condition, and an accumulated service duration. In an embodiment, the second priority factor obtaining unit may be configured to perform the operation S510 described above, which is not described herein.

The second priority level calculating unit may be configured to calculate a second priority level based on the second priority factor and a second parameter weight assigned in advance. In an embodiment, the second priority level calculating unit may be configured to perform the operation S520 described above, which is not described herein.

According to an embodiment of the present invention, the target vehicle matching result acquisition module includes: a success result output unit and a failure result output unit.

The shared vehicle number acquisition unit may be configured to acquire L shared vehicles in a second location range based on the geographical location information. In an embodiment, the shared vehicle number obtaining unit may be configured to perform the operation S610 described above, which is not described herein.

The successful result output unit may be configured to output the matching result of the target vehicle as successful if L is not 0. In an embodiment, the success result output unit may be configured to perform the operation S620 described above, which is not described herein.

The failure result output unit may be configured to output the matching result of the target vehicle as failure if L is 0. In an embodiment, the failure result output unit may be configured to perform the operation S630 described above, which is not described herein.

According to an embodiment of the present invention, the scheduling device 900 for sharing travel further includes: and a positioning information acquisition unit and a dispatching vehicle acquisition unit.

The positioning information acquisition unit may be configured to acquire positioning information of the L shared vehicles. In an embodiment, the location information obtaining unit may be configured to perform the operation S710 described above, which is not described herein.

The dispatching vehicle obtaining unit may be configured to determine, based on the positioning information, to select the sharing vehicle with the smallest distance as the dispatching vehicle. In an embodiment, the scheduled vehicle acquisition unit may be configured to perform the operation S720 described above, which is not described herein.

According to an embodiment of the present invention, the apparatus 900 further includes: a scheduling fee acquisition unit and a scheduling fee distribution unit.

The scheduling fee acquisition unit may be configured to acquire a scheduling fee, wherein the scheduling fee is calculated according to the number of the adjustable vehicles. In an embodiment, the scheduling fee obtaining unit may be configured to perform the operation S810 described above, which is not described herein.

The scheduling fee allocation unit may be configured to allocate the scheduling fee to the target service party according to a preset ratio. In an embodiment, the scheduling fee allocation unit may be configured to perform the operation S820 described above, which is not described herein.

Any of the plurality of modules of the scheduled task acquisition module 910, the server acquisition module 920, the target server selection module 930, and the schedule execution module 940 may be combined in one module to be implemented, or any of the plurality of modules may be split into a plurality of modules, according to an embodiment of the present invention. Alternatively, at least some of the functionality of one or more of the modules may be combined with at least some of the functionality of other modules and implemented in one module. According to embodiments of the present disclosure, at least one of the dispatch task acquisition module 910, the server acquisition module 920, the target server selection module 930, and the dispatch execution module 940 may be implemented at least in part as hardware circuitry, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system-on-chip, a system-on-substrate, a system-on-package, an Application Specific Integrated Circuit (ASIC), or in hardware or firmware in any other reasonable manner of integrating or packaging the circuitry, or in any one of or a suitable combination of three of software, hardware, and firmware. Alternatively, at least one of the scheduled task acquisition module 910, the servicer acquisition module 920, the target servicer selection module 930, and the schedule execution module 940 may be at least partially implemented as a computer program module that, when executed, may perform the corresponding functions.

As shown in fig. 10, an electronic device 1000 according to an embodiment of the present invention includes a processor 1001 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. The processor 1001 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or an associated chipset and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), or the like. The processor 1001 may also include on-board memory for caching purposes. The processor 1001 may include a single processing unit or a plurality of processing units for performing different actions of the method flow according to an embodiment of the invention.

In the RAM 1003, various programs and data necessary for the operation of the electronic apparatus 1000 are stored. The processor 1001, the ROM 1002, and the RAM 1003 are connected to each other by a bus 1004. The processor 1001 performs various operations of the method flow according to the embodiment of the present invention by executing programs in the ROM 1002 and/or the RAM 1003. Note that the program may be stored in one or more memories other than the ROM 1002 and the RAM 1003. The processor 1001 may also perform various operations of the method flow according to an embodiment of the present invention by executing programs stored in the one or more memories.

According to an embodiment of the invention, the electronic device 1000 may further comprise an input/output (I/O) interface 1005, the input/output (I/O) interface 1005 also being connected to the bus 1004. The electronic device 1000 may also include one or more of the following components connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage portion 1008 including a hard disk or the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The drive 1010 is also connected to the I/O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in the drive 1010, so that a computer program read out therefrom is installed as needed in the storage section 1008.

The present invention also provides a computer-readable storage medium that may be embodied in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the apparatus/device/system. The computer-readable storage medium carries one or more programs which, when executed, implement methods in accordance with embodiments of the present invention.

According to embodiments of the present invention, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example, but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the invention, the computer-readable storage medium may include ROM 1002 and/or RAM 1003 described above and/or one or more memories other than ROM 1002 and RAM 1003.

Embodiments of the present invention also include a computer program product comprising a computer program containing program code for performing the method shown in the flowcharts. The program code means for causing a computer system to carry out the methods provided by embodiments of the present invention when the computer program product is run on the computer system.

The above-described functions defined in the system/apparatus of the embodiment of the present invention are performed when the computer program is executed by the processor 1001. The systems, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the invention.

In one embodiment, the computer program may be based on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted in the form of signals on a network medium, distributed, and downloaded and installed via the communication section 1009, and/or installed from the removable medium 1011. The computer program may include program code that may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 1009, and/or installed from the removable medium 1011. The above-described functions defined in the system of the embodiment of the present invention are performed when the computer program is executed by the processor 1001. The systems, devices, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the invention.

According to embodiments of the present invention, program code for carrying out computer programs provided by embodiments of the present invention may be written in any combination of one or more programming languages, and in particular, such computer programs may be implemented in high-level procedural and/or object-oriented programming languages, and/or in assembly/machine languages. Programming languages include, but are not limited to, such as Java, c++, python, "C" or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind 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., connected via the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The embodiments of the present invention are described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present invention. Although the embodiments are described above separately, this does not mean that the measures in the embodiments cannot be used advantageously in combination. Various alternatives and modifications can be made by those skilled in the art without departing from the scope of the invention, and such alternatives and modifications are intended to fall within the scope of the invention.

Claims

1. A method for scheduling a shared trip, the method comprising:

the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N;

issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer;

selecting a target server from the M servers; and

and executing the scheduling of the scheduling task based on the target server.

2. The method according to claim 1, wherein selecting a target service party from the M service parties specifically comprises:

Calculating second priority levels of the M service parties, and sequencing the second priority levels according to the sequence from high to low to obtain the service party with the highest second priority level;

obtaining geographic position information of the service side with the highest second priority level, and performing target vehicle matching operation by using the geographic position information to obtain a target vehicle matching result;

if the target vehicle matching result is successful, the service side with the highest second priority level is taken as a target service side; and

and if the target vehicle matching result is failure, sequentially selecting the service parties with the second priority level and the second to M th service parties, re-acquiring the geographical position information of the selected service parties, performing target vehicle matching operation and acquiring the target vehicle matching result until the target vehicle matching result is successful.

3. The method according to claim 1, wherein calculating a first priority level of N requesters and selecting to obtain the i-th demander specifically comprises:

acquiring first priority factors of N demanding parties, wherein the first priority factors comprise the grade of the demanding party, the release demand frequency, the first historical credit condition, the first historical evaluation condition and additional compensation;

Calculating a first priority level based on the first priority factor and a pre-assigned first parameter weight; and

and sorting based on the first priority level, and selecting the demanding party with the highest first priority level as the ith demanding party.

4. The method according to claim 2, wherein said calculating the second priority level of the M service parties comprises:

acquiring second priority factors of M service parties, wherein the second priority factors comprise grades, service frequencies, second historical credit conditions, second historical evaluation conditions and accumulated service duration of the service parties; and

a second priority level is calculated based on the second priority factor and a pre-assigned second parameter weight.

5. The method according to claim 2 or 4, wherein the performing the target vehicle matching operation by using the geographic location information, and obtaining the target vehicle matching result, specifically includes:

based on the geographic position information, obtaining L shared vehicles in a second position range, wherein L is a positive integer;

if L is not 0, outputting a matching result of the target vehicle to be successful; and

if L is 0, outputting the matching result of the target vehicle as failure.

6. The method of claim 5, wherein when the matching result is successful, the method further comprises:

acquiring positioning information of the L shared vehicles; and

and judging based on the positioning information, and selecting the sharing vehicle closest to the target service side as a dispatching vehicle.

7. The method according to any one of claims 1-4, 6, further comprising:

acquiring dispatching cost, wherein the dispatching cost is calculated according to the number of the adjustable vehicles; and

and distributing the scheduling cost to the target service side according to a preset proportion.

8. A method according to claim 3, characterized in that the method further comprises:

and when the grade of the demand side meets a first upgrading condition, upgrading the grade of the demand side by one grade, wherein the first upgrading condition is that accumulated points obtained by issuing and settling scheduling tasks exceed a first threshold value.

9. The method according to claim 4, wherein the method further comprises:

and when the grade of the service party meets a second upgrading condition, upgrading the grade of the service party by one grade, wherein the second upgrading condition is that the accumulated integral obtained by completing the task exceeds a second threshold value.

10. A scheduling device for a shared trip, the device comprising:

a scheduled task acquisition module, configured to: the method comprises the steps of obtaining a scheduling task of an ith demand party, wherein the ith demand party is obtained by calculating first priority levels of N demand parties and selecting, i and N are positive integers, and i is smaller than or equal to N;

the server side acquisition module is used for: issuing the scheduling task in a first position range, and obtaining M service sides responding to the scheduling task, wherein M is a positive integer;

a target service side selection module, configured to: selecting a target server from the M servers;

a scheduling execution module, configured to: and executing the scheduling of the scheduling task based on the target server.

11. An electronic device, comprising:

one or more processors;

storage means for storing one or more programs,

wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-9.

12. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method according to any of claims 1 to 9.

13. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1 to 9.