EP 3830770 A1 20210609 - DETERMINING AT LEAST ONE SCHEDULE FOR AT LEAST ONE MEANS OF TRANSPORT FROM A PLURALITY OF MEANS OF TRANSPORT
Title (en)
DETERMINING AT LEAST ONE SCHEDULE FOR AT LEAST ONE MEANS OF TRANSPORT FROM A PLURALITY OF MEANS OF TRANSPORT
Title (de)
BESTIMMEN MINDESTENS EINES FAHRPLANS FÜR MINDESTENS EIN VERKEHRSMITTEL AUS EINER MEHRZAHL VON VERKEHRSMITTELN
Title (fr)
PROCÉDÉ DE DÉTERMINATION D'AU MOINS UN HORAIRE D'AU MOINS UN MOYEN DE TRANSPORT PARMI UNE PLURALITÉ DE MOYENS DE TRANSPORT
Publication
Application
Priority
- DE 102018212968 A 20180802
- EP 2019068397 W 20190709
Abstract (en)
[origin: WO2020025265A1] The invention is directed at a method for determining at least one schedule for a means of transport from a plurality of means of transport, having the steps of receiving at least one input data record; wherein the at least one input data record has user data for at least one user and at least one further piece of information; and determining the at least one schedule for the means of transport from the plurality of means of transport by optimising an optimisation function by taking into consideration the at least one input data record. Further, the invention is directed at a corresponding unit and a computer program product.
IPC 8 full level
G06Q 10/04 (2012.01)
CPC (source: EP US)
G06Q 10/047 (2013.01 - EP US); G06Q 10/06312 (2013.01 - US); G07C 5/008 (2013.01 - US)
Citation (search report)
See references of WO 2020025265A1
Designated contracting state (EPC)
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
Designated extension state (EPC)
BA ME
DOCDB simple family (publication)
WO 2020025265 A1 20200206; DE 102018212968 A1 20200206; EP 3830770 A1 20210609; SG 11202100990W A 20210225; US 2021166175 A1 20210603
DOCDB simple family (application)
EP 2019068397 W 20190709; DE 102018212968 A 20180802; EP 19745994 A 20190709; SG 11202100990W A 20190709; US 201917263319 A 20190709