Revision history of "Development of a system to solve a new variant of a real transport problem using discrete optimisation algorithms (accurate and approximate) and advanced machine learning techniques (Smart Drive)" (Q122681)

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 March 2024

15 January 2024

6 July 2023

14 June 2023

12 June 2023

24 May 2023

2 March 2023

  • curprev 20:0120:01, 2 March 2023DG Regio talk contribs 64,245 bytes +490 Changed label, description and/or aliases in it, da, sk, de, ga, hr, bg, fi, et, el, pt, sv, cs, lv, fr, es, ro, nl, lt, hu, sl, mt, and other parts

26 October 2022

21 October 2022

2 July 2022

  • curprev 19:2819:28, 2 July 2022DG Regio talk contribs 61,655 bytes +38,722 Changed label, description and/or aliases in da, el, hr, ro, sk, mt, pt, fi, sl, cs, lt, lv, bg, hu, ga, sv, et, nl, fr, de, it, es, and other parts: Adding translations: da, el, hr, ro, sk, mt, pt, fi, sl, cs, lt, lv, bg, hu, ga, sv, et,

18 January 2022

15 January 2022

17 December 2021

8 December 2021

2 December 2021

  • curprev 07:5107:51, 2 December 2021DG Regio talk contribs 14,599 bytes +1,930 Created claim: summary (P836): L’objectif du projet est de développer une nouvelle variante d’un problème de transport complexe reflétant des scénarios réels de transport tels que les coûts de déplacement dynamiquement variables, la capacité variable de la flotte, les fenêtres horaires avec marges ou la définition des préférences de voyage. De nouveaux algorithmes (précis et approximatifs, y compris évolutifs) seront mis au point pour résoudre le problème de transport proposé...
  • curprev 07:5107:51, 2 December 2021DG Regio talk contribs 12,669 bytes +314 Changed label, description and/or aliases in fr: translated_label

29 October 2020

21 October 2020

  • curprev 10:0810:08, 21 October 2020DG Regio talk contribs 12,794 bytes +255 Changed label, description and/or aliases in 1 language: translated_label
  • curprev 10:0810:08, 21 October 2020DG Regio talk contribs 12,539 bytes −265 Changed label, description and/or aliases in 1 language: remove_english_label
  • curprev 10:0810:08, 21 October 2020DG Regio talk contribs 12,804 bytes +1,710 Created claim: summary (P836): The aim of the project is to develop a new variant of a complex transport problem reflecting actual transport scenarios, such as dynamically variable travel costs, different fleet capacity, time windows with margins, and defining travel preferences. New algorithms (accurate and approximate, including evolutionary) will be developed to solve the proposed transport problem and to predict the demand for transport services (e.g. based on historical...
  • curprev 10:0810:08, 21 October 2020DG Regio talk contribs 11,094 bytes −1,302 Removed claim: summary (P836): The aim of the project is to develop a new option for a complex transport problem reflecting the actual transport scenarios, such as the dynamic variable cost of a journey, the variable capacity of the vehicles in the fleet, the time windows and the margin, or the definition of trip preferences. New algorithms (accurate and rough, including evolutionary) will be developed to address the proposed transport problem and to anticipate the demand f...

24 September 2020

22 June 2020

10 June 2020

7 June 2020

26 March 2020

10 March 2020

  • curprev 09:5409:54, 10 March 2020DG Regio talk contribs 11,106 bytes +1,302 Created claim: summary (P836): The aim of the project is to develop a new option for a complex transport problem reflecting the actual transport scenarios, such as the dynamic variable cost of a journey, the variable capacity of the vehicles in the fleet, the time windows and the margin, or the definition of trip preferences. New algorithms (accurate and rough, including evolutionary) will be developed to address the proposed transport problem and to anticipate the demand for...

25 February 2020

18 February 2020

31 January 2020

14 January 2020