PROCESSING SYSTEM FOR TRANSPORT ANALYSIS

Abstract

The invention relates to a processing system (40) for transport analysis, the processing system (40) being configured to be provided with data defining a plurality of paths (1, 1a) on an at least two-dimensional map, each path describing a transport; to be provided with data defining a set of nodes (10-27) on the map, each node (10-27) having a proximity zone (30); and to perform, for each path (1, 1a), a mapping procedure by creating a node sequence composed of nodes (11, 15, 17, 19) through whose proximity zones (30) the path (1, 1a) passes. (Figure 3)

Description

Title of the invention: PROCESSING SYSTEM FOR TRANSPORT ANALYSIS Technical field

[0001] The invention relates to a processing system for transport analysis. State of the prior art

[0002] In advanced logistics, goods are often transported between different countries or even continents. The initial and final points of a transport are usually very specific, for example, the point of collection of goods may be at the place of residence of company A and the point of delivery may be at the place of residence of company B. This leads to a complex and extensive network of transports. Transport routes may change constantly, due to different customer requirements, different restrictions imposed on traffic (traffic jams, roads under construction, etc.), the availability of means of transport and other factors. Thus, the structure is not only complex, but also variable over time. This makes it extremely difficult to plan advanced logistics services effectively.

[0003] For a logistics service provider to work efficiently, it is very important that it can make effective use of co-loading, i.e., use the same means of transport for different shipments. This only makes sense, of course, if at least part of the transport routes of the different shipments are or could be identical. The more numerous the transports are, the more complex and extensive they are, and the more difficult it is to find such (potentially) coinciding route parts that can be used for co-loading. In the case of co-loading, as well as in other cases, it is important to efficiently combine information about different transports in order to uncover relationships. This can only be achieved through the efficient processing and analysis of a large number of transport routes. Technical problem

[0004] The present invention therefore aims at an efficient method of analyzing a transport network. This aim is achieved by means of a processing system. General description of the invention

[0005] The invention relates to a processing system for transport analysis. The term "analysis" can refer to very different degrees of analysis. In any event, transport-related data is used to obtain information that goes beyond "raw" data. The processing system of the invention may be more or less complex. Typically, it includes at least one processing unit and at least one memory device. These components of the processing system could be provided by a conventional PC. It should be noted that the present invention is not limited to the transport of goods and also includes the transport of people or livestock.

[0006] The processing system is configured to be provided with data defining a plurality of paths on a map in at least two dimensions, each path describing a transport. This includes the possibility of providing only a starting point and an end point for a path and that the system itself determines the path. The map may also be referred to as a "coordinate space". The data is provided to the processing system. Typically, the data will be stored in a memory device that is part of or accessible by the processing system. The map will be a representation of an area in which the transports to be analyzed take place. For example, it may be a two-dimensional representation of Europe, America, etc. Typically, two dimensions will be sufficient to characterize a path. However, it is conceivable to include more dimensions.Each trip describes a transport, namely the route of a means of transport such as a van, a truck and the like. In a broader sense, a "transport" can also refer to a route taken by an empty means of transport, for example, a van not carrying any goods on that specific route. Normally, the data will be a representation of the (two-dimensional) coordinates of the trip, corresponding, for example, to latitude and longitude.

[0007] Furthermore, the processing system is configured to be provided with data defining a set of nodes on the map, each node having a proximity area. Again, the data will usually correspond to coordinates (in two dimensions) of each node. The nodes are predefined before the actual analysis takes place. In particular, a node may correspond to a significant transportation point, such as the residence of a major customer of a logistics service provider, major intersections, a city, a transshipment point, a warehouse, a railway station, an airport, etc., advantageously located to cover the majority of the geographical area in which the logistics service provider operates. The nodes are defined as a set, i.e., there is no specific "sequence", although each node may have an identifier such as a name or a number. Furthermore, each node has a proximity area.Naturally, the proximity zone is an area surrounding the node. If the map is two-dimensional, the proximity zone is also two-dimensional. The zone can be circular, that is, it extends the same distance in any direction around the node. However, it is conceivable to define a . A more complex shaped area, for example, if there was a geographical obstacle (such as a mountain or an unbridged river) on one side of a node, the proximity area could only extend as far as that obstacle. Apart from the shape of the proximity area, its size can be different for different nodes, for example depending on the importance assigned to the respective node. However, usually all proximity areas are circular and have the same size.

[0008] To be provided with the above-mentioned data, the processing system usually requires some form of interface. Furthermore, to store the received data, the processing system comprises or at least has access to a memory device.

[0009] According to the invention, the processing system is configured to execute for each path a mapping procedure, by creating a node sequence composed of nodes through whose proximity zones the path passes. The processing system will "move" along the path, i.e. it will monitor the path in the direction of travel and determine whether the path enters a node proximity zone. If not, this node will not be taken into account in the node sequence. If the path enters the proximity zone of a node (or rather of at least one node, since proximity zones can overlap), the path is considered to be "close" to this node. The processing system creates a sequence composed of these close nodes, although not all the close nodes can be part of the sequence, depending on other optional criteria.Normally, the processing system also stores said node sequence for later use. Alternatively, some information from the node sequence may be stored instead of the sequence itself.

[0010] Mapping provides an overview of the route of a transport with respect to nodes that usually represent logistically relevant points on the map. It is not just a de-refinement process in which the route is reduced to a (usually) small number of landmarks. Indeed, when in a proximity area, the route may be "attracted" to the node (although the route is not changed), as it is associated with this node, even if it does not pass exactly through it. From a logistical point of view, it may be useful, for example, to consider changing the route of the respective transport—or a similar transport in the future—to go directly to this node or through it. This may give the possibility to organize co-loading with another transport that is also "close" to this node. This is only an example of the applicability of the results of the mapping procedure.

[0011] The mapping associates the path in two or more dimensions with a sequence of nodes. Although the nodes have coordinates of the same dimension of the path, the sequence itself can be considered as a one-dimensional object. In this regard, the mapping procedure leads to dimension reduction, data compression, which saves computing power and time.

[0012] Usually, each path is defined by a sequence of waypoints. Consecutive waypoints (or landmarks, in mathematical terms) may be at equal distances. It has been found that distances between 5 and 20 km are very useful, a distance of 10 km being particularly advantageous. Of course, each waypoint is represented by coordinates (usually two in number) normally corresponding to latitude and longitude. For such a sequence of waypoints, the mapping procedure includes checking for each waypoint whether it lies within a proximity zone of at least one node. Obviously, a characterization by waypoints whose number can be kept relatively small allows a reduction in the memory required for each path, as well as a relatively fast execution of the mapping procedure.

[0013] In case proximity zones overlap, the mapping procedure could give rise to "unstable" or complicated results, if a path passed through such an overlapping zone. To avoid such problems, it is preferable that the processing system is configured in such a way that if a waypoint is in the proximity zone of several nodes, the processing system adds only the closest node to the sequence. Therefore, the processing system not only checks whether the path is in a node proximity zone, but also whether it is the closest node with respect to the part of the path (usually the waypoint) under consideration. From a logistical point of view, nodes that are further away (although in "proximity") are considered less important.

[0014] The mapping procedure can take into account all nodes defined on the respective map. However, a preselection may be sensible and may represent a time saving. Any reasonable transport route will not leave a certain area comprising the starting point and the end point. For example, if a journey starts in the south of France and ends in the north of Spain, it makes no sense to take into account nodes located in Germany. Therefore, it is preferable that the processing system is configured to select, before each mapping procedure, a subset of regional nodes from the set of nodes and to only take into account the areas in the vicinity of regional nodes. Of course, this could also include the — uninteresting — case where all nodes would be selected and would become regional nodes.In this case, the subset is not a true subset, but simply a "copy" of the original node set.

[0015] Even if only the nearest node is considered, a path with a complicated structure—in particular a non-straight one—could give rise to undesirable results such as a “zigzag” sequence of nodes. In order to avoid such effects, it is preferable for the processing system to be configured in such a way that if a waypoint lies within the proximity zone of a node, the processing system removes this node from the subset of regional nodes. It will therefore not be considered again in the sequence of nodes of this path. Of course, this only refers to a deletion from the subset. If it meets the relevant criteria, the node is added to the sequence of nodes and will not be removed from it.

[0016] There are many ways to determine which nodes are nodes regional. Naturally, the area under consideration must be continuous and must include an initial point and an end point of the transport route. A simple and effective way to filter for relevant nodes is to configure the processing system to select a node as a regional node if it lies inside an ellipse with an initial point and an end point of the route as central points. This, of course, includes the case of an ellipse that is almost circular. The size of the ellipse—namely, the sum of the distances from the central points—can be chosen in various ways, but it is preferable that the ellipse is not too “thin,” i.e., the maximum width should be, for example, at least 20% of the distance between the initial point and the end point. Otherwise, too many nodes could be excluded from the outset, leading to unsatisfactory results.

[0017] Another filtering possibility is to include all nodes inside a circle. The center of the circle must be halfway between the initial point and the end point and its diameter must be greater than the distance between the initial point and the end point.

[0018] Normally, the data defining the routes are generated by software, according to navigation algorithms known in the art, i.e. a given starting point and an end point are indicated by a user and the software determines a suitable route. Thus, the route of the means of transport is determined based on the starting point and the end point before the transport is carried out. The software may be executed in the processing system itself or may be executed in an external system which then provides the route to the processing system. Optionally, position sensors may provide position data relating to the means of transport and the routes may correspond to the position data. This normally only serves for the purpose of verifying the route actually taken by the means of transport, for example, in order to register a deviation from the originally planned route.In this case, the position data is based on . on a position measurement made by the sensors. These position sensors are usually GPS sensors that are located on board a means of transport. The respective position data may be stored on board the means of transport and may be transmitted after completion of the shipment. Alternatively, the position data may be sent in real time to the processing system, using a transmitter on board the means of transport. Such a transmitter could be provided by a smartphone with GPS functionality. If a suitable application for the smartphone is provided, it can provide position data and also send it, for example, using mobile web technology. However, the means of transport could also be equipped with "specialized" components (sensors and transmitter) that serve exclusively to provide and transmit position data to the processing system.It goes without saying that another possibility is that the starting point and the end point are indicated by a user (e.g. a driver) in the means of transport, and are transmitted to the processing system which determines a corresponding route.

[0019] A major interest of the processing system of the invention lies in the analysis of the importance of a particular node combination, namely how much transport occurs between a given pair of nodes (or strictly speaking, between the proximity zones of these nodes). It is preferable that for a pair of nodes, the processing system is configured to add information concerning the paths of all sequences of nodes that contain said pair of nodes. Thus, for a given pair of nodes, for example, "A" and "B", the processing system searches for all sequences of nodes that contain "B" following "A" (or alternatively, "A" following "B", since it is necessary to distinguish which node appears first) and adds or accumulates information on the respective paths. In one embodiment, only those paths where the pick-up point belongs to node A and the delivery point belongs to node B are taken into account.An important possibility is that the processing system counts the number of times the said node pair appears. In this case, the added information is simply the integer "1" for each relevant node sequence. The processing system, which can be referred to as a "machine learning system," provides a counter for each node pair, and each time this node pair appears in a node sequence, the counter is increased by 1. The final value of the counter is a representation of the flow between the respective node pairs.

[0020] Alternatively or additionally, the processing system is configured to be provided with a characteristic parameter of the transport and to add this characteristic parameter. The characteristic parameter may be the volume, the weight or the value of transported goods. These parameters make it possible to evaluate the “importance” of a transport. A In some ways, it is important to know not only how many transports go from "A" to "B", but also whether small or large quantities of goods are transported.

[0021] Another possibility is to analyze the number of means of transport required for a specific node. In this case, it is possible to count the number of times this node (i.e., the node plus its proximity area) has been used as a pick-up point (initial point) of a transport. This counting makes it possible to understand the fluctuation and regularity between various periods. This counting can be done, for example, for all weeks of a year, which makes it possible to predict the need for means of transport for a specific period. Again, these forecast values ​​can be compared with actual values ​​to get an idea of ​​predictability. By making trend comparisons between different periods (e.g., two consecutive weeks or years), the present processing system makes it possible to predict the transport needs for a given future period.

[0022] A considerable potential of the processing system lies in the discovery and exploitation of possibilities for carrying out reloading and / or co-loading. These possibilities may arise when a route is close to a location that is intended for a loading operation. Here, the term "loading" also includes unloading and reloading. There are many examples of such a loading operation. For example, when a first transport passes close to a location that is intended as a collection point for a second transport, the loading operation is the collection operation. In this case, it may be envisaged to modify the route of the first transport to collect the cargo, which may mean that both transports are carried out by the same means of transport. There are other examples of loading operations, as explained below.In such cases, it is preferable for the processing system to be configured such that, if a sequence of nodes in a path includes at least one node intended for a loading operation, the processing system schedules another path that includes this node. More precisely, the processing system schedules another path that allows a loading operation at this node. This may be a loading, unloading or reloading operation. In any case, this other path may be discarded by the processing system itself or by a user, if it is deemed unfavorable according to certain criteria.

[0023] The processing system of the invention can be very useful in the optimal use of transhipment points. It is often uneconomical to carry out transport on a single route, using the same means of transport, from an initial point to an end point. On the other hand, it may be more advantageous to reload goods at a transhipment point, so that the transport is shared between several means of transport, each traveling only a moderate distance and then being available again. In many cases, co-loading for different transports is possible. Therefore, it is preferable for the processing system to be configured in such a way that, if a sequence of nodes includes at least one node corresponding to a transshipment, the processing system plans an alternative route that includes the at least one node and corresponds to a transshipment operation at the at least one node. This means that the processing system looks for possibilities for using transshipment points, thereby dividing a transport into parts that can be carried out by different means of transport. In particular, several nodes in a sequence of nodes may correspond to several transshipment points.In this case, there are different possibilities for dividing the transport, ranging from the use of a single transshipment point to the use of all transshipment points. The processing system may discard some of these options, due to the fact that the distance between two transshipment points is too small or too large, both cases being uneconomical and potentially compromising the quality of service. Constraints, such as the maximum number of driving hours, are also taken into consideration. In addition, combinations with too many transshipment points may be discarded, due to the fact that the total transshipment time (i.e., the total reloading time) may become too long. Furthermore, it may be necessary to carry out the transshipment within a given time interval to allow for co-loading.In other words, it may be necessary to coordinate a reloading operation (e.g., from truck A to truck C at transshipment point X) with another reloading operation (from truck B to truck C at transshipment point X). It should be noted that even if another route is planned as described above, it may be discarded—with or without user request—for example, because it is not profitable.

[0024] In order to identify the most important transshipment points, the system may calculate a "recurrence factor" for each transshipment point, i.e., a value that represents the number of times a transshipment point has been used in a given period of time. Such a recurrence factor may be based on a count of all journeys that include a transshipment point. In this case, normally, only journeys that include a transshipment operation should be taken into account and not those that only pass through the vicinity of a transshipment point. Transshipment points with a high recurrence factor may be preferentially selected for another journey, as described above.

[0025] The aforementioned use of transhipment points normally refers to reloading between means of transport belonging to the same transport provider. logistics services. More specifically, the routes and / or departure times of the means of transport can be selected according to the choice of the logistics service provider. Another possibility for co-loading is to use means of transport belonging to third parties, i.e. other logistics service providers, etc. Naturally, the schedule and route of such third-party transports are fixed. However, the use of third-party transport for co-loading purposes can lead to considerable resource savings. Therefore, in another embodiment of the invention, the processing system is configured in such a way that if a sequence of nodes includes at least one node corresponding to a starting point or an end point of third-party transport, the processing system plans another route that includes said third-party transport.Again, such a route can be planned, but discarded anyway and the original route can be favored. Normally, the route using third-party transport is selected if the total route length to the starting point of third-party transport (pre-shipment) plus the route from the end point of third-party transport (post-shipment) is shorter than the original route without third-party transport. In a simplified version, only airline distances can be considered in this comparison. In addition, the other route can be discarded if its timing is not compatible with the planned transport.

[0026] When two transports take place (in part) in the same area and in a similar direction, it is useful to ask whether they could not both be combined into one. More precisely, the corresponding transport means of one transport could make a detour to perform the other transport as well. In order to reveal such possibilities, according to one embodiment, the processing system is configured to be provided with initial points and end points of journeys as nodes and is further configured such that if a sequence of nodes of a first journey includes a node corresponding to an initial point or an end point of a second journey, the processing system plans another journey that includes the initial points and the end points of the first journey and the second journey.This means that the transport corresponding to the other journey covers the collection and delivery points of the transports corresponding to the first and second journeys. In other words, the same means of transport could carry out both transports.

[0027] There are many possible modifications to the processing system of the invention. Thus, the number of nodes can be reduced, for example to one or two per country. Of course, in such a case, the proximity zones of the nodes must be sufficiently large. In this case, it is possible to study in a very generalized way the flows from one country to another. One could also analyze what the total flow from a specific node (i.e. from this node to any other node) and the total flow to this node are. Each of these flows provides information about the importance of this node. A comparison of these flows shows whether or not there is an equilibrium. One could also analyze the balance between the number of times a node is used as a pickup point and the number of times it is used as a delivery point. If it is used more often as a pickup point, more transport means are needed. The same analysis can be conducted for several nodes located in the same region, for example, a country, to obtain a "regional balance." It is also possible to conduct this analysis separately for each of a plurality of logistics service providers. Apart from presenting the results as numbers, it would also be possible to visualize them on a map, for example, arrows of different sizes would indicate flows, while "unbalanced" nodes or regions would be highlighted by different colors, etc.Flow analysis also makes it possible to determine optimal positions for transshipment points. As indicated above, the nodes may have individual proximity zones, for example, by having different radii or a completely different shape. These are only examples and do not limit the applicability of the invention.

[0028] The invention also relates to a processing system for transport analysis. The processing system is configured to be provided with data defining a plurality of paths on a map in at least two dimensions, each path describing a transport. This includes the possibility of providing only a starting point and an end point for a path and having the system itself determine the path. Brief description of the drawings

[0029] Preferred embodiments of the invention are now described, by way of example, with reference to the accompanying drawings, in which: [Fig.l] is a schematic view of a means of transport and a treatment system according to the invention; [Fig.2] is a diagram illustrating a mapping procedure using the processing system of the invention, at a first stage; [Fig.3] is a diagram illustrating the second-step mapping procedure; [Fig.4a] is a diagram illustrating a transport route and several transhipment points; [Fig.4b] is a diagram illustrating an alternative route for the transport route of [Fig.4a]; [Fig.5a] is a diagram illustrating a transport route and a third-party transport; [Fig.5b] is a diagram illustrating an alternative route for the transport route of [Fig.5a]; [Fig.6a] is a diagram illustrating two transport paths; and [Fig.6b] is a diagram illustrating another path for the transport paths of [Fig.6a]. Description of Preferred Embodiments

[0030] [Fig.l] shows a processing system 40 according to the invention. This comprises a processing unit 41 (for example, a central processing unit of a personal computer) which is connected to a memory device 42 (for example, a main memory and / or a hard disk of the personal computer). The processing unit 41 can read data from the memory device 42 and store data therein. Furthermore, the processing unit 41 is connected to a first interface 43 and a second interface 44 for receiving external data. The first interface 43 can be an input device such as a keyboard or a mouse or can be a connection to an external data source such as a network. The second interface 44 can be configured to receive wired or wireless signals.

[0031] The processing system 40 is configured to receive data relating to a plurality of journeys 1 on a map. Each journey 1 describes a transport carried out by a means of transport 100 which is schematically represented in [Fig.l] in the form of a truck. The data may be entered by means of the first interface 43. In some cases, the details of the journey 1 may be generated by the processing system 40 itself. For example, a starting point 2 and an end point 8 are indicated by a user input via the first interface 43 and the details of the journey are determined by the processing system 40, by means of navigation algorithms known in the art. Naturally, these navigation algorithms could also be executed externally.

[0032] The truck 100 is equipped with a GPS tracking device 101 that determines its position. The position data provided by the GPS tracking device 101 are sent by a wireless transmitter 102 to the second interface 44. Typically, the signal from the transmitter 102 is relayed using a terrestrial or satellite link. In this instance, the GPS tracking device 101 and the transmitter 102 are represented as specialized components of the truck 100. However, they could also be part of a smartphone having a GPS function. Communication via the transmitter 102 and the second interface 44 is primarily intended to check the position of the truck 100 and possibly to modify its route.

[0033] The data provided by the transmitter 102 corresponds to a sequence of coordinate pairs representing the transport route 1. Since the small details of the route 1 are unimportant for the subsequent analysis, the (predicted) position of the truck 100 will only be stored every 10 km. Either the position data are not provided to the system 40 that every 10 km the processing unit 41 determines these 10 km steps and deduces the corresponding waypoints — if necessary, by interpolation — from the original position data.

[0034] Thus, the route 1 is represented by a series of waypoints 2-8 on a two-dimensional map, as shown in [Fig.2]. The route 1 goes from an initial point 2 (on the intermediate waypoints 3-7) to an end point 8 which correspond to the points where the truck 100 carries out the collection and delivery of goods, respectively. On this map, a set of nodes 10-22 is further defined, each corresponding to a significant point, such as a city, a transshipment point, a warehouse, a railway station, an airport, etc. For each node 10-22, a circular proximity zone 30 is defined. In this case, all proximity zones have a radius equal to 15 km.

[0035] At the start of the analysis, the processing system 40 determines certain regional nodes 10-19 which are considered to be within a relevant region of the path 1. Only those nodes 10-19 which are within an ellipse 31 having the initial point 2 and the final point 8 as central points are selected. Nodes 20-22 outside the ellipse 31 may not be considered for this path.

[0036] The processing system 40 checks waypoint by waypoint whether the route is within the proximity zone 30 of a regional node 10-19. The initial point 2 and the first intermediate waypoint 3 are not within this proximity zone 30. However, the next waypoint 4 is within the proximity zone of node 15. It is not within the proximity zone 30 of another node 10-19, therefore, node 15 is selected as the start of a sequence of nodes. The selection is indicated in [Fig.2] by the black circle around node 15. Furthermore, node 15 is removed from the set of regional nodes 10-19, so that it will not be considered again for this route.

[0037] After two more steps, at another waypoint 5, the path enters the proximity zone 30 of another node 11. It is still located in the proximity zone 30 of node 15, but this is no longer taken into account due to its removal from the regional node set. Therefore, node 11 is added to the node sequence and removed from the regional nodes. After four more steps, at waypoint 6, path 1 enters the proximity zone 30 of another node 17 which is also selected for the node sequence. After still four more steps, at waypoint 7, path 1 simultaneously enters the proximity zones of two nodes 13, 19. In this case, the processing system 40 selects node 19 which is closest to the current waypoint 7. However, both nodes 13, 19 are removed from the regional node set.

[0038] No additional proximity zones are encountered on the path to endpoint 8, so the node sequence is completed. It consists of node 15, node 11, node 17, and node 19. The mapping procedure for matching the waypoint sequence of path 1 to a node sequence has been completed.

[0039] The processing system 40 will store the node sequence in the memory device 42. The same mapping procedure is performed for a plurality of paths 1 each corresponding to a transportation means route 100. Next, the processing system 40 generates a "flow matrix" in which each row and column corresponds to a node. Initially, all values ​​in the matrix are zero. The processing system 40 checks all stored node sequences. If a node sequence contains, for example, consecutive nodes 11 and 17, the corresponding value in row 11 and column 17 of the matrix is ​​increased by one. Of course, the matrix could also be generated as the node sequences are determined, even without explicit node sequence storage.

[0040] In any case, the resulting flow matrix allows the analysis of important characteristics, such as the flow from one node to another, the overall flow from (to) one node to (from) all others, the flow balance to and from a node, etc. It is also possible to include a characteristic value such as the weight of the transported goods. In this case, a flow matrix would not include simple integer values, but values ​​that correspond to a total weight. If a combination of nodes is included in a sequence of nodes, the corresponding value in the matrix is ​​increased by the weight of the goods of the respective transport.

[0041] [Fig.4a] shows a transport route 1, in which, for the sake of simplicity, only the starting point 1 and the end point 8 are shown, while the intermediate points have been omitted. Also shown are three nodes 23-25 ​​which represent transshipment points used by the logistics service provider. As can be seen in the figure, route 1 passes through the proximity zones 30 of two nodes 23, 24. These are included in the node sequence of route 1, by the mapping procedure explained above (possibly together with other nodes which are not shown here). The processing system analyzes the possibility of using one or both of the transshipment points 23, 24, for reloading operations. For example, another route 1b is planned as shown in [Fig.4b]. The route of this trip 1b is modified to include the two transhipment points 23, 24.It is understood that such a journey 1b is normally carried out by three different means of transport, one for each party. In addition, the processing system will plan other journeys that include only one. of the two transshipment points 23, 24. The actual route used for the transport can be selected, for example, depending on whether the means of transport used between the two transshipment points 23, 24 can or cannot be used at least for another transport, i.e. whether co-loading is possible. The selection can be made by the processing system 40 itself or by a user, possibly after preselection by the processing system 40.

[0042] Figures 5a, 5b illustrate an example of the use of third-party transports using the processing system of the invention. A transport route 1 having a starting point 2 and an end point 8 is shown in [Fig.5a], together with a node 26 representing the starting point (i.e., the collection point) and a node 27 representing the end point (i.e., the delivery point) of a third-party transport. This third-party transport, which is simply represented by a dashed straight line, is organized, for example, by another logistics service provider. The route and schedule of this transport cannot be influenced by the logistics service provider organizing the transport represented by route 1. In any case, it may be advantageous to use third-party transport for part of the transport from the starting point 2 to the end point 8.The processing system 40 detects this possibility by the entry of route 1 into the proximity zone 30 of node 26. Accordingly, another route 1b is planned as shown in [Fig.5b]. The route of this route 1b is modified to include nodes 27, 28. It goes from the initial point 2 to node 26 where goods are reloaded into the third-party transport, and from node 27 to the final point 8. The use of the initial route 1 or the other route 1b for the transport may depend, for example, on whether the sum of the distances (or associated costs) from the initial point 2 to node 26 and from node 27 to the final point 8 is greater or less than the distance between the initial point 2 and the final point 8. For simplicity, it is possible to take into account the distances of airlines. The schedule of the third-party transport is, of course, another criterion.

[0043] Figures 6a and 6b illustrate an example of co-loading without an intermediate change of transport means. [Fig. 6a] shows a first transport path 1 having an initial point 2 and an end point 8 and a second transport path 1a having an initial point 2a and an end point 8a. In this case, the initial and end points 2a, 8a are treated as nodes in the mapping procedure of the first path 1. The same applies, vice versa, to the mapping procedure of the second path 1b, which is however not illustrated here. The fact that the first path 1 passes through the proximity zone 30 of the initial point 2a of the second path 1a is considered as an indication that the transport represented by the paths 1, 1a is potentially suitable for combination. Accordingly, another path 1b is planned as shown in [Fig. 6b]. The route of this trip 1b is modified to include the two initial points 2, 2a and the two final points 8, 8a. It goes from the initial point 2 to the final point 8, via the initial point 2a and the final point 8a. The processing system will also plan other paths (not shown) in which the sequence of points 2, 2a, 8, 8a is different. In the present case, it is obvious that the overall distance of the other path 1b is less than the sum of paths 1 and 1a. Other sequences can also lead to a reduction compared to the individual paths 1, 1a, but the sequence shown in [Fig.6a] is the optimal sequence.

[0044] It should be noted that it is possible to combine modes of embodiment of the processing system of the invention, shown in Figures 4a-6b, i.e. the processing system of the invention can search for options to use transshipment, third-party transports and combine transports at the same time. Key to numerical references: 1, la, 1b path 41 processing unit 2, 2a starting point 42 memory device 3-7 waypoint 43,44 interface 8, 8a endpoint 100 truck 10-27 node 101 GPS tracking device 30 proximity zone 102 transmitter 31 ellipse 40 Processing system

Claims

Claims

1. A processing system (40) for transport analysis, the processing system (40) being configured to: - be provided with data defining a plurality of paths (1, 1a) on a map in at least two dimensions, each path defining a transport, - be provided with data defining a set of nodes (10-27) on the map, each node (10-27) having a proximity zone (30), and - execute, for each path (1, 1a), a mapping procedure by creating a node sequence composed of nodes (11, 15, 17, 19) through whose proximity zones (30) the path (1, 1a) passes, the transport system being characterized in that, for a pair of nodes (10-27), the processing system (40) is configured to add information about the paths (1, 1a) of all node sequences that contain said pair of nodes (10-27), in that it is configured to count the number of times when said pair of nodes (10-26) appears,which makes it possible to generate a flow matrix in which each row and column corresponds to a node, and in that the processing system is configured to analyze the resulting flow matrix from characteristics, such as the flow from one node to another, the overall flow from (to) one node to (from) all others, the flow balance to and from a node, and thus make it possible to organize or plan optimized transport operations.,

2. Processing system according to claim 1, characterized in that each path (1, 1a) is defined by a sequence of waypoints (2-8, 2a, 8a) and the mapping procedure comprises checking for each waypoint (2-8, 2a, 8a) whether it lies within a proximity zone (30) of at least one node (10-27).

3. A processing system according to claim 2, characterized in that it is configured such that if a waypoint (2-8, 2a, 8a) is located in the proximity zones (30) of several nodes (10-27), the processing system (40) adds only the closest node (10-27) to the sequence

4. Processing system according to claim 2 or 3, characterized in that it is configured to select, before each mapping procedure, a subset of regional nodes (10-9) from the set of nodes (10-27) and to take into account only the proximity zones (30) of the regional nodes (10-19).

5. Processing system according to claim 4, characterized in that it is configured so that if a waypoint (2-8) is located within the proximity zone (30) of a node (10-27), the processing system (40) removes this node (10-27) from the subset of regional nodes (10-19).

6. A processing system according to claim 4 or 5, characterized in that it is configured to select a node (10-27) to be a regional node (10-19) if it lies within an ellipse (31) having an initial point (2, 2a) and an end point (8, 8a) of the path (1, 1a) as central points.

7. Processing system according to claim 1, characterized in that it is configured to be provided with a transport characteristic parameter and to add this characteristic parameter.

8. Processing system according to any one of claims 1 to 7, characterized in that it is configured so that if a sequence of nodes of a path (1, 1a) comprises at least one node (2a, 23, 24, 26) intended for a loading operation, the processing system (40) organizes another path (1a) which includes this node (2a, 23, 24, 26).

9. Processing system according to claim 8, characterized in that it is configured so that if the sequence of nodes comprises at least one node (23, 24) corresponding to a transshipment, the processing system (40) organizes another path (1b) which includes said at least one node (23, 24) and which corresponds to a transshipment operation to said at least one node (23, 24).

10. Processing system according to any one of claims 8 or 9, characterized in that it is configured so that if the sequence of nodes comprises at least one node (26) corresponding to an initial point or an end point of third-party transport, the processing system (40) organizes another path (1b) which includes said third-party transport.

11. Processing system according to any one of claims 8 to 10, characterized in that it is configured to be provided with points initial points (2, 2a) and end points (8, 8a) of paths (1, 1a) as nodes and is further configured such that if the sequence of nodes of a first path (1) includes a node (2a) corresponding to an initial point or an end point of a second path (1a), the processing system (40) organizes another path (1b) which includes the initial points (2, 2a) and the end points (8, 8a) of the first path (1) and the second path (1a).

Images