METHOD FOR ESTIMATING A GREENHOUSE GAS EMISSION FROM THE TRANSPORT OF AT LEAST ONE CONTAINER ON A JOURNEY INCLUDING AT LEAST ONE RAIL OR NAVIGABLE COMPONENT

Abstract

METHOD FOR ESTIMATING A GREENHOUSE GAS EMISSION RESULTING FROM THE TRANSPORT OF AT LEAST ONE CONTAINER ON A JOURNEY COMPRISING AT LEAST ONE RAIL OR NAVIGABLE COMPONENT The invention relates to a computer-implemented method (10) for automatically calculating a characteristic value of a greenhouse gas emission resulting from the transport of at least one container on a first journey by means of a vehicle traveling on a rail, river or sea route, the method (10) comprising: Receiving (REC1), by means of a communication interface, first data, second data and third data;Implementation of the following steps by means of at least one calculator: First determination (DET1) of at least one component of the optimal path by means of a first algorithm, using the first data, the second data, and the third data, Second determination (DET2) of said first characteristic value by means of a second algorithm, using said component of the optimal path. Figure for abstract: Fig. 1;

Description

Title of the invention: METHOD FOR ESTIMATING A GREENHOUSE GAS EMISSION FROM THE TRANSPORT OF AT LEAST ONE CONTAINER ON A JOURNEY INCLUDING AT LEAST ONE RAIL OR NAVIGABLE COMPONENT Field of invention

[0001] The invention relates to the field of methods for calculating greenhouse gas emissions.

[0002] In particular, the invention relates to the field of methods for estimating greenhouse gas emissions on a journey.

[0003] More particularly, the invention relates to the field of computer-implemented methods for estimating greenhouse gas emissions caused by the transport of one or more containers on a route comprising at least one rail or waterway component. State of the art

[0004] Greenhouse gas emissions are a major problem for the planet, contributing to global warming and its harmful consequences, particularly for the environment and health. Carbon dioxide (CO2) emissions represent a significant portion of these greenhouse gas emissions, and come mainly from the combustion of fossil fuels in the transport, energy and industrial sectors.

[0005] The maritime transport sector alone represents more than 3% of global CO2 emissions, mainly for the transport of containers, and approximately one third of these emissions come from refrigerated containers (also known as "REEFERS"). The maritime sector has in particular objectives to drastically reduce these greenhouse gas emissions, and measures to this effect are planned from 2024. Maritime transporters remain responsible for the emissions generated on land segments between ports and places of production and consumption.

[0006] To reduce greenhouse gas emissions, it is important to be able to accurately estimate these emissions during container transport journeys, and therefore, to be able to accurately reconstruct the journeys taken by the containers, so as to determine an optimal journey for transporting a container between two positions.

[0007] However, a problem arises from the fact that containers are rarely equipped with GNSS (Geolocation and Navigation by a Satellite System) systems. And even when they are equipped, the systems have the disadvantage of having only low data resolution (with transmission of position data at low frequency, sometimes every hour, or even at several hour intervals). With the aim of reducing greenhouse gas emissions, and due to the autonomy constraints of battery-powered GNSS systems, it would be counterproductive to equip containers with a location system transmitting position data at more regular time intervals.

[0008] While road and highway data are generally accessible via third-party systems, another problem arises when the route includes at least one railway or waterway, for which calculating the distances traveled is not trivial in the absence of high-resolution GNSS data.

[0009] Consequently, there arises a need for a technical solution enabling the precise determination of greenhouse gas emissions on a route comprising at least one rail or navigable component in the absence of position data or by means of position data transmitted at long time intervals, which opens up the possibility of numerous route options for connecting these positions.

[0010] The invention aims to propose a solution to this technical need, so as to at least limit the aforementioned drawbacks. Summary of the invention

[0011] According to a first aspect, the invention relates to a computer-implemented method for automatically calculating a first characteristic value characterizing a quantity of greenhouse gas emissions resulting from the transport of at least one container on an optimal route, the parameters of which comprise at least an initial position, a final position, and an optimal route connecting said initial position to said final position and comprising at least a first portion of rail or waterway, said container being transported on said optimal route by means of at least a first vehicle capable of traveling on said first portion of road, the method comprising: • Implementation of the following steps using at least one communication interface: • First reception of first data making it possible to determine said initial position and said final position of said optimal path; • Second reception of second data allowing the characterization of said first vehicle; • Third reception of third data making it possible to determine a plurality of optional routes, the parameters of which include at least the initial position, the final position, and an optional route connecting said initial position to said final position and being of the same nature as said optimal route; • Implementation of the following steps using at least one calculator: • First determination of at least one component of the optimal path by means of a first algorithm, using the first data, the second data, and the third data, • Second determination of said first characteristic value by means of a second algorithm, using said component of the optimal path.

[0012] According to one embodiment, the method further comprises a step of segmenting the optimal path into a plurality of segments each characterizing at least one event making up said optimal path, at least one path component being determined for each segment of the plurality of segments, said characteristic value being determined by means of the second algorithm using said path components.

[0013] According to one embodiment, at least one segment of the plurality of segments characterizes an event of transporting the container by means of the first vehicle on the first portion of road, and at least one path component determined for said segment comprises a first length of said first portion of road of the optimal path.

[0014] According to one embodiment, at least one segment of the plurality of segments characterizes a transport event of the container by means of the first vehicle on the first portion of road, and at least one journey component determined for said segment comprises a greenhouse gas emission factor of the first vehicle on the first portion of road.

[0015] According to one embodiment, at least one segment of the plurality of segments characterizes an event of storage of the container in a storage location, and at least one path component determined for said segment comprises a first storage duration of said container in said storage location.

[0016] According to one embodiment, the optimal route comprises at least one second portion of road of a different nature from the first portion of road and taken from a road, motorway, navigable, rail or air portion, the container being transported on said second portion of road by means of at least one second vehicle of a different nature from the first vehicle, the plurality of segments further comprising at least one first segment characterizing at least one first event of transporting the container on the first portion of road by means of the first vehicle, and further comprising at least one second segment characterizing at least one second event of transporting the container on the second portion of road by means of the second vehicle.

[0017] According to one embodiment, the optimal route comprises at least one portion of railway route determined by the implementation of the following steps by the calculator: • First selection of a first fraction of the portion of railway road from a set of fractions of portions of roads by applying a first proximity criterion with the initial position; • Second selection of a second fraction of the railway road section from among the set of road sections applying a second proximity criterion with the final position; • Third selection of a first initial reference point by applying a third proximity criterion with the first fraction and the second fraction of the railway road portion; • Fourth selection of a second final reference point by applying a fourth proximity criterion with the first fraction and the second fraction of the railway road section, and different from the third proximity criterion, • Fifth selection of a plurality of road portion fractions connecting the first road portion fraction and the second road portion fraction to form the railway road portion by applying a fifth proximity criterion with the first initial reference point and the second final reference point.

[0018] According to one embodiment, the optimal route comprises at least one portion of river route determined by the implementation of the following steps by the calculator: • Determination of a first polygon containing at least two positions of the optimal path on a graphic representation of a waterway including a river, • Implementation of an algorithm using vertices of the first polygon to determine said portion of navigable road on said waterway.

[0019] According to one embodiment, the optimal route comprises at least one second portion of road of a different nature from the first portion of road and taken from a road, motorway, navigable, rail or air portion, the container being transported on said second portion of road by means of at least one second vehicle of a different nature from the first vehicle, the plurality of segments further comprising at least one first segment characterizing at least one first event of transporting the container on the first portion of road by means of the first vehicle, and further comprising at least one second segment characterizing at least one second event of transporting the container on the second portion of road.

[0020] According to another aspect, the invention relates to a system for automatically calculating the first characteristic value by means of the method according to the first aspect of the invention, the system comprising: • Said at least one communication interface for receiving the first data, the second data and the third data; • Said at least one calculator for: • Determine said at least one component of the optimal path by means of the first algorithm, using the first data, the second data, and the third data, • Determine the first characteristic value by means of the second algorithm, using said component of the optimal path.

[0021] According to another aspect, the invention relates to a computer program product comprising instructions which, when the program is executed by a computer, cause the latter to implement the steps of the method of the invention.

[0022] According to another aspect, the invention relates to a non-transitory computer-readable medium in which the computer program product is recorded. By "non-transitory medium" is meant that the computer-readable medium is a tangible medium. It is not a transient signal per se. Brief description of the figures

[0023] Other characteristics and advantages of the invention will emerge on reading the detailed description which follows, with reference to the appended figures which illustrate:

[0024] [Fig. 1]: Steps of the method for automatically calculating the first characteristic value.

[0025] [Fig.2]: An example of a route for transporting one or more containers, including portions of maritime and rail routes.

[0026] [Fig.3]: A step of determining a fragment of a portion of railway road of the optimal route.

[0027] [Fig.4]: A step of determining a complete railway route portion of the optimal route.

[0028] [Fig.5]: A step of determining a complete navigable road portion of the optimal route.

[0029] [Fig.6]: A diagram illustrating an example of hardware configuration of the system according to the invention. Detailed description of the invention Generalities and definitions

[0030] Several definitions of terms used in the present description are given below. These definitions should not be interpreted as strictly limiting the scope of the invention. They are simply intended to introduce certain concepts, and to contextualize certain terms used. - "Computer-implemented method" means a method comprising a plurality of steps implemented by means of at least one computer. Such steps include, for example, steps of processing data received by means of a communication interface, for example data transmitted by remote equipment, or data received locally, for example from a local memory, or data resulting from measurements made by means of sensors. The data processing steps include, for example, steps of calculating characteristic values, calculating average, minimum or maximum values, or steps of comparing values with threshold values.The data processing steps generate, for example, the execution of automatic steps by the computer, such as the generation of a command to operate equipment, or the display of data according to a particular pattern, or any other step producing a technical effect and / or aimed at assisting a user in carrying out a technical task. - A "container" means a loading unit transportable by one or more vehicles on at least one route of a journey, and capable of containing various goods, such as foodstuffs and perishables, liquids, medicines, general merchandise, or any other compatible unit, batch or commodity. The "container(s)" may have standardized dimensions to facilitate their handling and transfer between different vehicles, which may be trains, ships, trucks or airplanes, or any other suitable means of transport. The "container(s)" may be refrigerated containers, also known as "reefers", which are equipped with refrigeration systems to transport products requiring temperature control, such as perishable foodstuffs and certain pharmaceutical products.The container(s) may also be non-refrigerated, or dry, and used to store goods that do not require temperature control. A "journey" means a sequence of events occurring during the transport of one or more containers from an initial position to a final position. These events may include, but are not limited to, transporting the containers along a specific portion of track using a specific vehicle, transferring the containers from a first vehicle, for example a truck, to a second vehicle, for example a train, a barge or a ship, loading the containers onto a vehicle, unloading the containers at a storage location, such as a port, etc. “Road” means the road or roads on which the vehicle or vehicles transporting the container or containers travel, and connecting an initial departure position to a final arrival position. The “road” may be composed of “road sections” each characterized by a “road category”. For example, a “road” between a departure position and an arrival position may include a “first road section” corresponding to a waterway, a “second road section” corresponding to a railway, a “third road section” again corresponding to a waterway, a “fourth road section” corresponding to a road or motorway, and a “fifth road section” corresponding to an airway.In this description, we will refer to "road categories" or "track categories" to distinguish between waterways, roads or motorways, railways and airways. We will also refer to "vehicle category" to distinguish between vehicles suitable for use on the different track categories. For example, a "first vehicle category" may include railway vehicles, a "second vehicle category" may include road vehicles, a "third vehicle category" may include ships and barges, etc. The term "optimal route" means a route determined from among a plurality of possible route options for a given transport vehicle, between an initial (or departure) position and a final (or arrival) position and for which the greenhouse gas emission value will be minimal compared to the other route options (or optional routes). Such an optimal route will, for example, have the shortest distance to travel to reach the final position from the initial position among all the optional routes. In addition, the "optimal route" will be determined from among all the "optional routes" that are of the "same nature". This means that the "optional routes" among which the "optimal route" is determined all comply with the same constraints of routes taken or vehicle categories used. For example, between an initial position and a final position, if the input data makes it possible to determine that the container(s) were transported using only a rail vehicle, the "optional routes" from which the "optimal route" will be determined will include all route options allowing the initial position to be connected to the final position by rail. For more complex routes, for example involving at least two different vehicle categories, these constraints may be applied to portions of the route, for example a rail constraint between the initial position and an intermediate position, and a waterway constraint between the intermediate position and the final position. The term "optimal route" means the route that connects the initial position to the final position according to the "optimal path". Similarly, the term "optional route" means a route connecting the initial position to the final position according to an "optional path" of the "same nature" (see definition above) as the "optimal path". A “segment” is understood to mean a portion of the “journey” characterizing one or more events of this journey. In other words, according to embodiments of the invention, the journey is “cut” into “segments” which each correspond to one or more events of the journey. Thus, all of the “segments” form the “journey”. According to an illustrative example, the container is transported on an “optimal journey” between an initial position and a final position connected by an “optimal route” comprising a first portion of rail road and a second portion of navigable road.According to this example, the journey is segmented into a first segment characterizing an event of transporting the container on the first portion of rail road, a second segment characterizing an event of storing the container in a port for a predetermined duration, and a third segment characterizing an event of transporting the container on the second portion of navigable road from the port to the final position. A "multimodal journey" means a "journey" comprising at least two "segments" characterizing container transport events on "roads of different types" (e.g., navigable, road, air, rail). In other words, in this description, we speak of a "multimodal journey" when the "journey" is carried out on at least two tracks (or roads) suitable for vehicles of different types. (for example, and without limitation: container truck for a road route, freight train for a railway route, airplane for an air route, container ship for a waterway, etc.) - A "journey component" is a parameter relating to the journey. For example, this could be a value characterizing an event in the journey, such as a value for the distance traveled, for example the length of at least one section of road, or a value for the time elapsed between two events (for example, the storage time of a container in a storage location). - "Waterway" means a route that can be travelled by means of a vehicle capable of moving on water, for example a barge or a ship. Waterways may include, for example, at least one river and / or at least one sea route.

[0031] The present description is based on several embodiments. Several variant embodiments are described for each of these embodiments. These variants can be applied indifferently to each of these embodiments. Thus, the characteristics described for one embodiment are directly applicable to another embodiment if these characteristics are compatible. The invention protects the different combinations of characteristics described through these embodiments.

[0032] For the sake of brevity, the computer-implemented method 10 will be referred to interchangeably as “computer-implemented method 10” or “method 10” in the remainder of the description to designate the same method.

[0033] According to a first aspect, with reference to [Fig. 1], the invention relates to a computer-implemented method 10 for automatically calculating a first characteristic value Vgl characterizing a quantity of greenhouse gas emissions resulting from the transport of at least one container 200 on an optimal route TjA whose parameters comprise at least one initial position POSi, one final position POS2, and one optimal route RoA connecting said initial position POSi to said final position POS2 and comprising at least one first rail or navigable road portion Ri, said container 200 being transported on said optimal route TjA by means of at least one first vehicle 110 capable of traveling on said first road portion Ri, the method 10 comprising: • Implementation of the following steps by means of at least one communication interface 270: • First reception RECi of first data Di making it possible to determine said initial position POSi and said final position POS2 of said optimal path TjA; • Second reception REC2 of second data D2 making it possible to characterize said first vehicle 110; • Third reception REC3 of third data D3 making it possible to determine a plurality of optional paths Tjh ..Tjx whose parameters include at least the initial position POSi, the final position POS2, and an optional route Roi..Rox connecting said initial position POSi to said final position POS2 and being of the same nature as said optimal route RoA; • Implementation of the following steps using at least one 200 calculator: • First determination DETi of at least one component CjA of the optimal path TjA by means of a first algorithm Fb using the first data, the second data D2, and the third data D3, • Second determination DET2 of said first characteristic value Vgl by means of a second algorithm F2, using said component CjA of the optimal path TjA. Technical effects / Advantages of the invention

[0034] An advantage of the invention is that it makes it possible to precisely estimate the greenhouse gas emissions caused by the transport of one or more containers on a route comprising at least one rail or navigable portion.

[0035] Another advantage of the invention is that it makes it possible to determine an optimal route for transporting one or more containers from a first position to a second position when several route options are possible.

[0036] Another advantage of the invention is that it makes it possible to reconstruct a transport route of one or more containers using a minimal number of location data for said containers. This is particularly advantageous in a context of reducing greenhouse gas emissions, and therefore reducing energy consumption, since this makes it possible to limit the frequency of transmissions of positioning data for the containers during their transport on a given route.

[0037] Another advantage of the invention is that it makes it possible in certain cases to determine a route solely by means of location data of container transhipment locations.

[0038] Another advantage of the invention is that it makes it possible to identify an optimal route when the transport of the container(s) is at least partially by rail and / or waterway.

[0039] Another advantage of the invention is to determine relevant values that can be used to work towards reducing greenhouse gas emissions during the transport of one or more containers on a route. Receiving the first DI data

[0040] With reference to [Fig. 1], the method 10 comprises a first reception step RECi of first data Di making it possible to determine the initial position POSi of the optimal path TjA and to determine the final position POS2 of the optimal path TjA. The first reception step RECi is implemented by means of at least one communication interface 270.

[0041] According to one embodiment, the first received data Di comprise the initial position POSi and / or the final position POS2. These are, for example, positions transmitted by a geolocation device arranged on the container 200 or in its vicinity, or arranged on the vehicle 110 or in its vicinity.

[0042] Optionally, the first received data Di comprise GNSS (Geolocation and Navigation by a Satellite System) coordinates. The first data Di are for example received by means of a GPS (Global Positioning System) receiver. The first received data Di comprise for example geographic coordinates of at least one position of the container 200. The geographic coordinates are for example received in a plurality of dimensions, for example three, which comprise for example a longitude, and / or a latitude and / or an altitude.

[0043] Optionally, the first data Di received includes time-stamped data.

[0044] Optionally, the first data Di received comprises at least one address, such as an address of a transshipment site of the container 200 or an address of a storage site of the container 200.

[0045] An advantage is that it makes it possible to calculate the distance traveled by the container and to know the mode of transport used to transport said container.

[0046] Optionally, the first data Di received comprises speed data. This is for example a speed of movement of the container 200 on the optimal route TjA (for example a speed of movement of the vehicle loading the container 200).

[0047] Optionally, the first data Di received comprises data making it possible to determine a position of a transshipment site of the container 200. This is for example an address of this transshipment site of the container.

[0048] In one embodiment, at least one component CjA of the optimal path TjA is determined using said data making it possible to determine a position of a transshipment site of the container 200.

[0049] Optionally, the first data Di received comprises data making it possible to determine a position of a storage site of the container 200. This is for example an address of this storage site of the container.

[0050] In one embodiment, at least one component CjA of the optimal path TjA is determined using said data making it possible to determine a position of a storage site of the container 200.

[0051] According to one embodiment, the first received data Di comprise data making it possible to determine the initial position POSiet / or the final position POS2 by means of a calculation step. This involves, for example, time-stamped position data corresponding to positions located between the initial position and the final position and speed data. Receiving the second D2 data

[0052] With reference to [Fig.l], the method 10 comprises a second reception step REC2 of second data D2 making it possible to characterize the first vehicle 110. The second data D2 are received by means of at least one communication interface. According to one case, it is the same communication interface 270 as that receiving the first data Db. Alternatively, it is a different communication interface.

[0053] According to one embodiment, the second data D2 comprise identification data of the first vehicle 110.

[0054] Optionally, the identification data of the first vehicle 150 comprises identification data of a vehicle category to which the first vehicle 150 belongs. Examples of vehicle categories include a category of vehicles capable of traveling on a land route, such as a road or a highway, a category of vehicles capable of traveling on a waterway, such as a river or on the high seas, a category of vehicles capable of traveling on a railway, or a category of vehicles capable of traveling on an air route, such as an air corridor.

[0055] Optionally, the identification data of the first vehicle 150 comprises identification data of a type of vehicle. By “type” of vehicle is meant a particular vehicle among a plurality of vehicles capable of circulating on the same lane category, or even road category. For example, for a waterway, a first “type” of vehicle could include container ships.

[0056] Optionally, the identification data of the first vehicle 150 comprises identification data of a vehicle model. By vehicle “model” is meant a subcategory of the “types” of vehicles. To return to the previous example, the first “type” of vehicle comprises container ships among which there are several “models” each having specific technical characteristics.

[0057] One advantage is that it makes it possible to determine the characteristic value of greenhouse gas emissions more precisely.

[0058] According to one embodiment, the second data D2 comprise data characteristic of the container 200. This is for example data characterizing a number of containers, a category of container (for example refrigerated or non-refrigerated), a mass of the container, a consumption of the container in the case of a refrigerated container, a volume of the container, etc.

[0059] One advantage is that it allows a vehicle used to transport the container(s) 200 to be identified using specific constraints imposed by the containers being transported. Receiving third D3 data

[0060] The method comprises a third reception step REC3 of third data D3 making it possible to determine a plurality of optional paths Tji ..., Tjx whose parameters comprise at least the initial position POSi, the final position POS2, and an optional route Roi, ..., Rox connecting said initial position POSi to said final position POS2 and being of the same nature as said optimal route RoA.

[0061] Optionally, the third data D3 comprises data making it possible to determine a plurality of railway routes. These are, for example, “portions of portions of railway routes”, or “LineStrings”.

[0062] Optionally, the third data D3 comprises data making it possible to determine a plurality of routes on a waterway.

[0063] Optionally, the third data D3 comprises data making it possible to determine a plurality of air routes.

[0064] Optionally, the third data D3 comprises data making it possible to determine a plurality of road or motorway routes. Determination of the CjA path components

[0065] The method 10 comprises a step of first determination DETi of at least one path component CjA of the optimal path TjA by means of a first algorithm Fb in using the first data DH, the second data D2, and the third data D3.

[0066] According to one embodiment, at least one path component CjA of the optimal path TjA is received by means of a communication interface and used to calculate the first characteristic value Vgl. According to one example, this is energy consumption data of the refrigerated container systems.

[0067] An advantage is to use data to calculate the first characteristic value Vgien, avoiding a calculation step prior to the use of this data.

[0068] According to one embodiment, at least one path component CjA of the optimal path TjA comprises an energy consumption value used to calculate the first characteristic value Vgi.

[0069] Optionally, at least one path component CjA comprises at least one consumption data of at least one refrigerated container used to calculate the first characteristic value Vgl.

[0070] One advantage is that the energy consumption of refrigerated containers is taken into account in the overall calculation of greenhouse gas emissions on a journey.

[0071] Optionally, at least one journey component CjA comprises at least one energy consumption data item of at least one vehicle transporting the container 200 on the optimal journey TjA used to calculate the first characteristic value Vgl.

[0072] Optionally, at least one path component CjA comprises a parameter of at least one road portion or at least one route of the optimal path TjA.

[0073] Examples of parameters of a road or a portion of a road include, but are not limited to, a length such as a distance to be covered between a starting point of the vehicle and an arrival point corresponding to an end of journey or a particular event (transshipment, storage, etc.), a type of road (e.g.: road, rail, navigable, air, etc.).

[0074] Optionally, at least one path component CjA comprises a parameter of at least one vehicle used to transport the container 200 on at least a portion of the optimal path TjA.

[0075] Examples of vehicle parameters include, but are not limited to, a vehicle category, type or model, vehicle energy consumption data, vehicle loading data (e.g., a number of containers transported, their category (refrigerated, non-refrigerated), their models, their consumption profile for refrigerated containers, their mass (e.g., taking into account their container), etc.).

[0076] According to one embodiment, at least one journey component CjA comprises a greenhouse gas emission factor Zem x of at least one vehicle, or vehicle model, used to transport the container 200 on the optimal journey TjA.

[0077] The term "greenhouse gas emission factor" means a ratio between a quantity of greenhouse gas emitted and a distance traveled by the vehicle. These "greenhouse gases" include, in particular, gases composed of carbon monoxide (CO), carbon dioxide (CO2), sulfur dioxide (SO2), hydrocarbons (HC), nitrogen oxides, lead particles, etc.

[0078] The emissions factor is noted “ZEMX” to refer to the emissions factor associated with the “Xth vehicle”. For example, the emissions factor associated with the first vehicle 110 will be noted ZEM[, the emissions factor associated with the 2nd vehicle 120 will be noted ZEM2, and so on depending on the number of vehicles used to transport the container(s) 200 on the optimal route TjA.

[0079] Optionally, the ZEMX emissions factor depends on a category of vehicle used to transport the container 200 (e.g., heavy goods vehicles, ships, river barges, trains, etc.).

[0080] Optionally, the greenhouse gas emission factor ZEMX depends on a load carried by the vehicle used to transport the container 200. For example, the emission factor will be likely to increase when the number of containers 200 carried by the same vehicle increases.

[0081] According to one embodiment, at least one path component CjA comprises a characteristic value of at least one container 200 transported by at least one vehicle 200 on the optimal path TjA.

[0082] According to one embodiment, at least one journey component CjA comprises a duration. This is for example a duration of an event, for example a duration of a journey on the optimal route RoA or on a portion of route Rh ..., Rn, or even a storage duration of the container 200 in a storage location, for example a port.

[0083] According to one embodiment, at least one journey component CjA is determined by querying a third-party system. This is, for example, a system capable of communicating with a communication interface of the system to transmit data making it possible to calculate distances, for example distances traveled on roads and / or highways. Path segmentation (SI,Sn)

[0084] According to one embodiment, the method 10 comprises a step of segmentation SEGi of the optimal path TjA into a plurality of segments Si, ..., Sn.

[0085] According to one embodiment, at least one segment taken from the plurality of segments Si, ..., Sn characterizes at least one event composing the optimal path TjA.

[0086] Optionally, each segment of the plurality of segments Sb ..Sn characterizes at least one event composing the optimal path TjA.

[0087] Examples of events include, but are not limited to, transporting the container 200 on a road or a portion of a road (air, road, motorway, waterway, rail) by means of at least one vehicle, loading the container 200 into a vehicle, unloading the container 200 from a vehicle that is transporting it, for example to a storage location, transshipping the container 200 from one vehicle to another vehicle, etc.

[0088] Optionally, at least one segment of the plurality of segments Sb ..., Sn characterizes a plurality of events composing the optimal path TjA.

[0089] For example, the same segment is likely to characterize an event of loading the container on board a vehicle and an event of transporting the container on a portion of the road of the journey by means of this vehicle.

[0090] Optionally, at least one segment of the plurality of segments Sb ..., Sn characterizes an event of transport of the container 200 by means of a first vehicle 110 on a first portion of road Rb

[0091] Optionally, at least two segments of the plurality of segments Si, ..., Sn each characterize an event of transport of the container 200 by means of a vehicle of a different category, and on portions of roads of a different nature, at least one portion of road comprising a railway or navigable portion.

[0092] For example, a first segment is likely to characterize an event of transporting the container 200 on a railway track in a freight train, and a second segment is likely to characterize an event of transporting the container 200 on a road track by means of a heavy goods vehicle. Other examples include an event of transporting the container 200 on a waterway by means of a suitable vehicle, such as a ship, or even an event of transporting the container on an airway by means of a suitable vehicle, such as an airplane suitable for transporting containers.

[0093] Determination of the optimal route T jA: case of rail and maritime

[0094] The method 10 comprises a step of first determination DETi of at least one component CjA of the optimal path TjA using the first data Di making it possible to determine the initial position POSi and final position POS2 of the optimal path TjA, the second data D2 making it possible to characterize the first vehicle 110, and the third data D3 making it possible to determine a plurality of optional paths Tj b ..., Tjx whose parameters comprise at least said initial position POSi, said final position POS2 and an optional route Roi, ..., Rox connecting said initial position POSi at said final position POS2 and being of the same nature as the optimal route R0A of the optimal path TjA.

[0095] According to an illustrative example, the first data make it possible to determine an initial position POSi and a final position POS2, the second data make it possible to characterize that the first vehicle 110 is a vehicle traveling on a railway track, and the optimal path TjA is determined DETi from among a plurality of optional paths Tji, ..., Tjx, the parameters of which each comprise an optional route Roi, ..., Rox making it possible to connect the initial position POSi to the final position POS2 or to an intermediate position by a railway track (so that the latter is compatible with the first vehicle 110).

[0096] According to one embodiment, at least one path component CjA of the optimal path TjA is determined by means of a graphical representation of parameters of the optimal path TjA. This is for example a graphical representation of a set of points connected together to form the optimal route RoA, or at least one portion of route Ri Rx of said optimal path TjA.

[0097] According to one embodiment, at least one component CjA of the optimal path TjA is determined by means of at least one calculator using a proximity criterion with at least one position. This is for example a proximity criterion with the initial position POSi, or a proximity criterion with the final position POS2, or a proximity criterion with an intermediate position located between the initial position POSi and the final position POS2.

[0098] According to one case, the component CjA of the optimal journey TjA comprises for example a “fraction of road portion FXRX” or “portion of road portion”, that is to say, considering for example a case of a multimodal journey with a first portion of rail road and a second portion of navigable road, “a portion of the rail road portion” of the multimodal journey.

[0099] The “portion of road portion” corresponds for example to a one-dimensional object representing a sequence of points and line segments which connect them, to form a representation of a road segment. This is for example a “LineString” instance in “SQL” language and according to the Anglo-Saxon vocabulary.

[0100] According to an illustrative example, an algorithm implemented to determine a portion of railway road Rxi of the optimal route is likely to determine a unit of this portion of road (or “portion of portion” of road, or “LineString”) by applying a proximity criterion with the initial position POSi and an intermediate position. In this case, the unit of portion of road closest to both the initial position POSi and the intermediate position is likely to be selected among the set of available options, which are for example determined using the third data D3.

[0101] According to another case, the component CjA of the optimal route TjA comprises a position, such as an address of a loading, transshipment or arrival location, or such as a reference point Xx. In this case, the proximity criterion is for example applied by taking into account another component CjA of the optimal route TjA. The proximity criterion is for example applied by taking into account a “portion of a road portion”, for example itself determined by applying a proximity criterion with another component CjA of the optimal route TjA, such as the initial position POSi or the final position POS2, as seen in the previous example.

[0102] According to another example, the proximity criterion corresponds to a maximum deviation from at least one predefined position, for example the initial position POSi, or the final position POS2 (or an intermediate position if the journey comprises more than one road portion). For example, a journey component CjA is likely to be determined by applying a minimum / maximum longitude and / or minimum / maximum latitude constraint relative to the initial position POSi and / or relative to the final position POS2.For example, a plurality of portions of road sections forming the railway road section connecting the initial position POSi and the final position POS2j (or connecting the initial position POSi and an intermediate position if the journey comprises more than one road section) are likely to be determined by applying a constraint according to which the respective minimum latitudes and longitudes of these portions of road sections must be between the minimum latitude / longitude minus 0.05 degrees of a given position, for example the position of a reference point Xx, and the maximum latitude / longitude plus 0.05 degrees of this same reference point Xx.

[0103] An advantage is to guarantee that only “portions of road portions” located at a maximum distance in degrees of longitude / latitude from the midpoints will be taken into account.

[0104] According to one embodiment, at least one path component CjA is determined by applying an angular criterion. The angular criterion comprises for example an angle value constraint in degrees, for example 60°, between at least one “portion of road portion” connecting a “midpoint of the portions of road portions” and a first reference point Xi for example determined according to a criterion of proximity with the initial position POSi, and at least one “portion of road portion” connecting said “midpoint of the portions of road portions” to a second reference point X2, for example determined according to a criterion of proximity with the final position POS2 or an intermediate position.

[0105] According to one embodiment, at least one path component CjA of the optimal path TjA is extracted from a graphical representation of at least one other path component CjA of the optimal path TjA.

[0106] For example, a set of points is likely to be extracted from the “LineStrings” forming the portion of railway route.

[0107] According to one embodiment, at least one path component CjA is filtered to eliminate values not representative of a real case.

[0108] For example, outlier angle values of "LineStrings" on a graphical representation of a route as a function of latitude and longitude, for example angles greater than 90° with a start or end point, are likely to be filtered out as too abrupt a deviation value for a running train.

[0109] One advantage is to reduce the number of points in a line while maintaining its overall shape.

[0110] Optionally, the method 10 comprises a step of determining a polygon containing at least two positions on a graphical representation of a set of positions. The two positions comprise for example the initial position POSi and / or an intermediate position and / or the final position POS2.

[0111] Optionally, the polygon containing said at least two positions is determined by means of an algorithm using a first polygon containing a first of the two positions on said graphical representation, and using a second polygon comprising the second position on said graphical representation. The algorithm comprises for example an implementation of a step of generating a quadrilateral on said graphical representation, for example a rectangle, the vertices of which correspond to the maximum and minimum longitudes and latitudes of the vertices of the polygons comprising said positions. The quadrilateral is for example generated with an uncertainty on the maximum and minimum longitudes, for example an uncertainty of 1. The algorithm then comprises for example a step of determining a polygon comprising the two positions, for example by means of a step of generating a multi-polygon using said polygons and said quadrilateral.

[0112] An advantage is to obtain a working basis for determining the optimal route in the case of a journey on a waterway.

[0113] Optionally, the method 10 comprises a step of determining at least one “portion of road portion”, or “LineString” the shortest connecting said positions contained by the polygon. This step is for example carried out by means of a Python library suitable for the study of graphs and networks, for example NetworkX.

[0114] Optionally, a plurality of path components CTj are sorted using a neighborhood search algorithm. The sorted path components CjA are, for example, the points connecting the initial position POSi to the final position POS2, or to an intermediate position. The neighborhood search algorithm comprises, for example, a “nearest neighbor algorithm”.

[0115] Optionally, the method 10 comprises the implementation of a line simplification algorithm. This is for example a “LineStrings” simplification algorithm. The line simplification algorithm comprises for example a Douglas-Peucker algorithm. The line simplification algorithm comprises for example a step of determining the extreme points of a line (for example an initial position and an arrival position). The line simplification algorithm comprises for example a step of comparing a distance between two points with a threshold value to determine whether or not to add a point to a simplified line. The line simplification algorithm is for example applied recursively to sub-segments formed by determined points, so as to further simplify these sub-segments.

[0116] Optionally, the method 10 comprises a step of post-processing the path components CjA determined by means of the first algorithm Fi. This is for example a step of determining an optimal “LineString” for a given route category, for example an optimal “LineString” for navigation in the case of a waterway.

[0117] Optionally, at least one component CjA of the optimal path TjA comprises a “Shortest Feasible Distance” or “SFD” as defined by the ISO 14083 standard.

[0118] Determination of the characteristic value of greenhouse gas emissions

[0119] The method 10 comprises a second determination step DET2 of said first characteristic value Vgi by means of a second algorithm F2, using said component CjA of the optimal path TjA.

[0120] According to one embodiment, the first characteristic value Vgiest is determined by means of the second algorithm F2 using a plurality of path components CjA. This is for example a plurality of distance values corresponding to portions of roads making up the path, or else characteristic values determined as a function of a vehicle category or a lane category, or else as a function of a type of load transported, for example a number of containers and their characteristics (mass, consumption, number, etc.).

[0121] According to one embodiment, the first characteristic value Vg is determined by means of the second algorithm F2 using a plurality of greenhouse gas emission factors ZEMX of at least one vehicle used to transport the container 200 on the optimal route TjA.

[0122] According to one embodiment, the first characteristic value Vgl is calculated using at least one energy consumption data of at least one vehicle used to transport the container 200.

[0123] According to one embodiment, the first characteristic value Vgl is calculated using at least one consumption data of at least one refrigerated container. For example, a first value corresponding to the emissions linked to the transport of the containers on a route can be calculated, and a second value corresponding to the emissions of a portion of refrigerated containers among all the containers transported can be calculated, and these two values are for example added to determine the first characteristic value Vgi.

[0124] Optionally, the determination of the first characteristic value Vgl comprises a step of converting a determined value into an equivalent carbon dioxide emissions value, or “CO2 equivalent”. The term “equivalent carbon dioxide emissions value”, or “CO2 equivalent”, means the quantity of carbon dioxide which would cause the same cumulative radiative forcing over a given period of time as the quantity of greenhouse gas from which it is determined.

[0125] According to another aspect, the invention relates to a system for automatically calculating the first characteristic value VgL

[0126] The system further comprises at least one communication interface 270 for receiving the first data Db, the second data D2 and the third data D3.

[0127] The system further comprises at least one calculator 200. The calculator 200 is configured to: • Determine DETi at least one component CjA of the optimal path TjA by means of the first algorithm Fb using the first data Dh, the second data D2, and the third data D3. • Determine DET2 the first characteristic value Vgi by means of the second algorithm F2, using said component CjA of the optimal path TjA.

[0128] According to another aspect, the invention relates to a computer program product comprising instructions which, when the program is executed by a computer, cause the latter to implement the steps of the method of the invention.

[0129] According to another aspect, the invention relates to a non-transitory computer-readable medium in which the computer program product is recorded. By "non-transitory" medium, it is meant that the computer-readable medium is a tangible medium, it is not a transient signal per se. Hardware configuration

[0130] [Fig.6] is a diagram illustrating an example of hardware configuration of the system 1000 according to the invention.

[0131] From a hardware point of view, the system 1000 can be seen as a computer interacting with a computer program product.

[0132] The system 1000 is a computer, for example, a microcomputer, a computer network, an electronic component, a tablet, a smartphone or a personal digital assistant (PDA).

[0133] The system 1000 comprises a computing module 200. This computing module 200 comprises, for example, one or more processors capable of interpreting instructions in the form of a computer program, a programmable logic circuit, such as an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), a programmable logic device (PLD) and programmable logic arrays (PLA), a system on chip (SOC)), an electronic card in which steps of the method 10 according to the invention are implemented in hardware elements. The processing can be executed by a processor, or simultaneously or sequentially, or alternatively, by one or more processors.

[0134] The calculation module 200 comprises a data processing module 201 for performing calculations, a memory 202, operatively coupled to the data processing circuit 201, a computer-readable medium 204 and possibly a reader 203 adapted to read the computer-readable medium 204.

[0135] The system 1000 also includes an input device, an output device, and a communication device 110.

[0136] Each function of the system 1000 is performed by causing the data processing module 201 to read a predetermined program from hardware such as the memory 202 such that the data processing module 201 performs calculations, controls communications performed by the communication device 110 and reads and / or writes data to the memory 202 and the computer readable medium 204.

[0137] The method is executed on a single computer or on a system distributed between several computers (in particular via the use of cloud computing).

[0138] Memory 202 is a computer-readable storage medium, and may be configured with, for example, at least one of the following: a Read-Only Memory (ROM), an Erasable Read-Only Memory, and programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a random access memory (RAM) and another suitable storage medium. The memory 202 may include an operating system and load the programs according to the invention. It includes registers adapted to record parameter variables created and modified during the execution of the aforementioned programs.

[0139] The program product may include the computer-readable recording medium 204 which is a tangible device, not being a transient signal in itself, and may be configured with, for example, at least one of the following: a removable medium, such as, but not limited to, a magneto-optical disk (e.g., a Compact Disc Read-Only Memory (CD-ROM), a Digital Versatile Disc (DVD), a removable disk, a hard disk drive, a smart card, a flash memory device (e.g., a card, a key), a magnetic tape, a database, a server, and other suitable storage medium.

[0140] Alternatively, the program instructions are obtained from an external source and downloaded via a network. This is particularly the case for applications. In this case, the computer program product comprises a computer-readable data carrier on which the program instructions are stored or a data carrier signal on which the program instructions are encoded.

[0141] The invention also relates to a computer program product comprising the computer-readable medium 204 containing instructions which, when executed by the circuit, cause the system 1000 to implement step 100 of the method according to the invention.

[0142] The form of the program instructions is, for example, a source code form, a computer-executable form, or any intermediate form between a source code and a computer-executable form, such as the form resulting from the conversion of the source code via an interpreter, an assembler, a compiler, a linker, or a locator. Alternatively, the program instructions are microcode, firmware instructions, state definition data, integrated circuit configuration data (e.g., VHDL), or object code. The program instructions are written in any combination of one or more programming languages, for example, an object-oriented programming language (C++, JAVA, Python), a procedural programming language (e.g., C language).

[0143] The system 1000 further comprises a user interface 320 comprising an input device 321 and an output device 322.

[0144] The user interface 320 comprises an input device 321 for allowing the user to enter data or commands so as to be able to interact with the programs according to the invention. The input device 321 comprises, for example, a keyboard or a pointing interface, such as a mouse, a light pen, a touchpad, a remote control, a voice recognition device, a haptic device.

[0145] The output device 322 is designed to output information to a user, sensorily or electrically, such as, for example, visually or audibly. The output interface 322 comprises, for example, a graphical interface. The output interface 322 may be the input device, for example, in the case of a touch pad.

[0146] The set of at least one communication device 110 allows communication between the elements of the system 1000 and possibly between at least one element of the system and a device external to the system 1000. This communication device 110 can establish a physical link between elements of the system 1000 and / or between an element of the system 1000 and a device external to the system 1000 and / or a remote communication link (wireless) between elements of the system 1000 and / or between an element of the system and a device external to the system 1000.

Claims

Claims

1. A computer-implemented method (10) for automatically calculating a first characteristic value (Vgl) characterizing a quantity of greenhouse gas emissions resulting from the transport of at least one container (200) on an optimal route (TjA) whose parameters include at least one initial position (POSi), one final position (POS2), and one optimal route (RoA) connecting said initial position (POSi) to said final position (POS2) and comprising at least one first rail or navigable road portion (Ri), said container (200) being transported on said optimal route (TjA) by means of at least one first vehicle (110) capable of traveling on said first road portion (Ri), the method (10) comprising: Implementing the following steps by means of at least one communication interface (270): • First reception (RECi) of first data (Di) comprising the initial position (POSi) and / or the final position (POS2), said positions being transmitted by a geolocation device arranged on the container (200) or in its vicinity, or arranged on the vehicle (110) or in its vicinity; • Second reception (REC2) of second data (D2) making it possible to characterize said first vehicle (110); • Third reception (REC3) of third data (D3) making it possible to determine a plurality of optional paths (Tji, Tjx) whose parameters include at least the initial position (POSi), the final position (POS2), and an optional route (Roi..Rox) connecting said initial position (POSi) to said final position (POS2) and being of the same nature as said optimal route (RoA); Implementation of the following steps by means of at least one calculator (200): First determination (DETi) of at least one component (CjA) of the optimal path (TjA) by means of a first algorithm (FJ, using the first data (Di), the second data (D2), and the third data (D3), • Second determination (DET2) of said first characteristic value (Vgl) by means of a second algorithm (F2), using said component (CjA) of the optimal path (TjA).

2. Method (10) according to claim 1, further comprising a step of segmenting (SEGi) the optimal path (TjA) into a plurality of segments (Si, .Sn) each characterizing at least one event composing said optimal path (TjA), at least one path component (CTj) being determined (DETi) for each segment of the plurality of segments (Sb Sn), said characteristic value (Vgl) being determined by means of the second algorithm (F2) using said path components (CTj).

3. Method (10) according to claim 2, wherein at least one segment of the plurality of segments (Si, ..., Sn) characterizes a transport event of the container (200) by means of the first vehicle (110) on the first portion of road (Ri), and wherein at least one path component (CTj) determined (DETi) for said segment comprises a first length (Li) of said first portion of road (RJ) of the optimal path (TjA).

4. Method (10) according to claim 2, wherein at least one segment of the plurality of segments (Si, ..., Sn) characterizes a transport event of the container (200) by means of the first vehicle (110) on the first portion of road (Ri), and wherein at least one journey component (CTj) determined (DETi) for said segment comprises a greenhouse gas emission factor (Zemi ) of the first vehicle (110) on the first portion of road (Ri).

5. Method (10) according to any one of claims 2 to 3, in which at least one segment of the plurality of segments (Si, ..., Sn) characterizes a storage event of the container (200) in a storage location, and in which at least one path component (CTj) determined (DETi) for said segment comprises a first storage duration of said container (200) in said storage location.

6. Method (10) according to any one of claims 2 to 5, wherein the optimal route (RoA) comprises at least a second

7. portion of road (R2) of a different nature from the first portion of road (Ri) and taken from a road, motorway, navigable, rail or air portion, the container (200) being transported on said second portion of road (R2) by means of at least one second vehicle (120) of a different nature from the first vehicle (110), the plurality of segments (Si, ..., Sn) further comprising at least one first segment (Si) characterizing at least one first event of transport of the container (200) on the first portion of road (Ri) by means of the first vehicle (110), and further comprising at least one second segment (S2) characterizing at least one second event of transport of the container (200) on the second portion of road (R2) by means of the second vehicle (120). Method (10) according to any one of the preceding claims, in which the optimal route (TjA) comprises at least one portion of railway route (Rxi) determined by the implementation of the following steps by the calculator (200): • First selection (SELi) of a first fraction (FiRx) of the portion of railway road (Rxi) from a set of fractions of portions of roads (FXRX FyRx) by applying a first proximity criterion with the initial position (POSi); • Second selection (SEL2) of a second fraction (F2RX) of the railway road portion (Rxi) from among the set of road portions (FXRX> FyRx) by applying a second proximity criterion with the final position (POS2); • Third selection (SEL3) of a first initial reference point (XJ by applying a third proximity criterion with the first fraction (FiRx) and the second fraction (F2 Rx) of the portion of railway road (Rxi); • Fourth selection (SEL4) of a second final reference point (X2) by applying a fourth proximity criterion with the first fraction (FiRx) and the second fraction (F2Rx) of the portion of railway route (Rxi), and different from the third proximity criterion, • Fifth selection (SEL5) of a plurality of fractions of road portions (F3RX FZRX) connecting the first fraction of road portion (FiRx) and the second fraction of road portion (F2RX) to form the railway road portion (Rxi) by applying a fifth proximity criterion with the first initial reference point (Xi) and the second final reference point (X2).

8. Method (10) according to any one of the preceding claims, in which the optimal route (TjA) comprises at least one portion of river route (Ryi) determined by the implementation of the following steps by the computer (200): • Determination of a first polygon (PGNi) containing at least two positions of the optimal route (TjA) on a graphical representation of a waterway comprising at least one waterway, • Implementation of an algorithm using vertices of the first polygon (PGNi) to determine said portion of river route (Ry[) on said waterway.

9. Method (10) according to any one of claims 2 to 8, wherein the optimal route (RoA) comprises at least one second portion of road (R2) of a different nature from the first portion of road (RJ and taken from a road, motorway, navigable, rail or air portion, the container (200) being transported on said second portion of road (R2) by means of at least one second vehicle (120) of a different nature from the first vehicle (110), the plurality of segments (Si, ..., Sn) further comprising at least one first segment (Si) characterizing at least one first event of transport of the container (200) on the first portion of road (Ri) by means of the first vehicle (110), and further comprising at least one second segment (S2) characterizing at least one second event of transport of the container (200) on the second portion of road (R2).

10. System (1000) for automatically calculating the first characteristic value (Vgl) by means of the method (10) according to any one of claims 1 to 9, the system (1000) comprising: • Said at least one communication interface (270) for receiving (RECi, REC2, REC3) the first data (DJ, the second data (D2) and the third data (D3); • Said at least one calculator (200) for: • Determining (DETi) said at least one component (CjA) of the optimal path (TjA) by means of the first algorithm (FJ, using the first data (DJ, the second data (D2), and the third data (D3), • Determining (DET2) the first characteristic value (Vgi) by means of the second algorithm (F2), using said component (CjA) of the optimal path (TjA).

11. A computer program product comprising instructions which, when the program is executed by a computer, cause the latter to implement the steps of the method according to any one of claims 1 to 9.

12. A non-transitory computer-readable medium in which the computer program product according to claim 11 is recorded.

Images