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

Definitions

• the invention relates to a method for automatic analysis of transport sequences according to the preamble of claim 1.
• Systems are known for monitoring goods, such as those in DE 3 942 009 A1, which aim at monitoring transport units (eg by incorporation into the frame construction of containers). It is not possible to monitor any broadcasts. Furthermore, these systems are not capable of determining the nature and time course of the transport processes with which a particular consignment is conveyed independently and independently of one another. Furthermore, there are transponder based (eg with transponders according to DE 69609765 T) method, which make it possible to determine when a shipment has passed a certain sorting center (US 3,750,167 Al). Another way to determine when a shipment is passing through a particular sorting center is described in CA 2285894. However, these systems can only determine if a shipment has been transported on time or not.
• the invention has for its object to provide a method for the automatic analysis of transport processes in logistics networks, with which also weak points in logistical chains can be determined automatically.
• the logistics network is subdivided into network levels and subnetworks for which the transport rules between the nodes and the description of the processes in the nodes and the relationships of the nodes are un ⁇ are determined one behind the other.
• the QTL shipments can be provided with machine-readable identifiers.
• additional information at least one QTL consignment identification and a checkflash identification, are included in the 2D bar codes used for franking.
• the QTL transmissions can also be provided with transponders, which are then read out into the node and stored with a time reference.
• the QTL transmissions recognize the passage of a node on the basis of the identification transmitted by radio by means of a receiver and that this information is stored with a time reference in the QTL transmission.
• the QTL transmissions can be identified by identifying characteristic features of their surface with the address information and storing them in a database together with the destination addresses and the further test data.
• the characteristic features of the transmission surfaces are also time determined in relation with the address information of the incoming mail 'and stored in the database.
• the respective QTL transmission is determined by means of comparison of the features detected in the nodes with the features associated with the QTL transmission, whereby the QTL transmission is identified in the case of a match to a defined extent.
• characterizing features are determined from their surface before the QTL transmissions enter the logistics network and together with the destination address sen and the other test data stored in a central database. The data for these characteristics and the others
• Test data is transmitted to the desired nodes, where the respective QTL transmission is determined by means of a comparison of the transmitted features and of detected features, wherein the QTL transmission is identified in the event of a match to a defined extent.
• FIG. 1 shows a schematic representation of a combined truck and airmail network (overall network)
• the logistics network is subdivided into different logical network levels and subnetworks.
• a logistics network which consists of a combined truck and airmail network.
• the transport between the network nodes or machining centers (BZ) can be carried out in different ways.
• Such a network is shown in FIG.
• the logistics network is subdivided into different logical network levels and subnetworks.
• FIG. 2 shows the logical network level for the long-distance lorry transport. The manner in which the transport usually takes place between the nodes is defined in the connection matrix.
• the transport connection between nodes 4 and 1 is defined as a path via nodes 5 and 3.
• a transport via other nodes would be in our Be ⁇ game so a misdirection of the cargo.
• the airmail network can logically be divided into two levels, for example. Firstly, in a network layer which describes the feeder transports to the airports (see FIG. 4) and secondly a network which describes the relationships between the airmail nodes (FIG. 5). The definitions of the relationships of the network nodes to each other are again realized by a connection matrix.
• a distance matrix For the network nodes, a distance matrix must be created in order to deduce the probable duration of the individual transport processes.
• the distance values for unrealized (not allowed) connections are set to infinity or zero.
• the average duration of the respective transport processes between the nodes can thus be determined.
• (t s / v)
• the determination of the outgoing node and the input node may e.g. be determined via the postcode of the place of posting and the destination by a specific node is assigned to certain postal code ranges. If outgoing nodes of the respective input nodes are determined, the expert system can determine all possible variants of the transport between these nodes. Here are all
• the expert system can generate the possible target runs via the sequence of node passes and with the help of the rules. It is assumed here by way of example of a post-logistics system.
• the number of generated target runs depends on the scope of the rules and regulations.
• the method aims at a high degree of abstraction of the description of the logistical processes in order to minimize the input and modification costs for the method.
• Run time target depending on the time of posting: for all shipments that are delivered after 6 pm, the runtime will be extended by one day
• the duration and type of transports (in hours) between the nodes are determined.
• Transport variant 1 Nodes: 1, 3, 5, 6 (network level truck transport)
• Processing node 6 Start 04:30, end 06:30 (following day) (input node)
• Trucking to Node 6 ends at 07:20. This means that sorting on delivery bases and timely transport to the delivery bases can no longer take place on the same day.
• Transshipment node 12 Start 02:35 clock, end 03:05 clock truck transport beginning 03:05 clock, late 04:20 clock
• Processing node 6 Start 04:20 am, (input node) (latest) end 06:30 am
• Processing node 1 (earliest) start 4:00 pm, (departure node) (latest) end 7:30 pm
• Processing node 6 Start 04:20, end 06:30 (following day) (input node)
• Transport variant 2 is limited to the traffic days Monday to Friday. The consignments must therefore be stored in the outgoing knot and be diverted on Monday (as described above). Running time: E + 2
• the target runs shown here are only a subset of all target runs that can be generated with these rules.
• the expert system generates all theoretically possible target runs, the
• Target run with runtime E + l as well as with a set run with runtime E + 2 can be transported on schedule.
• the expert system target run generator is able to determine all possibilities how a shipment can be transported from a point A to a point B and the associated time requirements.
• the rules at runtime specify the requirements for the quality of the services and the rules for the logistics network describe the type and timing of logistical processes.
• the desired transport processes generated by the desired run generator are compared with associated actual transport processes.
• all generated target runs are checked for the degree of their agreement with the actual runs, and the target run with the highest degree of conformity is determined.
• the deviations between desired and actual run are precisely analyzed for any deviations and the weak point is determined in the logistical system for this set run.
• the expert system can detect both the type of error-prone process, the type of error, and the event that caused the error.
• a tracking system determines the node and the duration of the QTL in the node. This results in the actual processing and reloading times in the nodes. If there is no continuous tracking in the nodes, then average processing times must be assumed, or the time between transports before and after the scan in a node is defined as the processing time.
• the individual transport processes are obtained by the analysis module in the expert system target / actual analysis from the measured values of the QTL.
• Transport processes can be detected with sufficient certainty, therefore, depends on which position the QTL is within the means of transport. However, this can not be influenced because the QTL is transported like a normal letter and should not be distinguished from a normal letter.
• the measured values can be greatly attenuated and reliable identification of the transport process without further expert knowledge is no longer possible.
• the QTL measures only cyclically. The result of this is that a transport process must last at least 10 minutes, so that the physical characteristics are correspondingly pronounced in order to detect a mode of transport with sufficiently high probability. If the QTL measuring method is now combined with a tracking method, the expert system receives further information (location, time) which can be used to analyze the measured values.
• the measured values are analyzed without location information. Thereafter, the detected transport processes are assigned to the periods between lingering in the nodes.
• the route covered can be determined by the type and duration of the transport process, taking into account the rules for the logistics network. If there are significant deviations from the value defined in the distance matrix, the period of time must be analyzed more precisely by the expert system.
• the expert system can now analyze the corresponding time segment. Transport processes that have been rejected without the knowledge of the distance to be bridged will be given greater credibility in the second step. It is now checked again whether the distance that was bridged with the transport processes matches the value in the distance matrix. If the distance traveled is clearly too large, a misinterpretation must be assumed and the result rejected. Should the distance still be too low, not all transport processes have yet been detected.
• the physical characteristics of the various types of transport may often be very similar. For example, for rail and truck transport. If both modes of transport are possible in the logistical sequence, it must be checked by the expert system whether, for example, both truck and rail transport were recognized for the same period and the credibility for the types of transport is very close to one , By changing the mode of transport, the distance traveled usually changes as well. Afterwards, the result has to be checked again for plausibility.
• the box emptying is a juxtaposition of short car transports. Short transport phases are interrupted by the stops to box emptying.
• the delivery is usually carried out on foot or by bicycle and is characterized by short distances from house to house and periods of rest when inserting the correspondence into the letterboxes.
• the entire logistical chain including processing times that a test letter (QTL) has undergone, can be determined. This is a key benefit of linking tracking systems to the QTL system.
• the expert system can compare this with the generated target runs. In the first iteration it checks if the nodes from the start and finish of the test run to the start and finish nodes of the target runs. If this is not the case, the entries for the start and destination address may be erroneous. Furthermore, it must be checked whether any tracking data of a node is missing. If this is not the case, the expert system Soll-Ist-Ver Dis from the target run generator retrieves the corresponding target runs for the actual start and destination nodes. If a match of the sequence of nodes has been found, only the target runs are to be considered, whose node runs correspond to the passage of the test. If this is not the case, it can be assumed that a misdirection has occurred.
• the location of the erroneous derivation can be considered with high probability to be the node which finally coincides with the sequence in the nominal run. Thereafter, successively checks to what extent the individual transport processes correspond with each other. As long as there is a set run in which no deviations have occurred, this process is continued and the remaining so runs are rejected. If all other processes also coincide with the target run, the test run has proceeded correctly. If a deviation is found, it must be checked whether synchronization takes place in the further course. If this is the case, a partial, non-relevant deviation can be assumed. If synchronization is to be achieved by an offset of one or more days, it must be assumed that the test shipment remained in one of the machining processes.
• the expert system is able to automatically recognize the time and place of occurrence of a fault in the process flow as well as the faulty process. For the first time, a fully automatic evaluation of QTL test runs is possible.
• the postal services are increasingly using 2D barcodes to free mail items.
• QTL ID numbers, test run ID numbers and other data such as time information 1 are recorded in the QTL measurement and storage unit 3 of the QTL transmission 5 and to a unit 2 for generating the 2D barcode, which is connected to a barcode printer 4, carry über ⁇ . Subsequently, the 2D bar code is printed on the QTL program 5.
• the delivery surfaces are scanned with the imprints by means of a scanner 11.
• the 2D bar code is read in the 2D bar code reader 12 and the corresponding data 13 such as QTL and test run ID, times and location including machine recognition are transmitted to the database 10.
• the destination address is read in an address reader 14, and the distribution code 15 is determined, on the basis of which the sorting and further distribution are determined via further not shown sorting centers / nodes to the last sorting center takes place.
• the broadcast surfaces are recorded by means of scanner 16 and identified by 2D bar code reader 17, the QTL broadcasts 5.
• the QTL ID, Check ID, and times, machine detection, and location of the machine are sent to the database 10 of the system.
• the QTL ID and the check run ID can be used to assign the data from the database accordingly.
• the mailing ID is also read as a barcode 19 and determined with the distribution code 20, and accordingly the QTL mailing 5 is then sorted and distributed to the recipient.
• the data is read from the QTL memory 3 and sent to the database 10.
• the data of the possible target transport sequences are compared with the data of the respective actual transport sequence by an expert system 22 as described above and any deviations in the logistical sequence detected, and the errors that led to these deviations are determined.
• the results 23 of the error analysis for the respective test run (QTL ID, test run ID, analysis data, quality codes, error log) are written back into the database 10.
• the same procedure can also be applied to alternative barcodes, eg planetary codes.
• Transponder sends the QTL transmission 5 with their QTL measuring and memory unit 3 their data, such as QTL ID, transponder ID and Himlauf- ID, via a small antenna 33 from.
• This data is received by an antenna 34, 37 in the respective node and forwarded to an RFID reader 35, 38.
• This adds a time stamp and a location identifier and transmits this data 36, 39 to the database 10.
• the QTL transmission 5 is designed as a receiver.
• a location identifier is permanently transmitted by a transmitter in the respective node.
• the QTL measuring and storage unit 3 stores this identifier with the associated time stamp in its data memory. The time of the first and the last reception of the same location identifier is registered.
• the length of stay at a specific location / node for example sorting center
• WLAN technology or GSM can also be used for the identification and location of QTL transmission.
• this method is extended so that in combination with the application described above can be dispensed with a special labeling of the programs, (see FIG 9) This requires that as many shipments as possible can be clearly identified in this way.
• the so-called fingerprint of the QTL transmission 5 is determined in the initialization phase.
• the fingerprint contains characteristic features which are derived from the image recorded by means of a scanner 40 by a fingerprint recognition unit 41, by means of which the respective QTL transmission 5 can be identified during subsequent processing steps.
• further data such as QTL-ID, test procedure ID, time information together with the Figerprints to the database 10 and together with logistics network Entry and exit point, type of shipment to the expert system 7 for gene ⁇ ration of the target transport processes transmitted.
• the fingerprint and the distribution information are determined by a scanner 42 and a fingerprint recognition unit 43 as in the initialization.
• the information about the distribution center (node) and processing machine as well as possibly further information about the shipment are sent to the central server with the database 10, where by a comparison of the deposited fingerprints, limited by the address information, with the currently calculated Fin ⁇ gerprint features of a shipment, the identification of the respective QTL transmission 5 takes place. If the similarity is sufficiently large and other alternatives can be excluded, the respective consignment is considered identified. Then the information stored in the database 10 information can be assigned to this shipment. In this case, a data record is generated, but with a current time stamp and new sorting information. Furthermore, the destination address is read with an address reader 44 and the QTL transmission 5 is accordingly transported further.

Landscapes

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

Applications Claiming Priority (2)

Publications (1)

Family

ID=34979837

Family Applications (1)

Country Status (5)

Families Citing this family (8)

Family Cites Families (14)

• 2005
  • 2005-07-26 JP JP2007523002A patent/JP2008507781A/ja not_active Withdrawn
  • 2005-07-26 EP EP05774207A patent/EP1782358A1/de not_active Withdrawn
  • 2005-07-26 CN CNA2005800252675A patent/CN1989515A/zh active Pending
  • 2005-07-26 US US11/632,869 patent/US20070250211A1/en not_active Abandoned
  • 2005-07-26 WO PCT/EP2005/008115 patent/WO2006010593A1/de active Application Filing

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events