EP3830770A1 - Bestimmen mindestens eines fahrplans für mindestens ein verkehrsmittel aus einer mehrzahl von verkehrsmitteln - Google Patents
Bestimmen mindestens eines fahrplans für mindestens ein verkehrsmittel aus einer mehrzahl von verkehrsmittelnInfo
- Publication number
- EP3830770A1 EP3830770A1 EP19745994.4A EP19745994A EP3830770A1 EP 3830770 A1 EP3830770 A1 EP 3830770A1 EP 19745994 A EP19745994 A EP 19745994A EP 3830770 A1 EP3830770 A1 EP 3830770A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- transport
- user
- schedule
- unit
- feedback
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 claims abstract description 34
- 238000004590 computer program Methods 0.000 claims abstract description 12
- 238000005457 optimization Methods 0.000 claims description 14
- 238000010276 construction Methods 0.000 claims description 3
- 230000007257 malfunction Effects 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 claims 1
- 238000013459 approach Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C5/00—Registering or indicating the working of vehicles
- G07C5/008—Registering or indicating the working of vehicles communicating information to a remotely located station
Definitions
- the invention relates to a computer-implemented method for determining at least one timetable for at least one means of transport from a plurality of means of transport. Furthermore, the invention is directed to a corresponding determination unit and computer program product.
- the invention can be located particularly in the technical fields of automation and mobility.
- Timetables are known from the prior art.
- the timetable for local and long-distance public transport and rail freight transport usually determines the route of a means of transport.
- the timetable includes the arrival and departure times of the means of transport at the respective stopping points.
- the timetable can also include further information.
- the timetable can also be presented in the appropriate media.
- the approaches according to the state of the art take into account certain customer-specific and operator-specific criteria, in particular in the form of experiences of users or operators from the past.
- the result of these approaches is always a fixed road map.
- the resulting timetables are set and therefore not adaptable or adaptable to current conditions or other changing factors such as customer needs or traffic volume.
- the present invention therefore has as its object to provide a method for determining at least one timetable for at least one means of transport from a plurality of means of transport, which is efficient and reliable and enables increased adaptability.
- a method for determining at least one timetable for at least one means of transport from a plurality of means of transport comprising the steps: a. Receiving at least one input data set; where at b. the at least one input data record has user data of at least one user and at least one further indication; and c. Determining the at least one timetable for the at least one means of transport from the plurality of means of transport Optimizing an optimization function taking into account the at least one input data record.
- the invention is directed to a method for determining a schedule for loading at least one means of transportation from a plurality of means of transportation.
- the method according to the invention creates a schedule information for a means of transport.
- the timetable can also be referred to as a timetable information or route, according to which the means of transport travels.
- the means of transport is designed as any means of transport by road or rail, for example a car, a bus or a train.
- the determined schedule can be given to a user for its further use. For example, a driving schedule for a predetermined destination or a predetermined route is created for a user.
- the timetable can be shown to the user on a display of his end device, such as a smartphone.
- an input data record is received.
- the input data record can be received by a determination unit, such as an autonomous unit or software unit, via one or more interfaces.
- the input data record comprises two different data records or information, namely user data and one or more additional information.
- the user data is user-related data and can also be referred to as user requests or user requests.
- the user data can refer to current data or data from the past.
- the user can specify specific, desired or essential user data for his current destination.
- user experiences from the past can also be specified.
- the further information relates to background information and / or other conditions, such as means of transport and / or road or rail traffic.
- the user data can have the necessary information, such as the starting point, the destination and the departure time.
- the user can specify the user data with regard to his needs, such as maximum waiting time for the means of transport and / or maximum time with the means of transport, etc.
- the further details can include general information about the transport network as well as current conditions or anomalies, such as traffic volume or accidents, etc. . deliver.
- the schedule is determined by optimizing an optimization function taking into account the at least one input data record.
- the objective function of the optimization problem takes into account the user data and other constraints such as Traffic volume, other travel requests, available vehicles, cost and environmental requirements and the like.
- the optimization problem is a non-linear program with constraints.
- the means of transport follow predefined routes and timetables.
- the means of transport depart from the stopping points at stipulated times. Changing factors such as demand or accidents are not sufficiently taken into account.
- the method according to the invention advantageously enables flexible and dynamic schedule determination. Therefore, the specific schedule is not fixed or specified.
- the timetable can be efficiently and reliably adjusted in real time to user requirements, demand and / or incidents.
- the at least one user inputs the user data by means of a unit, the user data is queried from a storage unit or the user data is transmitted from another unit. Accordingly, the user data can be generated in different ways and in particular received by the determination unit or its interface.
- the user can enter the user data using a unit, such as a terminal, via a keyboard or a voice command.
- the user data is received by the unit.
- the user data can also be stored in a memory unit and queried therefrom.
- the user data are received by the storage unit.
- the storage unit can be designed as a database, cloud or other volatile, non-volatile storage unit which can be accessed in an efficient and reliable manner.
- the current user data can be temporarily stored or user data from the past can be collected in a database.
- the user data can also be received via another unit, such as a computing unit.
- the user data has at least one user information selected from the group consisting of
- Starting point of the means of transport destination of the means of transport, departure time, arrival time, predetermined route at least in part, distance of the user to the starting point, travel time with the at least one means of transport, availability of the at least one means of transport, price limit and waiting time for at least one means of transport.
- the at least one further indication is selected from the group consisting of the number of means of transport, the respective size of the means of transport from the plurality of means of transport, other data relating to the at least one means of transport and data of the drivers of the means of transport.
- the at least one further item is selected from the group consisting of a traffic situation, a traffic volume, a traffic network, a disruption, a construction site, an accident, a blockage, a demand requirement, a boundary condition, a special case and other data in terms of traffic or anomalies.
- the at least one timetable for the at least one means of transport from the plurality of means of transport specifies at least one optimal route for the user, in particular
- the minimum distance to the starting point of the at least one means of transport the minimum travel time with the at least one means of transport, the minimum price for the at least one means of transport and the minimum waiting time for the at least one means of transport.
- the schedule can advantageously be flexibly and dynamically adapted to the requirements, and in particular can thus be tailored to the user.
- the transport system can also respond to demand and other circumstances.
- the method further comprises transmitting the at least one schedule to a unit.
- the schedule is transmitted to a unit, such as a terminal or computing unit.
- a user can view the user data transmitted to the determination unit via a terminal for determining its schedule.
- the determination unit determines the schedule and sends it back to the end device of the user.
- the timetable can be displayed to the user as a text message or other message on the terminal.
- the method further comprises receiving at least one feedback from the user on the at least one schedule for the at least one means of transport from the plurality of means of transport;
- the user can react after receiving the schedule. He can send a feedback ("feedback") on the schedule via his terminal or other computing unit to the destination unit.
- the feedback can be included in the optimization as a new additional information.
- the additional information can include the maximum price or the maximum distance to the Continue specifying the starting point. As a result, the feedback is used to optimize it again and the timetable is improved.
- the at least one user enters the at least one feedback by means of a unit, the at least one feedback is queried from a storage unit or the at least one feedback is transmitted by another unit.
- the method further comprises analyzing the at least one schedule and / or storing the at least one schedule.
- the schedule can be transmitted to the user's end device for feedback.
- the schedule can also be analyzed and / or saved, for example in order to build up a set of experiences and to incorporate the experience as further information from a storage unit into the optimization.
- the invention further relates to a determination unit for performing the above method.
- the unit can be designed as an autonomous unit, computing unit, control unit or other unit.
- the invention further relates to a computer program product with a computer program, the means for carrying out the method described above when the computer program is executed on a program-controlled device.
- a computer program product such as a computer program means, for example as a storage medium, e.g. Memory card, USB stick, CD-ROM, DVD, or also in the form of a downloadable file from a server in a network. This can be done, for example, in a wireless communication network by transferring a corresponding file with the computer program product or the computer program means.
- a control device such as an industrial control PC or a programmable logic controller or a programmable logic controller, or PLC for short, or a microprocessor for a smart card or the like can be used as a program-controlled device.
- FIG. 1 shows a schematic flow diagram of the method according to the invention.
- Figure 1 shows a flowchart of the method according to the invention with the method steps S1 and S2 schematically.
- the individual method steps S1 and S2 can each be carried out by the determination unit 20 or its subunits.
- the method steps S1 to S2 are explained in detail according to the exemplary determination unit 20 in FIG. 2.
- the input data record 12 comprises user data and one or more further details.
- the user data can be specified by the user by means of an application on a terminal 10. For example, the user can specify his desired starting point, destination, departure and / or arrival time as user data.
- the further information can relate to the majority of the means of transport, such as size, availability of the means of transport, or other boundary conditions, such as the current traffic situation.
- This input data record 12 is transmitted for reception to the determination unit 20 for determining the timetable for the means of transport.
- Energy consumption, travel time, waiting time and traffic volume are further exemplary input data and call closures.
- input data record 12 In order to avoid unnecessary repetitions, reference is made to the above statements regarding the input data record 12.
- the determination unit 20 receives the input data record 12.
- a second method step S2 optimization is carried out by the determination unit 20 based on the input data record 12 received.
- the result of this optimization is the timetable 22 for the means of transport.
- the timetable 22 can include stops and departure times which can be transmitted to the user.
- the stops are not predetermined stop points.
- the stop can also be temporarily at the front door of the user, especially depending on the available vehicle class and / or other conditions.
- the user can implement his transportation request. For example, the above application can inform the user that it is advantageous in terms of time to walk to the next street corner, since a means of transport will soon pass by instead of waiting long. Furthermore, a pick-up service from the bus stop or the exclusive use of the means of transport can be offered, especially depending on the capacity of the means of transport. Furthermore, the user can be motivated by reduced prices to get on and off with other passengers along well-established main routes at favorable stops and to take a longer walk.
- the user can then react to the received schedule 22 and send feedback 14 on the schedule to the determination unit 20.
- the feedback 14 can be included in the optimization and consequently advantageously taken into account as a decision, boundary condition and / or specification of the user.
- the result of this further op- Timing is the extended timetable 24 for the means of transport.
- the method according to the invention consequently ensures that users' needs are taken into account and that they react dynamically to the user.
- the method is applicable to any means of transport.
- the main routes can advantageously be formed by the optimization at peak times and thus high demand.
- a taxi-like operation can form if there is little traffic and thus times of low demand. This means that the means of transport can also be kept attractive at night by offering a taxi-like service.
- Smaller vehicles have the option of letting users get on and off on secondary roads or driving on a large plateau with other vehicles in a "platoon”.
- Autonomous vehicles can be used flexibly and easily, and can be taken out of service again take with no manpower or cost.
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102018212968.1A DE102018212968A1 (de) | 2018-08-02 | 2018-08-02 | Bestimmen mindestens eines Fahrplans für mindestens ein Verkehrsmittel aus einer Mehrzahl von Verkehrsmitteln |
PCT/EP2019/068397 WO2020025265A1 (de) | 2018-08-02 | 2019-07-09 | Bestimmen mindestens eines fahrplans für mindestens ein verkehrsmittel aus einer mehrzahl von verkehrsmitteln |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3830770A1 true EP3830770A1 (de) | 2021-06-09 |
Family
ID=67480163
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP19745994.4A Withdrawn EP3830770A1 (de) | 2018-08-02 | 2019-07-09 | Bestimmen mindestens eines fahrplans für mindestens ein verkehrsmittel aus einer mehrzahl von verkehrsmitteln |
Country Status (5)
Country | Link |
---|---|
US (1) | US20210166175A1 (de) |
EP (1) | EP3830770A1 (de) |
DE (1) | DE102018212968A1 (de) |
SG (1) | SG11202100990WA (de) |
WO (1) | WO2020025265A1 (de) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116562486B (zh) * | 2023-06-01 | 2023-11-28 | 中诚华隆计算机技术有限公司 | 城市生活垃圾运输路线的优化方法及装置 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CH440781A (de) * | 1965-09-27 | 1967-07-31 | Radicevic Rikard | Verfahren zur Herstellung eines Fahrplanes und nach dem Verfahren hergestellter Fahrplan |
DE10025268B4 (de) * | 2000-05-22 | 2005-01-27 | Siemens Ag | Verfahren zur Fahrplanerstellung, Anordnung mit einem Prozessor sowie entsprechendes Computerprogramm-Erzeugnis und entsprechendes computerlesbares Speichermedium |
DE10147231A1 (de) * | 2001-09-14 | 2003-04-03 | Siemens Ag | Verfahren und Anordnung zur Fahrplanoptimierung in Liniennetzen sowie ein entsprechendes Computergrogramm-Erzeugnis und ein entsprechendes computerlesbares Speichermedium |
DE10329258A1 (de) * | 2003-06-23 | 2005-01-27 | Siemens Ag | Verfahren zur Erstellung und Modifikation von Fahrplänen |
EP2881712A1 (de) * | 2007-11-24 | 2015-06-10 | Routerank Ltd | Optimierte Routenplanung |
DE102016214057A1 (de) * | 2016-07-29 | 2018-02-01 | Siemens Aktiengesellschaft | Verfahren und Einrichtung zum Überarbeiten wenigstens eines geplanten Fahrplans einer verkehrstechnischen Anlage |
-
2018
- 2018-08-02 DE DE102018212968.1A patent/DE102018212968A1/de not_active Ceased
-
2019
- 2019-07-09 EP EP19745994.4A patent/EP3830770A1/de not_active Withdrawn
- 2019-07-09 US US17/263,319 patent/US20210166175A1/en not_active Abandoned
- 2019-07-09 WO PCT/EP2019/068397 patent/WO2020025265A1/de unknown
- 2019-07-09 SG SG11202100990WA patent/SG11202100990WA/en unknown
Also Published As
Publication number | Publication date |
---|---|
WO2020025265A1 (de) | 2020-02-06 |
US20210166175A1 (en) | 2021-06-03 |
SG11202100990WA (en) | 2021-02-25 |
DE102018212968A1 (de) | 2020-02-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE602005002960T2 (de) | Fahrzeuginformations-Sammelsstem mit Punktevergabeeinrichtung | |
DE112016003722T5 (de) | Systeme und verfahren zum einstellen von fahrplänen und strecken für mitfahrgelegenheiten | |
WO2018127411A1 (de) | Verfahren und system zum bereitstellen einer zumindest teilweise automatischen führung eines folgefahrzeugs | |
EP3755591B1 (de) | System und verfahren zur automatischen einstellung von fahrzeugfunktionen | |
EP3807121A1 (de) | Ladesystem zur dynamischen aufladung von elektrofahrzeugen | |
DE102015208287A1 (de) | Gemeinschaftsfahrzeugsysteme und -verfahren | |
EP2532563A2 (de) | Verfahren zur Kalkulation einer Fahrempfehlung | |
DE102006017845A1 (de) | System und Verfahren zur Parkbuchtreservierung für LKWs | |
DE102017011694A1 (de) | Transportsystem und Verfahren zum Betreiben eines Transportsystems | |
DE102018125621A1 (de) | Verfahren zum Unterstützen eines Fahrbetriebs eines Kraftfahrzeugs und zum Betreiben eines Kraftfahrzeugs, Kraftfahrzeug und Servereinrichtung | |
DE19636379C1 (de) | Verfahren zur Steuerung des Transport- und Reiseverkehrs | |
WO2020025265A1 (de) | Bestimmen mindestens eines fahrplans für mindestens ein verkehrsmittel aus einer mehrzahl von verkehrsmitteln | |
WO2018171991A1 (de) | Verfahren zum fernsteuern von mehreren führerlosen selbstfahrsystemen sowie leitstand zum fernsteuern der selbstfahrsysteme und system | |
DE10009727A1 (de) | Navigationseinheit für ein Kraftfahrzeug | |
WO2020119987A1 (de) | Verfahren zur bereitstellung von kartendaten einer digitalen karte und einer fahrtroute | |
EP3789983A1 (de) | Zentralisierte regulierung eines verkehrsflusses | |
EP2416122A2 (de) | Verfahren zum Betrieb eines Navigationssystems | |
DE102018214001B4 (de) | Verfahren zum Betreiben einer Ausgabeeinrichtung eines Kraftfahrzeugs, Kommunikationseinrichtung, Kraftfahrzeug, und Servervorrichtung zum Betreiben im Internet | |
EP3084352B1 (de) | System zur individualisierten streckenführung unter berücksichtigung externer faktoren | |
DE102016218113A1 (de) | Bedarfsorientierter Einsatz von Transportfahrzeugen im öffentlichen Personenverkehr | |
DE102018216042A1 (de) | Verfahren und vorrichtung zum automatisierten fahren eines fahrzeugs, und fahrzeug | |
EP4181037A1 (de) | Prädiktive betriebsanpassung einer serviceeinrichtung für fortbewegungsmittel | |
DE102004008834A1 (de) | Verfahren und System zur Erfassung von Mautdaten | |
WO2021213910A1 (de) | Verfahren zum elektronischen verwalten und überprüfen einer verfügbarkeit einer dienstleistung, sowie computerprogrammprodukt und elektronisches verwaltungssystem | |
DE102010009443A1 (de) | Verfahren und Vorrichtung zur Bestimmung mindestens einer gewünschten Reiseverbindung |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20210120 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): 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 |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20220405 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20230801 |