EP3411838A1 - Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets - Google Patents

Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets

Info

Publication number
EP3411838A1
EP3411838A1 EP17703421.2A EP17703421A EP3411838A1 EP 3411838 A1 EP3411838 A1 EP 3411838A1 EP 17703421 A EP17703421 A EP 17703421A EP 3411838 A1 EP3411838 A1 EP 3411838A1
Authority
EP
European Patent Office
Prior art keywords
transport
routes
objects
time
vehicles
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.)
Pending
Application number
EP17703421.2A
Other languages
German (de)
English (en)
Inventor
Stephan Herminghaus
Marc TIMME
Andreas Sorge
Matthias Wendland
Johannes Kassel
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Max Planck Gesellschaft zur Foerderung der Wissenschaften eV
Original Assignee
Max Planck Gesellschaft zur Foerderung der Wissenschaften eV
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Max Planck Gesellschaft zur Foerderung der Wissenschaften eV filed Critical Max Planck Gesellschaft zur Foerderung der Wissenschaften eV
Publication of EP3411838A1 publication Critical patent/EP3411838A1/fr
Pending legal-status Critical Current

Links

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/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
    • 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/123—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams
    • G08G1/127—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams to a central station ; Indicators in a central station
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching

Definitions

  • the invention relates to a method for transporting a plurality of objects with a plurality of transport vehicles, wherein a start location and a destination and a start time and / or a target time are noted for each object, as well as with the further features of the preamble of independent claim 1. Furthermore, the invention relates to a data server for carrying out such a method and its use.
  • the www.bridj.com website describes a bus transportation system that adapts the availability of bus services between departure points and destinations to passengers' needs. This need is determined using GPS data from cell phones, social media posts, and the like.
  • EP 1 076 326 A2 describes a method and a communication system for controlling a plurality of mobile stations to destinations.
  • the current position in each mobile station is determined by means of a position determination device, and position data are generated.
  • the position data from the mobile stations are transmitted to at least one coordination station.
  • the transmitted position data of the mobile station is evaluated, and command data for optimizing the movements of the mobile station to the respective destinations are generated in the coordination station.
  • the command data is transmitted from the coordination station to the mobile stations.
  • a transport service system is known.
  • at least one taxi detects its current location with a GPS and sends the current location and information to a destination specified by a customer to a central unit.
  • the central unit determines an optimal route and a price for the route according to the Information about the current location and the destination. Then the central unit transmits the optimal route and the price to the taxi.
  • the invention has for its object to provide a method for transporting a plurality of objects with multiple transport vehicles between object-specific locations that optimizes the travel routes of the transport vehicles with controllable effort so that they are on the one hand well busy and on the other hand predetermined start and / or finish times of transported objects are well respected.
  • the object of the invention is achieved by a method having the features of independent patent claim 1.
  • the dependent claims 2 to 1 1 relate to preferred embodiments of the method according to the invention.
  • the claim 12 is directed to a data server for carrying out the method according to the invention.
  • Dependent claims 13 to 15 relate to preferred embodiments of the data server.
  • Claim 16 relates to the use of the data server according to the invention for carrying out the method according to the invention.
  • the method according to the invention is based on a method for transporting a plurality of objects with a plurality of transport vehicles, wherein a start location and a destination as well as a start time and / or a destination time are noted for each object. Furthermore, a transport capacity and an actual location are noted for each transport vehicle, and a transport path network of possible transport routes of the transport vehicles with average speeds of the transport vehicles on the transport routes is defined. For this purpose, the actually possible transport routes of the transport vehicles and the associated average speeds of the transport vehicles are determined on these transport routes.
  • Suitable transport routes are those on which the temporal requirements contained in the object coordinates can be met with the average speeds of the transport vehicles on the transport routes.
  • suitable transport routes for different objects are bundled to travel routes of individual transport vehicles, whereby the transport capacity and the actual locations of the transport vehicles are taken into account.
  • a core of the method according to the invention is addressing the optimization of the travel routes to be traveled by the individual transport vehicles in a space-time.
  • this space-time which not only takes into account the spatial coordinates of the starting locations and the destinations and the appropriate transport routes between them, but also the time as a coordinate, the only possible, and in particular the possibly meaningful, routes are easy to identify as a bundle of transport routes of various objects.
  • possible transport routes for different objects can be grouped according to their distances in space-time for potential bundling as suitable transport routes, or vice versa due to their distances in space-time directly excluded from such bundling.
  • the transport path network is regularly a two-dimensional transport path network along the earth's surface or at least can be regarded as a two-dimensional transport path network in the projection onto the earth's surface
  • the space-time to be used in the method according to the invention is only a three-dimensional space.
  • the listing of the object coordinates and the transport routes as well as the comparison of the transport routes in space-time can be controlled.
  • the courses of the transport routes and their inventive bundling in this three-dimensional space-time is also very vivid, so that the inventive method can be performed not only fully automatic, but also at least partially manually, for example in the beginning of the bundle of suitable transport routes for different objects.
  • the notation of coordinates, such as the object coordinates, and the recording and bundling of transport routes in space-time means storing this data in a special one Data format as well as their handling and processing in a special data room, the space-time.
  • the actual locations of the 5 transport vehicles with the current time can also be noted as vehicle coordinates in space-time.
  • the actual locations of the transport vehicles can be observed by using the transport path network to determine suitable all possible transport routes between the vehicle coordinates and adjacent starting locations and associated start times in space time, noted in the space time and included in bundling in space-time.
  • the actual locations of the transit vehicles and the current time are thereby taken into account in space time as well as the object coordinates of the objects to be transported.
  • Space-time recording makes it possible to easily take into account time periods required to pick up an object in a transport vehicle and to dump an object from a transport vehicle, recording them in space-time and noting the appropriate transport routes for the space-time Objects in space-time are taken into account.
  • the start times and / or target times of the objects in the spacetime are noted as time windows, i. H. not as times.
  • the time window can be defined by a time and a tolerance range, wherein the tolerance range can extend on both sides of the time or even on only one side of the time. The latter then means, for example, a start time or a finish time from the time to the time
  • the time windows can be noted down with individual width. Thus, a very narrow time window can be noted for a specific object, because it is to be included in a transport vehicle at a certain time or output from the transport vehicle, while other objects are assigned very wide time windows whose actual recording or output times are less critical . If only one start time or one finish time is noted for an object to be transported next to its start location and destination, the other start or finish time results from the possible transport routes between the start location and the destination and the associated average speeds of the transport vehicles on the transport routes. If both a start time and a finish time are noted, this restricts the possible transport routes from those that can be covered in the time difference between the destination time and the start time.
  • the method according to the invention can also incorporate scheduled transport into the transport. This applies in particular to passengers as objects to be transported.
  • the starting locations and destinations as well as the starting times and destinations of existing line transport means which lie within periods between the start times and the destination times of the objects to be transported, may additionally be noted in the space-time and included in the determination of suitable transport routes in such a way that take the line transport sections of the respective transport route.
  • the transport capacity is preferably noted in the form of a certain number of objects that can be transported at maximum. This number of objects can be noted for all transport vehicles with the same value, which simplifies the optimization of the routes. In principle, however, the transport capacities can also be recorded individually in units other than the number of objects and for each transport vehicle.
  • main roads connecting main points can be defined in the transport network.
  • the possible transport paths can be limited to those which extend from the starting location of the object to one of the nearest nodes, from one of the nearest nodes to the destination of the object and between these nodes exclusively on the main routes , This prioritization of the main routes considerably reduces the number of suitable transport routes to be compared. It is understood, however, that also in this embodiment of the invention for closely spaced starting locations and destinations and appropriate transport routes are determined, which do not run on main roads or not even on the nodes.
  • the above-outlined hierarchy of the transport routes can be extended by at least one further level in the method according to the invention.
  • the possible main routes can be limited to those of the nearest one of the starting point nodes to one of this node nearest Node centers to which one of the nodes closest to the destination runs from one of the node centers closest to this node and between the node centers exclusively on the main lines.
  • the routes of regular transport can be taken into account.
  • suitable transport routes are also determined for locations and destinations closer to each other that do not run over main lines or even beyond the nodal centers.
  • the reduced by the prioritization of certain transport routes number of matching with each other suitable transport routes is crucial if different combinations of possible routes of individual transport vehicles are compiled and compared with each other when bundling suitable transport routes of different objects.
  • the resulting number of comparisons is considerably limited by the restriction of the appropriate transport routes and thus possibly even manageable.
  • the criteria according to which an optimization is carried out when bundling suitable transport routes for different objects to travel routes can comprise in particular the following:
  • Minimized operating costs of the used transport vehicles can be used individually or in combination. When applied in combination, they can be weighted to each other using weighting factors become. Such weighting can also be carried out for individual objects or transport vehicles. Thus, for example, certain of the transport vehicles can be predominantly utilized and / or certain objects can be transported under preferential observance of the start times and / or the destination times because a higher transportation fee is paid for this than for other objects.
  • the personnel costs of drivers of the transport vehicles must also be taken into account on a regular basis.
  • Another way to simultaneously optimize for multiple criteria is to search for a so-called Pareto optimum. This is a point where all criteria are simultaneously optimally fulfilled in the sense that there is no possibility to further optimize the fulfillment of one criterion without worsening the fulfillment of another.
  • the method according to the invention can also consider newly added objects to be transported. In practice, the method according to the invention will even rarely be carried out in such a way that no objects to be transported are newly added during the travel route. Concretely, in the case of additional objects to be transported, their locations, destinations, start times and / or destination times as well as suitable transport routes are supplemented, and the bundling to the transport routes takes into account the current actual locations of the transport vehicles, their current loading with objects and their destinations and / or destinations. time again. Resulting new routes are transmitted to the participating transport vehicles. In this way, it may be necessary to change the travel routes of the transport vehicles to receive an added object to be transported and spend again.
  • the transports carried out of the objects with the transport vehicles are preferably detected and associated with a cost value predetermined according to a tariff.
  • This cost can then determine the fare that a passenger has to pay.
  • the passenger can pay the fare directly to the driver of the transport vehicle.
  • the cost value can be transmitted to at least one transport cost accounting unit, which then, for example, collects the fare of the passenger or the freight costs for goods cashlessly.
  • a data server for carrying out the method according to the invention has at least one interface for receiving starting locations, destinations, starting times and / or destination times of a plurality of objects and of actual locations of a plurality of transport vehicles. Furthermore, the data server comprises a database for storing a transport path network of possible transport routes of the transport vehicles with average speeds of the transport vehicles on the transport routes. In addition, the at least one or a further interface for issuing travel routes to participating transport vehicles is provided. In this case, the server is programmed to carry out the method according to the invention.
  • the data server according to the invention implements the method according to the invention at a central location in order to coordinate the available transport vehicles with respect to the transport of the objects to be transported.
  • Each interface of the data server according to the invention can be realized by any known telecommunications interface that allows the specified receiving or outputting of data.
  • This interface does not have to be specifically associated with the data server according to the invention, but only be connected to the part of the data server on which the program implementing the method according to the invention runs.
  • the further interface for issuing travel routes may practically be the same at least one interface as for receiving starting locations and destinations, starting times and / or destination times of the objects and for receiving actual locations of the transport vehicles, and this interface may be realized by means of Internet access be.
  • each interface for receiving or for outputting for data communication can be designed with mobile terminals.
  • These mobile terminals may include tablets, mobile phones, smartphones and / or personal digital assistants (PDAs).
  • PDAs personal digital assistants
  • a passenger as object to be transported can transmit his object data via his mobile phone to the data server.
  • the passenger can receive confirmation of his object data via the same mobile telephone.
  • the mobile phone of a driver of a transport vehicle can continuously transmit the actual location of the transport vehicle to the data server and in return receive the route for the respective transport vehicle. This route can be directly output as a navigation display to guide the driver of the transport vehicle along the route with the starting locations and destinations on it.
  • each interface of the data server according to the invention can be designed for data communication with the respective mobile terminal via an application program which is programmed on the respective mobile terminal.
  • an application program which is programmed on the respective mobile terminal.
  • Such a user program simplifies the data communication with the respective user, i. H. a passenger or driver of one of the transport vehicles.
  • Such user programs are also referred to as app.
  • the data server according to the invention can furthermore have an interface for transmitting a cost value of a completed transport to at least one transportation cost accounting unit.
  • the interface may also be an otherwise used or an additional interface of the data server.
  • the transport cost accounting unit can be a mobile telecommunications provider of the operator of the respective mobile terminal.
  • the fare that a passenger has to pay be charged with the mobile phone bill.
  • an interface for transmitting object data to the objects can be provided to a display device, which is located in or on the transport vehicle carrying the respective objects.
  • the data server When using the data server according to the invention in the inventive method for transporting a plurality of objects with multiple transport vehicles at the interface of the data server for each object its starting location and its destination and the start time and / or the target time and further to each transport vehicle whose transport capacity and Received actual location.
  • the transport capacities and the transport path network of possible transport routes of the transport vehicles with the average speeds of the transport vehicles on the transport routes are stored in the database of the data server.
  • the data server For each object, the data server records its starting location and its destination, as well as the respectively associated start time and / or destination time, as object coordinates in space-time, ie stores them in the data format prescribed thereby.
  • the data server determines for each object, based on the transport path network stored in its database, suitable all possible transport paths between its object coordinates and records them in space-time. Then, in the spacetime, the data server bundles suitable transport paths for different objects to travel routes of individual transport vehicles, wherein the transport capacity and the actual locations of the transport vehicles are taken into account by the data server. Via the interface of the data server, via which he has received the input data, or via a further interface of the data server, the travel routes with the starting locations, the start times, the destinations and the destination times of the associated objects are transmitted to the participating transport vehicles.
  • Fig. 1 shows object coordinates with associated transport routes bundled to transport routes.
  • Fig. 2 schematically illustrates the definition of node-connecting transport paths of a transport path network.
  • Fig. 3 illustrates the price demand dynamics in a call bus.
  • Fig. 4 is a flowchart of the method according to the invention.
  • Fig. 5 is a block diagram of the data server according to the invention.
  • FIG. 1 illustrates the recording of object coordinates to objects to be transported in a space-time, wherein in the x- and y-direction, the spatial coordinates of the respective starting location are indicated with an open symbol, while the same closed symbol marks the destination.
  • the associated start times and target times are noted in the third spatial direction along the time axis.
  • Possible transport routes between the starting locations and destinations are specified by a transport path network, not shown here. This transport network does not only describe the course of these transport routes in the x- and y-direction, but also the average speeds of the transport vehicles on the transport routes and thus limits the in space-time also temporally possible transport routes.
  • Fig. 1 In the spacetime to various objects suitable all possible transport routes are bundled to routes of individual transport vehicles, the transport capacities and the actual locations of the transport vehicles are considered.
  • Fig. 1 two such bundles of transport routes, which are also referred to herein as travel routes, shown for two different transport vehicles.
  • the one transport route for the one transport vehicle begins at the open circle and ends at the closed circle, while the other transport route for the other transport vehicle begins at the open four-pointed star and ends at the closed sun.
  • various object coordinates are always found in the correct order of starting location with associated start time before destination with associated destination time.
  • a transport path network is used for determining the suitable transport routes, in which, as illustrated in FIG. 2, main routes 2 are defined, which connect nodes 3 to each other.
  • the possible transport routes are limited to those which extend from the starting point 4 of the respective object to one of the closest nodes 3 and from there via main routes 2 to one of the destination 5 of the respective object nearest nodes 3 lead.
  • a solid line indicates a relative demand which would be necessary for a cost-covering operation of a call bus given a fare given in relation to the cost of a private car.
  • the dashed curve indicates an estimated price-demand relationship. If the fare approaches the cost of your own car, indicated by a dotted line, from the right, demand increases sharply; in every area where the dashed curve is above the solid curve, a cost-covering operation of the call bus is to be expected.
  • the logarithmic representation of demand shows that the estimated price-demand relationship need not be very accurate to demonstrate that you get three intersections of the two curves. However, the average intersection point stands for an unstable operation point. If the fare increases, ie to the right in FIG. 3, the demand drops rapidly and the system moves after a short time to the right intersection point. This is a stable operation point. But it only designates a niche market with a fare equivalent to about four to five times the operating costs of a private car. On the other hand, it would be interesting to cut costs from the middle intersection to the left intersection, where most of the mobility needs are served by on-demand local public transport and this is cost-covering. With the achieved by the inventive method optimization of the routes of each transport vehicles this is possible.
  • the flowchart of the method according to the invention according to FIG. 4 begins with a step 11 in which a transport path network for the available transport vehicles is defined.
  • the transport path network is defined with nodes that are connected by main routes, see FIG. 2.
  • object coordinates ie starting locations and associated start times as well as destinations and associated destination times of objects to be transported, are noted in space-time.
  • suitable transport paths between the object coordinates of each object, which are possible according to the transport path network are then determined and noted in space-time.
  • suitable transport routes are bundled to travel routes for the individual transport vehicles. The transport capacities and the actual locations of the available transport vehicles are taken into account.
  • a comparison of different bundles of the transport routes is carried out according to predetermined criteria, in order to select a bundling with which a maximum possible fulfillment of all criteria is achieved.
  • the travel routes are transmitted to the transport vehicles involved in the transport of the respective objects to be transported, together with the starting locations and start times as well as destinations and destination times of the objects to be transported by the respective vehicle.
  • a closed loop runs through the steps 12 to 15, so that additional objects can also be taken into account. With each repetition of step 12, the actual location of the respective transport vehicle and the actual time can then be used as the current starting location and associated start time of the objects already taken up in a transport vehicle.
  • the data server 16 illustrated as a block diagram in FIG. 5 comprises a controller 17 programmed to carry out the method according to the invention, a database 18 for storing a transport capacity of the transport vehicles and a transport network of possible transport routes of the transport vehicles with average speeds of the transport vehicles on the transport routes and an interface 19.
  • the data server 16 communicates, for example via the Internet 20 and / or mobile networks with terminals 21 and 22.
  • the terminals 21 may be those of passengers who want to be transported as objects in a call bus while the End devices 22 are such in serving as transport vehicles call buses.
  • special application programs are programmed to facilitate the communication of the users of the terminals 21 and 22 with the data server 1 6.
  • a potential passenger can first inquire at the data server 16, which transport option would be given on which terms for him before he specifically requests the transport.
  • the data server 16 can also communicate via the interface 19 with a transport cost accounting unit 23, in order to transmit to this a cost value of a successful transport, so that there is a cashless collection of the travel fee.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

Pour transporter un grand nombre d'objets avec une pluralité de véhicules de transport, on note pour chaque objet un lieu de départ et un lieu d'arrivée ainsi qu'une heure de départ associée et/ou une heure d'arrivée respectives en tant que coordonnées de l'objet dans un espace-temps et on note pour chaque véhicule de transport une capacité de transport et un lieu réel. On définit un réseau de chemins de transport que les véhicules de transport peuvent emprunter à des vitesses moyennes et on détermine, sur la base du réseau de chemins de transport, tous les chemins de transport possibles appropriés à chaque objet entre les coordonnées de l'objet et on les note dans l'espace-temps. Dans l'espace-temps, des chemins de transport appropriés sont regroupés pour différents objets en itinéraires de véhicules de transport individuels. On prend en compte les capacités de transport et les lieux réels des véhicules de transport, et les itinéraires sont transmis avec les lieux de départ, les heures de départ, les lieux d'arrivée et les heures d'arrivée des objets associés aux véhicules de transport concernés en vue de leur départ.
EP17703421.2A 2016-02-05 2017-02-06 Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets Pending EP3411838A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP16154441.6A EP3203421A1 (fr) 2016-02-05 2016-02-05 Procede de transport d'une pluralite d'objets entre des emplacements specifiques auxdits objets
PCT/EP2017/052529 WO2017134299A1 (fr) 2016-02-05 2017-02-06 Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets

Publications (1)

Publication Number Publication Date
EP3411838A1 true EP3411838A1 (fr) 2018-12-12

Family

ID=55405120

Family Applications (2)

Application Number Title Priority Date Filing Date
EP16154441.6A Withdrawn EP3203421A1 (fr) 2016-02-05 2016-02-05 Procede de transport d'une pluralite d'objets entre des emplacements specifiques auxdits objets
EP17703421.2A Pending EP3411838A1 (fr) 2016-02-05 2017-02-06 Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP16154441.6A Withdrawn EP3203421A1 (fr) 2016-02-05 2016-02-05 Procede de transport d'une pluralite d'objets entre des emplacements specifiques auxdits objets

Country Status (5)

Country Link
US (1) US11270232B2 (fr)
EP (2) EP3203421A1 (fr)
JP (1) JP6903063B2 (fr)
CN (1) CN109074534B (fr)
WO (1) WO2017134299A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11733051B2 (en) 2018-11-19 2023-08-22 Grabtaxi Holdings Pte. Ltd. Communications server apparatus, method and communications system for managing request for transport-related services

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6971050B2 (ja) * 2017-04-14 2021-11-24 シスメックス株式会社 位置管理方法、位置管理システム、位置管理プログラムおよび携帯通信機器
US11011056B2 (en) * 2018-01-29 2021-05-18 Fujitsu Limited Fragmentation-aware intelligent autonomous intersection management using a space-time resource model
CN110766362A (zh) * 2019-10-17 2020-02-07 云南中烟工业有限责任公司 一种多点仓配协同作业的成品卷烟智能运输调度系统及方法
JP7373169B2 (ja) 2021-10-20 2023-11-02 国立大学法人群馬大学 輸送組み合わせ列挙システム、輸送組み合わせ列挙方法及び輸送組み合わせ列挙プログラム

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19938454A1 (de) * 1999-08-13 2001-02-22 Tenovis Gmbh & Co Kg Verfahren und Kommunikationssystem zur optimierten Steuerung einer Vielzahl von mobilen Stationen zu Zielorten
JP2001331894A (ja) * 2000-05-19 2001-11-30 Nec Corp 輸送サービスシステムおよび輸送サービス方法
EP1168275A1 (fr) * 2000-06-30 2002-01-02 Nokia Networks Oy Système et procédé de transport de voyageurs
JP4548977B2 (ja) * 2001-06-20 2010-09-22 パナソニック株式会社 デマンド車両管理装置
JP4142468B2 (ja) * 2003-02-28 2008-09-03 矢崎総業株式会社 巡回バスの運行ルート取得システム及び到着通知システム
JP2004362271A (ja) * 2003-06-04 2004-12-24 Nippon Telegr & Teleph Corp <Ntt> 相乗り乗車システム、乗車情報処理装置および相乗り乗車方法
FR2868188B1 (fr) * 2004-03-26 2006-06-16 Herve Benjamin Afriat Procede et systeme de transport de voyageurs
US20070250211A1 (en) * 2004-07-26 2007-10-25 Siemens Aktiengelsellschaft Method for Automatically Analyzing Transport Courses
FR2898204B1 (fr) * 2006-03-02 2014-06-20 Patrick Hurpin Procede et systeme de transport collectif
CN101652789A (zh) * 2007-02-12 2010-02-17 肖恩·奥沙利文 共享运输系统和服务网络
WO2014002267A1 (fr) * 2012-06-29 2014-01-03 トヨタ自動車株式会社 Dispositif, procédé et système de gestion des passages sur demande d'un véhicule
US9159994B2 (en) * 2013-03-15 2015-10-13 Wildcat Discovery Technologies, Inc. High energy materials for a battery and methods for making and use
JP2014203192A (ja) * 2013-04-03 2014-10-27 公立大学法人公立はこだて未来大学 車両運行管理システム、端末装置、制御装置、および車両運行管理方法
US9530314B2 (en) * 2013-08-08 2016-12-27 Accenture Global Services Limited Dynamic ETA and STA transportation system
EP3080774A4 (fr) * 2013-12-11 2017-06-07 Uber Technologies Inc. Optimisation de la sélection de conducteurs pour des demandes de transport
ES2525738B2 (es) * 2014-01-27 2015-04-13 Martín HERRÁIZ HERRÁIZ Procedimiento de supervisión y control de recorridos de vehículos para optimizar la utilización de sus capacidades de carga
SG11201701332QA (en) * 2014-09-05 2017-03-30 Uber Technologies Inc Providing route information to devices during a shared transport service
US10572847B2 (en) * 2014-10-10 2020-02-25 Conduent Business Services, Llc Dynamic space-time diagram for visualization of transportation schedule adherence
AU2016208998B2 (en) * 2015-01-19 2021-02-18 Clear Destination Inc. System and method for managing and optimizing delivery networks
US20170185928A1 (en) * 2015-12-28 2017-06-29 Sap Se Data analysis for scheduling optimization with multiple time constraints

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11733051B2 (en) 2018-11-19 2023-08-22 Grabtaxi Holdings Pte. Ltd. Communications server apparatus, method and communications system for managing request for transport-related services

Also Published As

Publication number Publication date
US11270232B2 (en) 2022-03-08
WO2017134299A1 (fr) 2017-08-10
JP6903063B2 (ja) 2021-07-14
US20180349809A1 (en) 2018-12-06
CN109074534B (zh) 2022-09-02
CN109074534A (zh) 2018-12-21
JP2019511765A (ja) 2019-04-25
EP3203421A1 (fr) 2017-08-09

Similar Documents

Publication Publication Date Title
WO2017134299A1 (fr) Procédé de transport d&#39;un grand nombre d&#39;objets entre des endroits spécifiques aux objets
DE112018007491T5 (de) Gemischte fahrzeugauswahl und routenoptimierung
DE112017007909T5 (de) Dynamische routenbestimmungen für ein fahrzeug
DE202020005743U1 (de) Verbessertes Logistikmanagementsystem
WO2005029376A1 (fr) Systeme pour la fourniture de services
DE102016107712A1 (de) Ridesharing-Reichweitenkonturen
DE102016107185A1 (de) Gemeinsame Nutzung von langfristigen Fahrgemeinschaftsgruppen
DE202013012418U1 (de) Reiseplanung im öffentlichen Personenverkehr
DE19646954A1 (de) Verfahren und Vorrichtung zum Steuern einer Flotte aus Land- und/oder Wasserfahrzeugen
DE102015208291A1 (de) Gemeinschaftsfahrzeugmanagement
DE102015208287A1 (de) Gemeinschaftsfahrzeugsysteme und -verfahren
DE102017222288A1 (de) Verfahren zur Organisation mehrerer Fahrzeuge einer Fahrzeugflotte zur Personenbeförderung und Servereinrichtung zum Durchführen des Verfahrens
EP2915153A1 (fr) Système d&#39;assistance à la conduite
DE102013218046A1 (de) Vorrichtung und Verfahren zur Mobilitätssteuerung
DE69937319T2 (de) Fahrzeugverteilungssystem
CH695030A5 (de) Mobilitaetsdienstesystem, insbesondere fuer Ballungsraeume.
DE102019127848A1 (de) System und verfahren zum selektiven verschaffen des zugangs zu baustellenbezogenen
EP3163520A1 (fr) Coordination d&#39;un apport de prestation
DE102019126370A1 (de) Mitfahrgelegenheit mit berücksichtigung besonderer bedürfnisse
WO2019149777A1 (fr) Procédé de gestion d&#39;un transport
DE102012220254A1 (de) Verfahren zum Vermitteln eines Dienstes
WO2019081097A1 (fr) Procédé de saisie de prestations en liaison avec des prestations de services mobiles
EP3208756A1 (fr) Système de service de transport pour la communication entre un usager et un fournisseur de service de transport
DE102019126367A1 (de) Zahlungskarte für eine fahrt mit mehreren teilstrecken
DE102021125861A1 (de) Verfahren und Parkleitsystem zur Zuweisung eines Parkplatzes für ein Fahrzeug und zur Navigation des Fahrzeugs zu dem Parkplatz

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

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: 20180828

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

AX Request for extension of the european patent

Extension state: BA ME

RIN1 Information on inventor provided before grant (corrected)

Inventor name: WENDLAND, MATTHIAS

Inventor name: KASSEL, JOHANNES

Inventor name: TIMME, MARC

Inventor name: HERMINGHAUS, STEPHAN

Inventor name: SORGE, ANDREAS

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: 20201001

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

APBK Appeal reference recorded

Free format text: ORIGINAL CODE: EPIDOSNREFNE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

RIN1 Information on inventor provided before grant (corrected)

Inventor name: KASSEL, JOHANNES

Inventor name: WENDLAND, MATTHIAS

Inventor name: SORGE, ANDREAS

Inventor name: TIMME, MARC

Inventor name: HERMINGHAUS, STEPHAN

RIN1 Information on inventor provided before grant (corrected)

Inventor name: KASSEL, JOHANNES

Inventor name: WENDLAND, MATTHIAS

Inventor name: SORGE, ANDREAS

Inventor name: TIMME, MARC

Inventor name: HERMINGHAUS, STEPHAN