EP2643799A1 - Planification dynamique d'itinéraires - Google Patents

Planification dynamique d'itinéraires

Info

Publication number
EP2643799A1
EP2643799A1 EP11788101.1A EP11788101A EP2643799A1 EP 2643799 A1 EP2643799 A1 EP 2643799A1 EP 11788101 A EP11788101 A EP 11788101A EP 2643799 A1 EP2643799 A1 EP 2643799A1
Authority
EP
European Patent Office
Prior art keywords
computer system
objects
planning
transport
data
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
Application number
EP11788101.1A
Other languages
German (de)
English (en)
Inventor
Boris Paul
Verena Wild
Keith Ulrich
Frank Hübner
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.)
Deutsche Post AG
Original Assignee
Deutsche Post AG
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 Deutsche Post AG filed Critical Deutsche Post AG
Publication of EP2643799A1 publication Critical patent/EP2643799A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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

Definitions

  • the invention relates to a system for tour planning for
  • Trip planning is undertaken in a variety of areas associated with the delivery of goods and / or the visit of a plurality of destination addresses (or delivery addresses) and includes determining an optimal order in which destination addresses are served which certain jobs have to be done.
  • An example of an area in which tour planning is of great importance is the delivery and pickup of parcels and other mail items for which transport vehicles carry out tours one or more times a day, containing orders for changing addressees.
  • the tour planning is made in particular taking into account the addresses to be used on the tours.
  • the distances between the respective destination addresses and the logistics center at which the delivery vehicles are stationed are the input variables of the route planning. These distances are specified, for example, in a distance matrix, which is optimized to carry out the actual route planning and a tour plan is created for each transport vehicle.
  • DE 10 2004 019 232 B4 discloses a method for tour and route planning in which, in particular, the determination of the order of addresses at which objects are to be delivered and / or to be picked up for the planning tours in each case in accordance with geographical data is made.
  • the objects to be transported are sorted according to the tour planning the respective transport vehicles and then loaded into this. It happens that between the objects with already existing route planning (planned objects) a not inconsiderable number of objects are transported to the transport vehicles, for which there is no tour planning (unplanned objects). These unplanned objects interfere with the optimal process flow as they may be loaded into transport vehicles for which the unplanned objects have unfavorable destination addresses for trip planning, so that the transport vehicle would have to drive a nonoptimal transport route for delivering the planned and unplanned objects.
  • the transport vehicles to which the unplanned objects are transported may already be fully loaded. The unplanned objects may need to be removed by hand from the loading station, which can mean a high workload. Some loading systems therefore eject unplanned objects prematurely at suitable locations.
  • the system comprises a computer system with a database with shipment data, which are associated with the objects to be transported, the computer system on the basis of the objects associated shipment data for each transport vehicle associated with a first tour planning for the delivery on a delivery day with the respective transport vehicle objects created and the system
  • Means of transport comprises, the objects to be transported according to the tour planning to the
  • system further comprises a test station and a recognition station, wherein the test station is provided to check whether for the respective objects, the test station during the transport to the
  • the present system avoids the disadvantages of the prior art and leads by the dynamic route planning taking into account unplanned objects to an undisturbed process flow, to a reduced effort in the transport of the objects, to an optimized transport route in the Delivery of planned and unplanned objects and thus faster delivery of the objects to the customers.
  • a predetermined order of addresses (e.g., delivery or destination addresses) is referred to at least for the respective objects present in the transportation vehicle.
  • the driver of the transport vehicle will depart according to the tour planning the delivery addresses of the respective objects and deliver to the respective delivery addresses the corresponding objects until the last delivery address reached on the tour planning and the last object is delivered.
  • trip planning may additionally include one or more pickup addresses in which the driver of the
  • Delivery of objects also picks up new objects, for example, to the logistics center where their transport
  • the tour planning created prior to the loading of the transport vehicle for the planned objects is referred to as the first tour planning.
  • the term "transport vehicle” here includes all possible means of movement with which objects can be delivered to addresses and is not limited to motorized motor vehicles
  • Transport vehicles may be, for example, bicycles, boats, aircraft, etc.
  • objects refers to all sorts of things connected to one
  • Delivery address can be delivered.
  • objects are mail, in particular letters, parcels or parcels.
  • planned objects here designate the objects for which a first route planning is available.
  • objects without first tour planning are unplanned objects.
  • shipment data encompasses all types of data that are required or useful for the delivery of an object in the course of the logistics chain (from the delivery of the object until its successful delivery.)
  • the shipment data is, in particular, one or more the following information: sender, bill recipient, recipient, contact person of sender, recipient or bill recipient, information on the content of the shipment, information on the characteristics of the shipment (eg size, weight, fragility, etc.), information on desired additional services (for example, special delivery times
  • the item data is assigned to the object in question in a database, ie the item data is stored as data in the database and assigned to the item via a suitable data link
  • Data linkage may be, for example, a data link or implemented in tabular form as a data line. If, for example, the object with an item characterizing the object is recognized in the system at any point, then all the shipment data existing in the database for this object must be queried or delivered from the database (on request or independently for object recognition at any point).
  • the objects are transported by a means of transport from a storage location, for example from a high-bay warehouse, to the transport vehicles provided by the computer system according to the first route planning.
  • a suitable means of conveyance may, for example, be a conveyor belt, wherein the term "conveyor belt” also includes, for example, an overall system comprising a plurality of separate conveyor belts
  • the person skilled in the art may also choose other means of transport within the scope of the present invention Determination are suitable, whether checked objects in a first trip planning are considered or not.
  • the test station can, for example, in one embodiment, all first route planning from the computer system via a data connection (eg, a data cable or a wireless
  • the test station comprises a data memory and a processor unit which carries out a comparison between route planning (including the relevant objects) and the respective tested object.
  • the test station may be connected to the data link (e.g., a data cable or a wireless data link such as WLAN)
  • the computer system then checks the first route plans for the relevant object and notifies the test station whether or not the relevant object has been taken into account in one of the first route plans. In order that the objects transported to the transport vehicles can be checked by the inspection station, all objects must be on their way to the
  • Transport vehicles pass the test station. This could, for example, in a conveyor belt as the means of transport by arranging the
  • Test station in or on the conveyor belt.
  • a non-mobile testing station is arranged in the conveyor belt.
  • the conveyor belt can pass through the test station.
  • the test station could also be designed to be mobile, for example as a mobile hand-held scanner, which is operated by the personnel on the conveyor belt.
  • the test station is at
  • the inspection station comprises suitable means for recognizing the object to be tested.
  • These agents can, for example
  • Be barcode scanner The person skilled in the art can also choose other suitable means in the context of the present invention, e.g. RFI D readout devices.
  • RFI D readout devices The objects must be suitable for the read-out devices
  • the error signal in the case of an unplanned object can with a
  • Data connection (e.g., a data cable or wireless data connection such as WLAN) either directly to the recognition station and / or to the computer system for further processing, including one
  • the error signal may additionally be transmitted optically, acoustically or in another form in the area of the means of transport.
  • the person skilled in the art is able to select the data format of the control signal in the context of the present invention appropriately. For example, that can
  • Error signal to be a start signal for a subsequent recognition procedure by the recognition station.
  • the recognition station includes all types of stations that are suitable for recording broadcast data.
  • the recognition station may comprise suitable detection means, for example one or more OCR scanners, which enable text or optical character recognition for the shipment data located on the object.
  • OCR scanners enable text or optical character recognition for the shipment data located on the object.
  • handwritten delivery and sender addresses can be read and converted into electronic data files and transmitted.
  • the newly recorded transmission data in the recognition station is transmitted to the computer system via a data connection (for example a data cable or a wireless data connection such as WLAN).
  • a data connection for example a data cable or a wireless data connection such as WLAN.
  • the object can be removed from the means of conveyance at the recognition station, for example via an outward transfer belt or an outward transfer device. The determination of shipment data for such a rejected object can then (if possible) be made in other ways.
  • the transmitted shipment data are processed by the computer system so that the existing first tour planning on the possibility of
  • Arrange transport means for example at the beginning of the
  • the computer system may include one or more computers or servers.
  • the computer system may be connected to other logistics centers and their shipment data databases as well as external other databases.
  • the system can be a web-based system with access to the Internet.
  • the data connections in the system and / or in the computer system can be made via suitable data cables or wireless
  • Data links (e.g., WLAN).
  • the objects associated with the first trip planning include a corresponding machine-readable tour label for reading by the inspection station.
  • This tour label may be, for example, a barcode pasted or printed on the object or an RFID tag.
  • the system according to the invention may comprise a label unit that creates the tour labels associated with the objects and / or on the objects.
  • the computer system is with the
  • the Label unit connected to a suitable data connection and transmits at least the first tour plans to create the tour label to the label unit.
  • the information contained in the Tour Label can mean, inter alia, the assigned transport vehicles.
  • the detection means is at least one reading unit for optical character recognition and / or barcode recognition.
  • the recognition station comprises several
  • Reading units wherein the reading units are arranged so that optical characters and / or barcodes can be recognized on all sides of the object. Since the shipment data does not necessarily have to be on top of a transported object, the other sides of the object must also be detectable. For this, the reading units do not have to
  • the object necessarily be arranged on all sides of the object. To ensure a reading from all sides of the object, the
  • Recognition station Means for turning or turning the objects comprise, so that two or three reading units in conjunction with a suitable turning or turning unit for detecting all sides of an object
  • the computer system is provided for the newly acquired broadcast data transmitted by the recognition station
  • An evaluation takes place, for example, via assignment of the detected
  • First name and last name of the recipient the corresponding street name, postal code, city, and corresponding details for the sender.
  • the existing data becomes the respective one Checking shipment categories. Certain details may be missing here, for example, a city is specified in the delivery address, but the associated postcode is missing. It could also parts of the name, ie first name or last name missing. Any information that is necessary or helpful for the delivery (delivery) of an object can represent its own program category.
  • the data in all shipment categories together represent the entirety of the shipment data. Successful delivery does not necessarily mean that all shipment categories are filled with data.
  • the computer system is to
  • Supplement and / or correct broadcast data could, for example, reveal that the respective delivery address in the recorded shipment data is already completely and correctly known in the database.
  • the newly recorded shipment data is supplemented by the already existing shipment data for this address and corrected if necessary.
  • As already described above could also by priority of the
  • Additional information may also be obtained through databases of resident directories, town plans, servers with e-mail directories or other additional information.
  • the computer system can either access external databases with this data, or the database of the system according to the invention itself contains such additional information.
  • the computer system is provided to determine a probability for the correctness of the possible supplementation and / or correction for each possible supplementation and / or correction and to carry out the supplementation and / or correction only with a probability above a threshold value.
  • a threshold can be used to determine a probability for the correctness of the possible supplementation and / or correction for each possible supplementation and / or correction and to carry out the supplementation and / or correction only with a probability above a threshold value.
  • Probability can be taken, for example, from the ratio of the number of consistencies in individual shipment categories to known shipment data to a total number of shipment data for the region in which the recipient is sought.
  • the computer system is provided, upon successful examination of the newly acquired shipment data, to associate the newly acquired shipment data or the supplemented and / or corrected shipment data with the corresponding object and to store it in the database. These assigned shipment data can then also be used as a database component for later checks.
  • the computer system is provided to create possible second route planning taking into account the object with newly recorded shipment data for all transport vehicles with first tour planning and to select the most favorable of all possible second tour planning according to predetermined criteria and the object the Assign transport vehicle with the cheapest second tour planning.
  • the computer system is provided to create possible second route planning taking into account the object with newly recorded shipment data for all transport vehicles with first tour planning and to select the most favorable of all possible second tour planning according to predetermined criteria and the object the Assign transport vehicle with the cheapest second tour planning.
  • the computer system is provided to create possible second route planning taking into account the object with newly recorded shipment data for all transport vehicles with first tour planning and to select the most favorable of all possible second tour planning according to predetermined criteria and the object the Assign transport vehicle with the cheapest second tour planning.
  • the computer system is provided to create possible second route planning taking into account the object with newly recorded shipment data for all transport vehicles with first tour planning and to select the most favorable of all possible second tour planning according to predetermined criteria and the object the Assign transport vehicle with the cheapest second tour planning.
  • Criteria for this could be tour duration, tour length, fuel consumption of the transport vehicle, degree of utilization of the existing
  • Transport volume size of transport vehicles
  • Determining the cheapest tour on these criteria is looked at, where the sizes are minimal or maximum.
  • the transport vehicle with the most favorable tour planning is assigned to the originally unplanned object.
  • the computer system is provided to initiate a removal of the corresponding object from the means of transport before loading into a transport vehicle via control of a suitable discharge means in case of failed check of the newly recorded shipment data.
  • the unassigned unplanned object can be removed at a suitable location with little effort from the process flow and taken into account for subsequent transport after determining the shipment data.
  • the invention further relates to a method for tour planning for transport vehicles and for loading the transport vehicles with too
  • Broadcast data in a computer system are associated with a database, comprising the steps
  • the method further comprises the steps of evaluating the newly acquired shipment data transmitted by the recognition station by the computer system and
  • the method further comprises the steps
  • the method further comprises the steps
  • Computer system for removing the corresponding object prior to loading the means of transport into a transport vehicle in case of failure to check the newly collected shipment data.
  • the step of converting the first route planning into a second route planning comprises the creation of possible second route plans taking into account the object with newly recorded shipment data for all transport vehicles with first route planning and selecting the most favorable of all possible second route plans according to predetermined criteria and the assignment of the object to the transport vehicle with the favorable second
  • Fig.1 an embodiment of the system according to the invention.
  • Fig. 2 an object with shipment data and tour label.
  • Fig.3 an embodiment of the method according to the invention.
  • system 1 shows an embodiment of a system 1 for tour planning for transport vehicles 3 and for loading the transport vehicles 3 with objects to be transported 2.
  • the system 1 comprises a
  • Computer system 4 with a database 41 are stored in the object 2 associated with the shipment data, for example, to object-1 information about sender-1, billing-1, recipient-1, contact the sender-1, the recipient or the
  • Invoice recipient information-1 on the content of the shipment, information-1 on the properties of the shipment (eg size, weight, fragility, etc.), information about desired additional services (for example, special delivery times) as well as shipment identification information or object-2 information about sender-2 , Bill-2, Recipient-2, Sender-2, Recipient or
  • Invoice recipient information 2 on the content of the shipment, information 2 on the characteristics of the shipment (for example, size, weight, fragility, etc.), information about desired additional services (for example special delivery times) as well as shipment identification information.
  • the computer system 4 creates an assigned first for each transport vehicle 3 on the basis of the shipment data assigned to the objects 2
  • Trip planning T1 which comprises the list of objects 2 to be delivered in the specific transport vehicle 3 on a specific delivery day, if appropriate in addition to a certain point in time.
  • the objects 2 from a warehouse 1 1 with a
  • Conveyor 5 here a conveyor belt 5, to the associated
  • the loading of the transport vehicles 3 with their intended objects 2 is about one example for each Transport vehicle existing loading station 12 made.
  • the computer system 4 controls via a data link 9, the loading of the objects 2 based on the first (and possibly second) tour planning in the proposed transport vehicles 3 via the loading station 12.
  • suitable loading stations 12 are the
  • the computer control can, for example, consist in a transmission of the valid for the transport vehicle 3 tour planning that corresponds to a loading list exist. Alternatively, by detecting the object 2 at the loading station 12 with a subsequent query the
  • Computer system 4 is provided, carried out a loading in the associated touring vehicle 3.
  • a test station 6 is arranged in the conveyor belt 5.
  • the inspection station 6 reads out the shipment data or other information present on the object 2, for example a tour label, by means of one or more inspection means 61 and therefore recognizes whether there is a first trip planning for the respective objects 2.
  • the objects 2 are further transported via the conveyor belt 5 B and on the
  • the test station 6 sends a corresponding error signal FS either to the computer system 4 for forwarding and processing or directly to a recognition station 7 via a data connection 9, so that there the shipment data of the object in question 2 without first tour planning by means of or several suitable detection means 71 can be detected.
  • Suitable detection means 71 are, for example, reading units for optical character recognition and / or barcode recognition.
  • the recognition station 7 may additionally comprise means for Rotate and / or invert the object 2 so that all pages of the object can be read by the reading unit 71.
  • the transmission data newly acquired by the detection station 7 are transmitted to the computer system 4 via a data connection 9 and assigned to the transport vehicles 3 to a suitable transport vehicle 31 during the transport duration. Accordingly, the computer system 4 converts the first route planning for this transport vehicle 31 into a second route planning in which the object 2 with the newly acquired shipment data is taken into account.
  • a discharge means 8 is arranged in the conveyor belt 5. The ejection means 8 prevents objects from reaching the loading stations which can not be assigned to a transport vehicle 3 by the computer system 4 after examination and evaluation of the newly recorded shipment data. This would disturb the process flow at the loading stations 12 and there an unnecessary amount of work to remove this object 2 from the
  • FIG. 2 shows an object 2 with shipment data 21 and with a tour label 22 applied as a sticky label by the label unit 11.
  • a first trip planning for the respective object 2 is documented by the existing tour label 22.
  • a label unit 1 1 is arranged for applying a tour label on the incoming objects in the warehouse 2.
  • the computer system is connected to the label unit 1 1 for the corresponding control for creating the tour label 22 with a data connection 9.
  • FIG. 3 shows an embodiment of the method according to the invention in which objects 2, as already shown in FIG. 1, pass through a test station 6 in order to check the presence of a first route planning T1. If this first route planning T1 is present, the relevant object 2 becomes the If there is no first trip planning T1 for the tested object 2, a corresponding error signal FS is sent out by the test station 6, in this embodiment via the computer system 4.
  • the computer system 4 forwards the error signal FS the recognition station 7, so that the recognition station 7 detects the broadcast data of the unplanned object 2 by means of suitable detection means 71 due to the error signal FS for the relevant object 2 without first trip planning T1.
  • the newly acquired shipment data 21 n are transmitted from the recognition station 7 to the computer system 4 so that the computer system 4 evaluates the newly acquired shipment data 21 n and checks for completeness and / or consistency P. In the case of incompleteness or inconsistencies of the newly acquired shipment data 21 n Computer system 4 compares this transmission data 21 n at least with transmission data 21 present in database 41 and supplements and / or corrects these. For complementation and / or correction EK, the computer system can also consult data from external databases 42 to which the computer system is connected to a data connection, for example via a server and an internet connection.
  • a probability for the correctness of the possible supplementation and / or correction EK is determined for each possible supplementation and / or correction EK and the supplementation and / or correction EK only at a probability above a threshold value (S), for example, higher 80%, higher 90% or higher 95%.
  • S a threshold value
  • the newly acquired shipment data 21 n or the supplemented and / or corrected shipment data 21 n, EK are assigned to the corresponding object 2 and stored in the database 41.
  • the object 2 with newly acquired shipment data 21 n during the continuous transport B along the conveyance means 5 is assigned to a suitable transport vehicle 31 by the computer system 4 and the first trip planning T1 suitable for this
  • Transport vehicle 31 converted into a second tour planning T2.
  • the second tour planning T2 is as above to the
  • AS controls the computer system 4 via a data connection

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Warehouses Or Storage Devices (AREA)

Abstract

L'invention concerne un système de planification d'itinéraires pour des véhicules de transport (3) et de chargement d'objets à transporter (2) dans les véhicules de transport (3), ainsi qu'un procédé correspondant de fonctionnement du système (1) qui permet une planification dynamique des itinéraires tenant compte des objets (2) non prévus dans des séquences logistiques existantes. Le système (1) comprend pour ce faire une station de contrôle qui est destinée à contrôler s'il existe pour les différents objets (2) une première planification de l'itinéraire (T1) et qui, en l'absence d'une première étude d'itinéraire (T1), émet un signal d'erreur (FS) correspondant, une station de reconnaissance (7) qui, en fonction du signal d'erreur (FS), ressaisit les données d'expédition (21n) pour l'objet (2) considéré à l'aide de moyens de saisie (71) adéquats et les envoie à un système informatique (4). Le système informatique (4) est conçu pour associer à un véhicule de transport (3) adéquat l'objet (2), avec ses nouvelles données d'expédition saisies (21n), pendant le transport par un moyen de manutention (5) vers les moyens de transport (3), et pour transformer la première planification d'itinéraire (T1) pour ce véhicule de transport (3) en une seconde planification d'itinéraire (T2) dans laquelle l'objet (2) est pris en compte avec les nouvelles données d'expédition saisies (21n).
EP11788101.1A 2010-11-24 2011-11-17 Planification dynamique d'itinéraires Withdrawn EP2643799A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102010061901.9A DE102010061901B4 (de) 2010-11-24 2010-11-24 Dynamische Tourenplanung
PCT/EP2011/070309 WO2012069350A1 (fr) 2010-11-24 2011-11-17 Planification dynamique d'itinéraires

Publications (1)

Publication Number Publication Date
EP2643799A1 true EP2643799A1 (fr) 2013-10-02

Family

ID=45044554

Family Applications (1)

Application Number Title Priority Date Filing Date
EP11788101.1A Withdrawn EP2643799A1 (fr) 2010-11-24 2011-11-17 Planification dynamique d'itinéraires

Country Status (8)

Country Link
US (1) US20150088780A1 (fr)
EP (1) EP2643799A1 (fr)
JP (1) JP2013543827A (fr)
CN (1) CN103229199B (fr)
DE (1) DE102010061901B4 (fr)
MX (1) MX2013005488A (fr)
SG (1) SG190828A1 (fr)
WO (1) WO2012069350A1 (fr)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140279277A1 (en) * 2013-03-18 2014-09-18 Sears Brands, L.L.C. Out-of-store purchase routing systems, methods, and media
US9934483B1 (en) 2013-08-06 2018-04-03 Amazon Technologies, Inc. Off network return operations for pickup locations
US9870548B1 (en) * 2013-08-06 2018-01-16 Amazon Technologies, Inc. Off network order operations for pickup locations
CN103544589A (zh) * 2013-10-31 2014-01-29 深圳市华傲数据技术有限公司 一种基于云平台物流智能送货方法及系统
US9650039B2 (en) * 2015-03-20 2017-05-16 Ford Global Technologies, Llc Vehicle location accuracy
CN105069598A (zh) * 2015-08-20 2015-11-18 张青富 一种物流配送系统及方法
DE202016102149U1 (de) * 2016-04-22 2017-07-26 Kuka Systems Gmbh Fertigungsanlage
CN106256714B (zh) * 2016-08-25 2019-06-07 艾信智慧医疗科技发展（苏州）有限公司 一种物流传输系统的运行方法
US10596602B2 (en) * 2016-11-30 2020-03-24 Pathover, Inc. Delivery and routing management based on multi-identifier labels
CN109132302A (zh) * 2018-07-10 2019-01-04 国家电网有限公司 一种自动化仓库
CN109165886B (zh) * 2018-07-16 2022-06-03 顺丰科技有限公司 一种物流车辆路径规划方法及装置、设备、存储介质
CN108974741B (zh) * 2018-07-23 2020-03-31 烟台知兴知识产权咨询服务有限公司 一种自动化智能仓储物流设备
CN108910381B (zh) * 2018-08-21 2020-06-09 江苏木盟智能科技有限公司 一种物品输送设备和物品输送的方法
JP7059999B2 (ja) * 2019-11-06 2022-04-26 株式会社ダイフク 物品搬送設備
CN111915078B (zh) * 2020-07-29 2023-09-26 中国烟草总公司湖北省公司 一种基于数据驱动的柔性化卷烟配送线路规划方法及系统
US20230112290A1 (en) * 2021-10-11 2023-04-13 Industrial Artificial Intelligence Inc. System and method for facilitating a transporting process
CN114926103A (zh) * 2022-07-21 2022-08-19 中都物流有限公司 一种物流调配方法、装置、设备及存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7895132B2 (en) * 2003-12-22 2011-02-22 United Parcel Service Of America, Inc. Manifest generation and download systems and methods
DE102004019232B4 (de) * 2004-04-16 2006-04-06 Deutsche Post Ag Verfahren und Vorrichtung zum Befördern einer Vielzahl von physischen Objekten

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2012069350A1 *

Also Published As

Publication number Publication date
MX2013005488A (es) 2013-07-03
DE102010061901A1 (de) 2012-05-24
CN103229199A (zh) 2013-07-31
CN103229199B (zh) 2016-09-21
WO2012069350A1 (fr) 2012-05-31
JP2013543827A (ja) 2013-12-09
SG190828A1 (en) 2013-07-31
US20150088780A1 (en) 2015-03-26
DE102010061901B4 (de) 2018-03-08

Similar Documents

Publication Publication Date Title
DE102010061901B4 (de) Dynamische Tourenplanung
DE102007010658B3 (de) Logistikfahrzeug
DE69016572T3 (de) System und Verfahren zur aufgeschobenen Bearbeitung von OCR-abgetasteten Postsachen.
EP1615730B1 (fr) Procede et dispositif de repartition de colis ou d'autres articles similaires achemines
EP1300348B1 (fr) Procédé et dispositif pour le chargement et déchargement d'un véhicule de livraison
DE60124403T2 (de) Paketeversandverwaltungssystem und -verfahren
DE102009024195A1 (de) Verfahren und Vorrichtung zum Transportieren von Gegenständen mittels einer Transporteinrichtung
WO2017137106A1 (fr) Procédé pour trier des bagages et système de tri de bagages
EP2260952B1 (fr) Procédé et dispositif de commande du transport d'un objet vers une unité de réception
EP2298459A2 (fr) Procédé et dispositif de tri postal
DE102022002934A1 (de) Verfahren zum Betreiben eines automatisierten Lagers, Steuereinheit zur Steuerung eines automatisierten Lagers und automatisiertes Lager
EP2431932B1 (fr) Procédé et dispositif de traitement d'objets à l'aide d'un dispositif de stockage intermédiaire et d'une installation de tri
EP1455959A2 (fr) Procede et dispositif de traitement d'envois postaux
EP1409160B1 (fr) Procede de transport d'envois postaux et dispositif de stockage d'envois postaux
EP2830026A1 (fr) Système et procédé d'envoi de plis postaux
WO2009000376A1 (fr) Système d'expédition pour un envoi et procédé de traitement de cet envoi
DE4428685C2 (de) Verfahren und Vorrichtung zum Verteilen von Waren
EP2070604A1 (fr) Procédé et système destinés au fonctionnement d'envois postaux
EP4604034A1 (fr) Procede et dispositif pour traiter et trier des envois
DE102021005889A1 (de) Verhahren und System zur Beförderung von Paketen
DE102021130912A1 (de) System und Verfahren zur Zusammenstellung von Gegenständen zu Ladeeinheiten
EP3101605A1 (fr) Système et procédé pour l'envoi postal
WO2007022805A1 (fr) Procede et dispositif de reconnaissance d'adresse et de reexpedition d'articles
WO2002030583A2 (fr) Procede pour le traitement d'envois de lettres ou de marchandises
EP2028613A1 (fr) Procédé et dispositif de transport d'un objet

Legal Events

Date Code Title Description
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

17P Request for examination filed

Effective date: 20130620

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

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: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20140114