Decision-tree based address-station matching

A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to implement an address-station matching mechanism for matching an address to an optimal station for package delivery, and further causes the computing device to:

• determine, by matching logic within the address-station matching mechanism whether at least one keyword k in a substring of an address addr associated with a package to be delivered appears in a keyword to station probability matrix associated with a city and/or district associated with the address addr associated with the package;
• responsive to the at least one keyword k appearing in the keyword to station probability matrix, for a set of keywords k in the substring of the address addr and station s of the city and/or district, determine, by the matching logic, a priority value function v that represents a priority of a combination of keyword k and station s, using:
• v(k,s)=Pks+ε*len(k)
• where v is the priority value function that represents the priority of the combination of keyword k and station s, p is a probability of a keyword to a station from the associated keyword to station probability matrix, ε is a pre-defined small number, and len is a function to calculate a length of a string;
• identify, by the matching logic, a critical keyword k* and optimal station s* using:
• (k*,s*)=arg max v(k,s)
• where v is the priority value function that represents the priority of the combination of keyword k and station s and arg max is an argument of a maximum that is a set of points of the given argument for which a given function attains its maximum value;
• and
• report, by the matching logic, an optimal station s* with a maximum determined value for delivery of the package.

An apparatus comprising:

• at least one processor;
• and
• at least one memory coupled to the at least one processor, wherein the at least one memory comprises instructions which, when executed by the at least one processor, cause the at least one processor to implement an address-station matching mechanism for matching an address to an optimal station for package delivery, and further causes the at least one processor to:
• determine, by matching logic within the address-station matching mechanism whether at least one keyword k in a substring of an address addr associated with a package to be delivered appears in a keyword to station probability matrix associated with a city and/or district associated with the address addr associated with the package;
• responsive to the at least one keyword k appearing in the keyword to station probability matrix, for a set of keywords k in the substring of the address addr and station s of the city and/or district, determine by the matching logic, a priority value function v that represents a priority of a combination of keyword k and station s, using:
• v(k,s)=Pks+ε*len(k)
• where v is the priority value function that represents the priority of the combination of keyword k and station s, p is a probability of a keyword to a station from the associated keyword to station probability matrix, ε is a pre-defined small number, and len is a function to calculate a length of a string;
• identify, by the matching logic, a critical keyword k* and optimal station s* using:
• (k*,s*)=arg max v(k,s)
• where v is the priority value function that represents the priority of the combination of keyword k and station s and arg max is an argument of a maximum that is a set of points of the given argument for which a given function attains its maximum value;
• and
• report, by the matching logic, an optimal station s* with a maximum determined value for delivery of the package.