System and method of network addressing and translation in a transportation system

• US 7,363,233 B1
• Filed: 04/17/2000
• Issued: 04/22/2008
• Est. Priority Date: 04/17/2000
• Status: Expired due to Fees

• Current Assignee: Richard C. Levine
• Original Assignee: Richard C. Levine
• Inventors: Levine, Richard C.
• Primary Examiner(s): Borissov; Igor N.
• Application Number:
  US09/550,960
• Time in Patent Office: 2,927 Days
• Field of Search: 705/401, 705/403, 705/404, 705/406, 705/408, 705/410, 705/60, 705/62, 705/1, 705 5- 9, 705/11, 705/22, 705/23, 705/28, 705/29, 380/51, 380/55, 709/220, 709/222
• US Class Current: 705/1.1
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202

Abstract

A method for routing an object in a transportation network is provided. The method includes obtaining at a first point a first address and a first functional property code associated with an object to be routed. The method also includes storing at a data base a second functional property code, a second address, and a third address associated with a second point. The method further includes sending the first address and the first functional property code from the first point to the data base and determining at the data base if the first address is compatible with the second address. The method additional includes determining at the data base if the first functional property code is compatible with the second functional property code if the first address is compatible with the associated second address and sending the third address to the first point if the first functional property code is compatible with the second functional property code.

Claims

1. A method for routing a physical object in a transportation network, comprising:

storing, in a first database, a first address and a first functional property code associated with a first point to be routed, wherein the first address is the first point of routing a physical object, and wherein the first functional property code describes an intended purpose or property for contents of the physical object routed from the first address;

storing, in a second database, a second address and a second functional property code associated with a second point, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed to the second address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object;

storing, in the second database, a third functional property code and a third address associated with the second address, wherein the third functional property code describes an intended purpose or property for contents of the physical object routed to the third address, wherein the third address describes a third point of routing the physical object, the third point is a destination point of the physical object if the second functional property code is not compatible with the first functional property code;

obtaining the first address, the first functional property code, the second address, and the second functional property code associated with the physical object;

determining the third address in the electronic processing environment if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and the stored third functional property code associated with the second address;

sending the third address to the first point if the first functional property code is not compatible with the second functional property code; and

routing an object to the third point based on the third address.

2. The method of claim 1, wherein routing the object to the third point based on the third address comprises associating a label containing the third address with the object.

3. The method of claim 1, wherein the second address comprises a partial postal address.

4. The method of claim 1, wherein the second address matches the third address.

5. The method of claim 1, wherein the first address comprises part of the second address.

6. The method of claim 1, wherein the third address comprises a pseudo-address.

7. The method of claim 1, wherein the first point comprises an origin point.

8. The method of claim 1, wherein the second point comprises a destination point.

9. The method of claim 1, wherein the first database and the second database are co-located with the first point.

10. The method of claim 1, wherein the first database and the second database are remote from the first point.

11. The method of claim 1, wherein the first database and the second database comprises a processor and a memory.

12. The method of claim 1, wherein the first address is compatible with the second address if the first address matches the second address.

13. The method of claim 1, wherein the first address is compatible with the second address if the first address matches part of the second address.

14. The method of claim 1, wherein the first functional property code is compatible with the second functional property code if the first functional property codes matches the second functional property code.

15. The method of claim 1, further comprising storing the first functional property code at the first point.

16. The method of claim 15, further comprising modifying the first functional property code before sending the first functional property code to the data base.

17. The method of claim 16, wherein modifying the first functional property code comprises substituting a functional property code other than the first functional property code for the first functional property code.

18. The method of claim 1, further comprising sending a no match code from the data base to the first point if the first address is incompatible with the second address.

19. The method of claim 1, further comprising sending a no match code from the data base to the first point if the first functional property code is incompatible with the second functional property code.

20. The method of claim 1, further comprising storing, at the second database, a fourth functional property code and a fourth address associated with the third point, wherein the third point is also associated with the second address.

21. The method of claim 20, further comprising determining if the first functional property code is compatible with the fourth functional property code if the first functional property code is incompatible with the second functional property code.

22. The method of claim 21, further comprising sending a no match code from the data base to the first point if the first functional property code is incompatible with the second functional property code and the fourth functional property code.

23. The method of claim 20, further comprising:

determining if the first functional property code is compatible with the fourth functional property code if the first address is compatible with the associated second address; and

selecting between the third address and the fourth address if the first functional property code is compatible with the third functional property code and the fourth functional property code.

24. The method of claim 23, wherein selecting between the third address and the fourth address comprises selecting the address associated with whichever of the third functional property code and the fourth functional property code matches the first functional property code.

25. The method of claim 1, wherein the data base stores a third functional property code, a second address, and a third address for each of a plurality of second points.

26. The method of claim 25, wherein determining if the first address is compatible with the second address comprises determining if the first address is compatible with any of the second addresses.

27. The method of claim 26, further comprising sending a no match code to the first point if the first address is incompatible with all of the second addresses.

28. The method of claim 1, further comprising storing, at the second database, at least one additional functional property code associated with the second point, such that the second point has multiple associated second functional property codes.

29. The method of claim 28, wherein the first functional property code is compatible with the second functional property code if the first functional property code is compatible with at least one of the second functional property codes.

30. The method of claim 29, further comprising sending a no match code from the data base to the first point if the first functional property code is incompatible with all of the second functional property codes.

31. The method of claim 29, wherein at least one of the second functional property codes comprises a negated functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is compatible with the negated second functional property code.

32. The method of claim 29, wherein at least one of the second functional property codes comprises a mandatory functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is not compatible with the mandatory second functional property code.

33. The method of claim 28, further comprising obtaining and sending at least one additional functional property code associated with the first address, such that the first address has multiple associated first functional property codes.

34. The method of claim 33, wherein the first functional property code is compatible with the second functional property code if each of the first functional property codes is compatible with at least one of the second functional property codes.

35. The method of claim 1, wherein the transportation network is a parcel delivery network.

36. The method of claim 1, further comprising routing the physical object to an intermediary point between the first point and the third point.

37. The method of claim 36, wherein the intermediary point is operable to modify the physical object.

38. The method of claim 36, wherein the intermediary point is operable to substitute the physical object.

39. The method of claim 36, wherein the intermediary point is operable to associate a label with the physical object, wherein the label contains information facilitating the routing of the physical object to the third point.

40. The method of claim 1, further comprising routing the physical object to an intermediary point between the first point and the second point.

41. The method of claim 1, wherein the first database and the second database are coupled to form one database.

42. The method of claim 1, wherein the first functional property code is one of a plurality of first functional property codes, wherein the second functional property code is one of a plurality of second functional property codes, wherein the third functional property code is one of a plurality of third functional property codes, wherein the first address is one of a plurality of first addresses, wherein the second address is one of a plurality of second addresses, and wherein the third address is one of a plurality of third addresses.

43. A system for routing a physical object in a transportation network, comprising:

a first point operable to obtain and send a first address and a first functional property code associated with the first point to a processor, wherein the first address is the first point of routing a physical object, and wherein the first functional property code describes an intended purpose or property for contents of a physical object routed from the first address;

a processor coupled to the first point, the processor programmed to;

store, in a database, a second address and a second functional property code, and a third address all associated with a second point, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed inherent capability attributable to the second third address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object;

store, in the database, a third functional property code and a third address associated with the second address, wherein the third functional property code describes an intended purpose or property for contents of the physical object routed to the third address, wherein the third address describes a third point of routing the physical object, the third point is a destination point of the physical object if the second functional property code is not compatible with the first functional property code;

receive the first address and the first functional property code from the first point;

determine the third address if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and the stored third functional property code associated with the second address in order to ascertain the third address; and

send the third address to the first point if the first functional property code is not compatible with the second functional property code.

44. The system of claim 43, wherein the first point is further operable to facilitate routing of the physical object to the third point based on the third address.

45. The system of claim 43, wherein a label containing the third address is associated with an object and is used to facilitate routing of the object to the third point.

46. The system of claim 43, wherein the first point is further operable to facilitate retrieving an object from the second point based on the third address.

47. The system of claim 43, wherein the second address comprises a partial postal address.

48. The system of claim 43, wherein the second address matches the third address.

49. The system of claim 43, wherein the first address comprises part of the second address.

50. The system of claim 43, wherein the third address comprises a pseudo-address.

51. The system of claim 43, wherein the first point comprises an origin point.

52. The system of claim 43, wherein the second point comprises a destination point.

53. The system of claim 43, wherein the data base is co-located with the first point.

54. The system of claim 43, wherein the data base is remote from the first point.

55. The system of claim 43, wherein the data base comprises a processor and a memory.

56. The system of claim 43, wherein the first address is compatible with the second address if the first address matches the second address.

57. The system of claim 43, wherein the first address is compatible with the second address if the first address matches part of the second address.

58. The system of claim 43, wherein the first functional property code is compatible with the second functional property code if the first functional property codes matches the second functional property code.

59. The system of claim 43, wherein the first point is further operable to store the first functional property code.

60. The system of claim 59, wherein the first point is further operable to modify the first functional property code before sending the first functional property code to the data base.

61. The system of claim 60, wherein modifying the first functional property code comprises substituting another functional property code for the first functional property code.

62. The system of claim 43, wherein the data base is further operable to send a no match code to the first point if the first address is incompatible with the second address.

63. The system of claim 43, wherein the data base is further operable to send a no match code to the first point if the first functional property code is incompatible with the second functional property code.

64. The system of claim 43, wherein the data base is further operable to store a fourth functional property code and a fourth address associated with a third point, wherein the third point is also associated with the second address.

65. The system of claim 64, wherein the data base is further operable to determine if the first functional property code is compatible with the fourth functional property code if the first functional property code is incompatible with the second functional property code.

66. The system of claim 65, wherein the data base is further operable to send a no match code to the first point if the first functional property code is incompatible with the second functional property code and the fourth functional property code.

67. The system of claim 64, wherein the data base is further operable to:

determine if the first functional property code is compatible with the fourth functional property code if the first address is compatible with the second address; and

select between the third address and the fourth address if the first functional property code is compatible with the third functional property code and the fourth functional property code.

68. The system of claim 67, wherein selecting between the third address and the fourth address comprises selecting the address associated with whichever of the second functional property code and the third functional property code matches the first functional property code.

69. The system of claim 43, wherein the data base is further operable to store a third functional property code, a second address, and a third address for each of a plurality of second points.

70. The system of claim 69, wherein the data base is further operable to determine if the first address is compatible with any of the second addresses in determining if the first address is compatible with the second address.

71. The system of claim 70, wherein the data base is further operable to send a no match code to the first point if the first address is incompatible with all of the second addresses.

72. The system of claim 43, wherein the data base is further operable to store at least one additional functional property code associated with the second point, such that the second point has multiple associated second functional property codes.

73. The system of claim 72, wherein the first functional property code is compatible with the second functional property code if the first functional property code is compatible with at least one of the second functional property codes.

74. The system of claim 73, wherein the data base is further operable to send a no match code to the first point if the first functional property code is incompatible with all of the second functional property codes.

75. The system of claim 73, wherein at least one of the second functional property codes comprises a negated functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is compatible with the negated second functional property code.

76. The system of claim 73, wherein at least one of the second functional property codes comprises a mandatory functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is not compatible with the mandatory functional property code.

77. The system of claim 72, wherein the first point is further operable to obtain and send at least one additional functional property code associated with the first address, such that the first address has multiple associated first functional property codes.

78. The system of claim 77, wherein the first functional property code is compatible with the second functional property code if each of the first functional property codes is compatible with at least one of the second functional property codes.

79. The system of claim 43, wherein the transportation network is a parcel delivery network.

101. The method of claim 74, wherein the transportation network is a parcel delivery network.

80. A method for routing a physical an object in a transportation network, comprising:

obtaining, at a first point, a first address and a first functional property code associated with a first point to be routed, wherein the first address is the first point of routing a physical object, and wherein the first functional property code describes an intended purpose or property for contents of the physical object routed from the first address;

obtaining, at the first point, a second address and a second functional property code associated with a second point to be routed, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed to the second address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object;

communicating the first address, the first functional property code, the second address, and the second functional property code;

determining, at a remote location in an electronic processing environment, a third address associated with a third point if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and a third functional property code associated with the second address;

receiving the third address at the first point; and

routing the physical object to the third point based at least on the third address.

81. The method of claim 80, wherein facilitating routing comprises associating a label containing the third address with the object.

82. The method of claim 80, wherein facilitating routing comprises selecting a network node to which to route the object.

83. The method of claim 80, further comprising facilitating retrieval of the object from the second point based on the second address.

84. The method of claim 80, wherein obtaining a first address and a first functional property code comprises detecting signals from a keyboard that designate the first address and the first functional property code.

85. The method of claim 84, wherein detecting signals comprises detecting signals indicating the selection of the first address and the first functional property code in a display menu.

86. The method of claim 85, wherein the first address and the first functional property code are displayed in a graphical user interface.

87. The method of claim 80, wherein the first address comprises a partial postal address.

88. The method of claim 80, wherein the second address comprises a pseudo-address.

89. The method of claim 80, wherein the first point comprises an origin point.

90. The method of claim 80, wherein the third second point comprises a destination point.

91. The method of claim 80, further comprising storing the first functional property code at the first point.

92. The method of claim 91, further comprising modifying the first functional property code before communicating the first functional property code.

93. The method of claim 92, wherein modifying the first functional property code comprises substituting another functional property code for the first functional property code.

94. The method of claim 92, wherein modifying the first functional property code comprises adding another functional property code to the first functional property code such that there are multiple functional property codes associated with the first address.

95. The method of claim 80, wherein obtaining a first address and a first functional property code comprises generating the functional property code based on automated optical recognition of the object.

96. The method of claim 80, further comprising receiving a no match code indicating that the first address is incompatible.

97. The method of claim 80, further comprising receiving a no match code indicating that the first functional property code is incompatible.

98. The method of claim 80, further comprising obtaining and communicating at least one additional functional property code associated with the first address, such that the first address has multiple associated first functional property codes.

99. The method of claim 98, wherein at least one of the first functional property codes comprises a negated functional property code.

100. The method of claim 99, wherein at least one of the first functional property codes comprises a mandatory functional property code.

102. A method for routing a physical object in a transportation network, comprising:

receiving a first address and a first functional property code associated with a first point to be routed, wherein the first address is the first point of routing a physical object, and wherein the first functional property code describes an intended purpose or property for contents of the physical object routed from the first address;

storing, in a database, a second address and a second functional property code associated with a second point, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed to the second address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object;

storing, in the second database, a third functional property code and a third address associated with the second address, wherein the third functional property code describes an intended purpose or property for contents of the physical object routed to the third address, wherein the third address describes a third point of routing the physical object, the third point is a destination point of the physical object if the second functional property code is not compatible with the first functional property code;

determining the third address in the electronic processing environment if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and the stored third functional property code associated with the second address; and

generating the third address if the first functional property code is not compatible with the second functional property code.

103. The method of claim 102, wherein the second address comprises a partial postal address.

104. The method of claim 102, wherein the second address matches the third address.

105. The method of claim 102, wherein the first address comprises part of the second address.

106. The method of claim 102, wherein the third address comprises a pseudo-address.

107. The method of claim 102, wherein the point comprises a destination point.

108. The method of claim 102, wherein the first address is compatible with the second address if the first address matches the second address.

109. The method of claim 102, wherein the first address is compatible with the second address if the first address matches part of the second address.

110. The method of claim 102, wherein the first functional property code is compatible with the second functional property code if the first functional property codes matches the second functional property code.

111. The method of claim 102, further comprising generating a no match code if the first address is incompatible with the second address.

112. The method of claim 102, further comprising generating a no match code if the first functional property code is incompatible with the second functional property code.

113. The method of claim 102, further comprising storing a fourth functional property code and a fourth address associated with a third point, wherein the third point is also associated with the second address.

114. The method of claim 113, further comprising determining if the first functional property code is compatible with the fourth functional property code if the first functional property code is incompatible with the second functional property code.

115. The method of claim 114, further comprising generating a no match code if the first functional property code is incompatible with the second functional property code and the fourth functional property code.

116. The method of claim 113, further comprising:

determining if the first functional property code is compatible with the fourth functional property code if the first address is compatible with the second address;

selecting between the third address and the fourth address if the first functional property code is compatible with the third functional property code and the fourth functional property code.

117. The method of claim 116, wherein selecting between the third address and the fourth address comprises selecting the address associated with whichever of the third functional property code and the fourth functional property code matches the first functional property code.

118. The method of claim 102, wherein a data base stores the third functional property code, a second address, and a third address for each of a plurality of second points.

119. The method of claim 118, wherein determining if the first address is compatible with the second address comprises determining if the first address is compatible with any of the second addresses.

120. The method of claim 119, further comprising generating a no match code if the first address is incompatible with all of the second addresses.

121. The method of claim 102, further comprising storing at least one additional functional property code associated with the second point, such that the second point has multiple associated third functional property codes.

122. The method of claim 121, wherein the first functional property code is compatible with the second functional property code if the first functional property code is compatible with at least one of the second functional property codes.

123. The method of claim 122, further comprising generating a no match code if the first functional property code is incompatible with all of the second functional property codes.

124. The method of claim 122, wherein at least one of the second functional property codes comprises a negated functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is compatible with the negated second functional property code.

125. The method of claim 122, wherein at least one of the second functional property codes comprises a mandatory functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is not compatible with the mandatory second functional property code.

126. The method of claim 121, further comprising receiving at least one additional functional property code associated with the first address, such that the first address has a plurality of associated first functional property codes.

127. The method of claim 125, wherein the first functional property code is compatible with the second functional property code if each of the first functional property codes is compatible with at least one of the second functional property codes.

128. The method of claim 102, wherein the transportation network is a parcel delivery network.

129. An apparatus for routing a physical object in a transportation network, comprising:

a memory operable to store;

a first address and a first functional property code associated with a first point to be routed, wherein the first address is the first point of routing a physical object, and wherein the first functional property code describes an intended purpose or property for contents of the physical object routed from the first address;

a second address and a second functional property code associated with a second point, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed to the second address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object; and

a third functional property code and a third address associated with the second address, wherein the third functional property code describes an intended purpose or property for contents of the physical object routed to the third address, wherein the third address describes a third point of routing the physical object, the third point is a destination point of the physical object if the second functional property code is not compatible with the first functional property code; and

a processor coupled to the memory, the processor programmed to;

receive the first address and the first functional property code;

determine the third address if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and the stored third functional property code associated with the second address; and

generate a signal representing the third address if the first functional property code is not compatible with the second functional property code.

130. The apparatus of claim 129, wherein the second address comprises a partial postal address.

131. The apparatus of claim 129, wherein the second address matches the third address.

132. The apparatus of claim 129, wherein the first address comprises part of the second address.

133. The apparatus of claim 129, wherein the third address comprises a pseudo-address.

134. The apparatus of claim 129, wherein the second point comprises a destination point.

135. The apparatus of claim 129, wherein the first address is compatible with the second address if the first address matches the second address.

136. The apparatus of claim 129, wherein the first address is compatible with the second address if the first address matches part of the second address.

137. The apparatus of claim 129, wherein the first functional property code is compatible with the second functional property code if the first functional property codes matches the second functional property code.

138. The apparatus of claim 129, wherein the processor is further operable to generate a no match code if the first address is incompatible with the second address.

139. The apparatus of claim 129, wherein the processor is further operable to generate a no match code if the first functional property code is incompatible with the second functional property code.

140. The apparatus of claim 129, wherein the memory is further operable to store a fourth functional property code and a fourth address associated with a third point, wherein the third point is also associated with the second address.

141. The apparatus of claim 140, wherein the processor is further operable to determine if the first functional property code is compatible with the third functional property code if the first functional property code is not compatible with the second functional property code.

142. The apparatus of claim 141, wherein the processor is further operable to generate a no match code if the first functional property code is incompatible with the second functional property code and the fourth functional property code.

143. The apparatus of claim 140, wherein the processor is further operable to:

determine if the first functional property code is compatible with the fourth functional property code if the first address is compatible with the second address; and

select between the third address and the fourth address if the first functional property code is compatible with the third functional property code and the fourth functional property code.

144. The apparatus of claim 143, wherein selecting between the third address and the fourth address comprises selecting the address associated with whichever of the third functional property code and the fourth functional property code matches the first functional property code.

145. The apparatus of claim 129, wherein the memory is further operable to store a third functional property code, a second address, and a third address for each of a plurality of second points.

146. The apparatus of claim 145, wherein the processor is further operable to determine if the first address is compatible with any of the second addresses to determine the first address is compatible with the second address.

147. The apparatus of claim 146, wherein the processor is further operable to generate a no match code if the first address is incompatible with all of second addresses.

148. The apparatus of claim 129, further comprising storing at least one additional functional property code associated with the second point, such that the second point has multiple associated second functional property codes.

149. The apparatus of claim 148, wherein the first functional property code is compatible with the second functional property code if the first functional property code is compatible with at least one of the second functional property codes.

150. The apparatus of claim 149, wherein the processor is further operable to generate a no match code if the first functional property code is incompatible with all of the second functional property codes.

151. The apparatus of claim 149, wherein at least one of the second functional property codes comprises a negated functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is compatible with the negated second functional property code.

152. The apparatus of claim 151, wherein at least one of the second functional property codes comprises a mandatory functional property code, whereby the first functional property code is not compatible with the second functional property codes if the first functional property code is not compatible with the mandatory second functional property code.

153. The apparatus of claim 148, wherein the processor is further operable to receive at least one additional functional property code associated with the first address, such that the first address has a plurality of associated first functional property codes.

154. The apparatus of claim 153, wherein the processor is further operable to determine if each of the first functional property codes is compatible with at least one of the second functional property codes to determine is the first functional property code is compatible with the second functional property code.

155. The apparatus of claim 129, wherein the transportation network is a parcel delivery network.

156. A method for routing a physical object in a transportation network, comprising:

obtaining, at a first point, a first address and a stored code associated with a physical object to be routed;

determining electronically whether to use the stored code or an alternative property code as a first functional property code based on whether a user provides the alternative property code, wherein the first functional property code describes an intended purpose or property for contents of the physical object routed from the first address;

storing, in an electronic database, a second address and a second functional property code associated with a second point, wherein the second functional property code describes an intended purpose or property for contents of the physical object routed to the second address, wherein the second address describes a second point of routing the physical object, the second point being a requested destination point of the physical object;

storing, in the database, a third functional property code and a third address associated with the second address, wherein the third functional property code describes an intended purpose or property for contents of the physical object routed to the third address, wherein the third address describes a third point of routing the physical object, the third point is a destination point of the physical object if the second functional property code is not compatible with the first functional property code;

determining the third address in the electronic processing environment if the first functional property code is not compatible with the second functional property code, wherein the third address reflects a match between the obtained first functional property code and the stored third functional property code associated with the second address; and

sending the third address to the first point if the first functional property code is not compatible with the second functional property code.

157. The method of claim 156, wherein the stored code comprises a default functional property code associated with the first point.

158. The method of claim 156, wherein obtaining, at the first point, the first address and the stored code comprises:

receiving, at the first point, the first address from the user; and

accessing, at the first point, the stored code from a memory.

159. The method of claim 158, wherein determining whether to use the stored code or the alternative property code is based on whether a prefix is provided for the first address, and wherein the alternative property code comprises the prefix.

160. The method of claim 156, further comprising routing the object to the third point based on the third address.

161. The method of claim 160, wherein routing the object to the third point based on the third address comprises associating a label containing the third address with the object.

162. The method of claim 156, further comprising retrieving the object from the third point based on the third address.

163. The method of claim 156, wherein the second address comprises a partial postal address.

164. The method of claim 156, wherein the second address matches the third address.

165. The method of claim 156, wherein the first address comprises part of the second address.

166. The method of claim 156, wherein the third address comprises a pseudo-address.

167. The method of claim 156, wherein the first point comprises an origin point.

168. The method of claim 156, wherein the second point comprises a destination point.