CROSS DOCKING IN ROUTE DETERMINATION

• US 20110184770A1
• Filed: 12/07/2005
• Published: 07/28/2011
• Est. Priority Date: 12/07/2005
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Kumar, Amar, Bruns, Arno Diego, Schwarzmann, Winfried
• Application Number:
  US12/096,558
• Publication Number:
  US 20110184770A1
• Time in Patent Office: Days
• US Class Current: 705/7.11
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 10/063 Operations research, analysis or management

Abstract

Apparatus comprising a data storage device which stores at least one route graph, the at least one route graph describing a plurality of route paths between a plurality of locations, wherein at least one route path in the at least one route graph comprises at least two consecutive direct routes connected by a cross-docking location, the at least one route path connecting a first location with a second location, the cross-docking location in combination with the connected at least two direct routes building up a cross-docking route; the route graph comprising at least one cross-docking route; wherein the apparatus determines at least one transportation route from a source location to a destination location using at least one cross-docking route, a source location and a destination location, the at least one cross-docking route describing at least one of a local graph of direct routes and a global graph of direct routes.

Claims

1. An apparatus comprising:

a data storage device which stores at least one route graph, the at least one route graph describing a plurality of route paths between a plurality of locations, wherein at least one route path in the at least one route graph comprises at least two consecutive direct routes which are connected by a cross-docking location and wherein the at least one route path connects a first location with a second location, wherein

the cross-docking location in combination with the connected at least two direct routes builds up a cross-docking route;

the route graph comprises at least one cross-docking route;

the at least one route path is specified by the cross-docking route, the first location and the second location; and

wherein the apparatus determines at least one transportation route from a source location to a destination location using at least one cross-docking route, a source location and a destination location wherein the at least one cross-docking route describes at least one of a local graph of direct routes and a global graph of direct routes.

2. The apparatus of claim 1, further comprising:

means for defining a transportation route by a cross-docking route, a source location and a destination location;

means for defining a plurality of direct routes;

means for defining at least one cross-docking location; and

means for defining at least one cross-docking route by connecting at least two direct routes by the at least one cross-docking location.

3. The apparatus of claim 1, further comprising:

means for connecting at least a further cross-docking route by the cross-docking location.

4. The apparatus of claim 1, wherein a cross-docking route describes a local graph of direct routes with respect to the cross-docking location.

5. The apparatus of claim 4, wherein at least one direct route is an incoming route with respect to the cross-docking location and at least one direct route is an outgoing route with respect to the cross-docking location.

6. The apparatus of claim 5, wherein a plurality of cross-docking routes describe a global graph of direct routes, that connect together the plurality of cross-docking routes.

7. The apparatus of claim 6, wherein the incoming route is a cross-docking route.

8. The apparatus of claim 7, wherein the outgoing route is a cross-docking route.

9. The apparatus of claim 8, wherein a cross-docking route describes a hierarchy of routes, wherein the relationship between a cross-docking route and the incoming and outgoing routes is a parent-child relationship.

10. The apparatus of claim 9, wherein a parent within the hierarchy of routes has a number of properties such that each child with respect to the parent is able to take over the properties of the parent.

11. The apparatus of claim 10, wherein each direct route comprises at least one leg, wherein a leg comprises at least a set of locations and a means of transportation.

12. The apparatus of claim 11, wherein the first location is a source location of a transportation request and the second location is a destination location of the transportation request.

13. The apparatus of claim 12, wherein a route path represents a transportation route from the source location to the destination location of the transportation request.

14. The apparatus of claim 13, wherein a cross-docking location is part of several cross-docking routes.

15. The apparatus of claim 14, wherein a route is part of several cross-docking routes.

16. The apparatus of claim 15, wherein a cross-docking route allows transportation of goods from a source location to a destination location along the transportation route, wherein the transportation route comprises at least the cross-docking-route.

17. The apparatus of claim 16, wherein a cross-docking route comprises a number of properties for a pair of incoming and outgoing routes indicating whether or not goods on a transport arriving at the cross-docking location on the incoming route have to be reloaded on a different transport when leaving the cross-docking location on the outgoing route.

18. A route graph for describing a plurality of route paths between a plurality of locations, wherein at least one route path in the route graph comprises at least two consecutive direct routes which are connected by a cross-docking location and wherein the at least one route path connects a first location with a second location, wherein

the cross-docking location in combination with the connected at least two direct routes builds up a cross-docking route;

the route graph comprises at least one cross-docking route; and

the at least one route path is specified by the cross-docking route, the first location and the second location.

19. The route graph of claim 18, wherein a cross-docking route describes a local graph of direct routes with respect to the cross-docking location.

20. The route graph of claim 18, wherein at least one direct route is an incoming route with respect to the cross-docking location and at least one direct route is an outgoing route with respect to the cross-docking location.

21. The route graph of claim 20, wherein a plurality of cross-docking routes describe a global graph of direct routes, wherein the plurality of cross-docking routes are connected together.

22. The route graph of claim 21, wherein the incoming route is a cross-docking route.

23. The route graph of claim 22, wherein the outgoing route is a cross-docking route.

24. The route graph of claim 23, wherein a cross-docking route describes a hierarchy of routes, wherein the relationship between a cross-docking route and the incoming and outgoing routes is a parent-child relationship.

25. The route graph of claim 24, wherein a parent within the hierarchy of routes comprises a number of properties and wherein each child with respect to the parent being able to take over the properties of the parent.

26. The route graph of claim 25, wherein each direct route comprises at least one leg, wherein a leg comprises at least a set of locations and a means of transportation.

27. The route graph of claim 26, wherein the first location is a source location of a transportation request and the second location is a destination location of the transportation request.

28. The route graph of claim 27, wherein a route path represents a transportation route from the source location to the destination location of the transportation request.

29. The route graph of claim 28, wherein a cross-docking location is part of several cross-docking routes.

30. The route graph of claim 29, wherein a route is part of several cross-docking routes.

31. The route graph of claim 30, wherein a cross-docking route allows transportation of goods from a source location to a destination location along the transportation route wherein the transportation route comprises at least the cross-docking-route.

32. The route graph of claim 31, wherein a cross-docking route comprises a number of properties for a pair of incoming and outgoing routes indicating whether or not goods on a transportation means arriving at the cross-docking location on the incoming route have to be reloaded on a different transportation means when leaving the cross-docking location on the outgoing route.

33. A computer-implemented method for representing transportation routes in a route graph, comprising:

determining at least one transportation route between a source location S and destination location D using at least one cross-docking route, wherein the at least one cross-docking route describes at least one of a local graph of direct routes and a global graph of direct routes.

34. The computer-implemented method of claim 33, further comprising:

defining a plurality of direct routes;

defining at least one cross-docking location; and

defining at least one cross-docking route by connecting at least two direct routes by the at least one cross-docking location.

35. The computer-implemented method of claim 34, further comprising:

receiving a transportation request comprising at least a source location S and a destination location D; and

issuing a response to the transportation request comprising at least the source location S, the destination location D and a cross-docking route.

36. The computer-implemented method of claim 35, further comprising:

specifying at least one cross-docking route by connecting at least a further cross-docking route by the cross-docking location.

37. The computer-implemented method of claim 36, wherein the determined transportation route comprises a sequence of direct routes.

38. The computer-implemented method of claim 37, further comprising:

maintaining at least one local route graph and maintaining at least one global route graph, wherein an authority for maintaining the at least one local route graph is disjunctive to an authority for maintaining the at least one global route graph.

39. A computer readable medium containing instructions that when executed by a computer causes the computer to:

determine at least one transportation route between a source location S and destination location D using at least one cross-docking route, wherein the at least one cross-docking route describes at least one of a local graph of direct routes and a global graph of direct routes.