Optimization of transport with multiple vehicles

• US 20040107110A1
• Filed: 12/02/2002
• Published: 06/03/2004
• Est. Priority Date: 12/02/2002
• Status: Abandoned Application

• Current Assignee: SAP AG (SAP SE)
• Original Assignee: SAP AG (SAP SE)
• Inventors: Gottlieb, Jens, Eckert, Christoph
• Application Number:
  US10/308,919
• Publication Number:
  US 20040107110A1
• Time in Patent Office: Days
• US Class Current: 705/1
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 10/0637 Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/0834 Choice of carriers
• CPC Class Codes: G06Q 10/08355 Routing methods
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

Methods and apparatus, including computer program products, for optimizing a total cost associated with transporting products on a set of vehicles. Orders representing products are assigned to one or more vehicles in the set. The assignment defines a sequence of pickup and delivery activities for the vehicles. One or more orders are deleted from one or more vehicles; at least one order from the deleted orders is inserted into a vehicle; the assignment is changed for at least one vehicle; and a cost is determined for the transportation of the products on the set of vehicles. The steps of deleting one or more orders, inserting at least one order, changing the assignment, and determining a cost, are repeated until an optimal cost has been determined.

Claims

1. A computer program product, tangibly stored on a computer-readable medium, for optimizing a total cost associated with transporting products on a set of vehicles, comprising instructions operable to cause a programmable processor to:

assign one or more orders to one or more vehicles in a set of vehicles, each order representing one or more products;

create an assignment for one or more vehicles in the set of vehicles, the assignment defining a sequence of pickup and delivery activities for orders that are assigned to each of the one or more vehicles;

delete one or more orders from one or more vehicles in the set of vehicles;

insert at least one order from the one or more deleted orders into at least one vehicle in the set of vehicles;

change the assignment for at least one vehicle in the set of vehicles;

determine a cost for the transportation of the products on the set of vehicles; and

repeat the instructions to delete one or more orders, insert at least one order, change the assignment, and determine a cost, until an optimal cost has been determined.

2. The computer program product of claim 1, further comprising instructions to:

assign an original departure time and an original arrival time to each order;

change the assigned original departure time or original arrival time for at least one order; and

repeat the instructions to delete one or more orders, insert at least one order, change the assignment, change the assigned departure time and determine a cost, until an optimal cost has been determined.

3. The computer program product of claim 2, wherein the instructions to assign an original departure time and the original arrival time comprise instructions to:

search for an available time slot in a calendar, based on a desired start time or a desired ending time and a time required for carrying out an activity associated with the order.

4. The computer program product of claim 3, wherein the instructions to search for an available time slot comprise instructions to:

search for an available time slot while taking into account one or more of;

available vehicle capacity, opening hours of delivery and pickup locations, vehicle down times.

5. The computer program product of claim 4, further comprising instructions to:

search for an available time slot based on entries in a capacity calendar.

6. The computer program product of claim 3, wherein the instructions to search comprise instructions to:

search in a forward direction in the calendar.

7. The computer program product of claim 3, wherein the instructions to search comprise instructions to:

search in a backward direction in the calendar.

8. The computer program product of claim 1, further comprising instructions to:

insert at least one order from a set of unassigned orders into a vehicle in the set of vehicles from which one or more orders has been deleted.

9. The computer program product of claim 1, wherein the instructions to insert comprise instructions to:

insert at least one order from the one or more deleted orders into a same vehicle from which the at least one order has been deleted.

10. The computer program product of claim 1, wherein the instructions to insert comprise instructions to:

insert at least one order from the one or more deleted orders into a vehicle different from a vehicle from which the at least one order has been deleted.

11. The computer program product of claim 1, wherein the instructions to change the assignment for at least one vehicle comprises instructions to:

change the sequence of pickup and delivery activities for orders that are assigned to each of the at least one vehicle.

12. The computer program product of claim 1, further comprising instructions to:

combine all orders in a first vehicle into a first representation;

combine all orders in a second vehicle into a second representation; and

exchange all the orders assigned to the first and the second vehicle by exchanging the first and the second representations.

13. The computer program product of claim 1, wherein the instructions to assign include instructions to:

assign one or more orders to one or more fixed-trip vehicles having a predetermined geographic route to travel.

14. The computer program product of claim 13, wherein the instructions to assign one or more orders to one or more fixed-trip vehicles include instructions to:

assign one or more orders to one or more fixed-trip vehicles having a predetermined schedule defining when to travel the predetermined geographical route.

15. The computer program product of claim 1, wherein the instructions to insert at least one order comprises instructions to:

insert at least one order from the one or more deleted orders into at least one vehicle in the set of vehicles while conforming to one or more hard constraints.

16. The computer program product of claim 15, wherein the hard constraints include one or more of:

incompatibilities between two order types, incompatibilities between an order type and a vehicle type, incompatibilities between a vehicle type and a location, driving capabilities, loading capacities, and fixed start or end locations.

17. The computer program product of claim 1, wherein the instructions to determine a cost comprise instructions to:

determine a cost for the transportation of the products on the set of vehicles based on one or more of the following cost components;

a basic cost per vehicle, a time cost per vehicle, a distance cost per vehicle, a special cost per vehicle, a load cost per vehicle, a stop cost per vehicle, and a penalty cost for violating one or more soft constraints per vehicle.

18. The computer program product of claim 17, wherein the soft constraints include one or more of the following:

delivery or pick up of orders earlier than scheduled, delivery or pick up of orders later than scheduled, and no delivery or pick up of orders.

19. A method for optimizing a total cost associated with transporting products on a set of vehicles, the method comprising:

assigning one or more orders to one or more vehicles in a set of vehicles, each order representing one or more products;

creating an assignment for one or more vehicles in the set of vehicles, the assignment defining a sequence of pickup and delivery activities for orders that are assigned to each of the one or more vehicles;

deleting one or more orders from one or more vehicles in the set of vehicles;

inserting at least one order from the one or more deleted orders into at least one vehicle in the set of vehicles;

changing the assignment for at least one vehicle in the set of vehicles;

determining a cost for the transportation of the products on the set of vehicles; and

repeating the steps of deleting one or more orders, inserting at least one order, changing the assignment, and determining a cost, until an optimal cost has been determined.

20. The method of claim 19, further comprising:

assigning an original departure time and an original arrival time to each order;

changing the assigned original departure time or original arrival time for at least one order; and

repeating the steps of deleting one or more orders, inserting at least one order, changing the assignment, changing the assigned departure time, and determining a cost, until an optimal cost has been determined.

21. The method of claim 20, wherein assigning an original departure time and the original arrival time comprises:

searching for an available time slot in a calendar, based on a desired start time or a desired ending time and a time required for carrying out an activity associated with the order.

22. The method of claim 21, wherein searching for an available time slot comprises:

searching for an available time slot while taking into account one or more of;

available vehicle capacity, opening hours of delivery and pickup locations, vehicle down times.

23. The method of claim 22, further comprising:

searching for an available time slot based on entries in a capacity calendar.

24. The method of claim 21, wherein searching comprises:

searching in a forward direction in the calendar.

25. The method of claim 21, wherein searching comprises:

searching in a backward direction in the calendar.

26. The method of claim 19, further comprising:

inserting at least one order from a, set of unassigned orders into a vehicle in the set of vehicles from which one or more orders has been deleted.

27. The method of claim 19, wherein inserting comprises:

inserting at least one order from the one or more deleted orders into a same vehicle from which the at least one order was deleted.

28. The method of claim 19, wherein inserting comprises:

inserting at least one order from the one or more deleted orders into a vehicle different from a vehicle from which the at least one order was deleted.

29. The method of claim 19, wherein changing the assignment for at least one vehicle comprises:

changing the sequence of pickup and delivery activities for orders that are assigned to each of the at least one vehicle.

30. The method of claim 19, further comprising:

combining all orders in a first vehicle into a first representation;

combining all orders in a second vehicle into a second representation; and

exchanging all the orders assigned to the first and the second vehicle by exchanging the first and the second representations.

31. The method of claim 19, wherein assigning comprises:

assigning one or more orders to one or more fixed-trip vehicles having a predetermined geographic route to travel.

32. The method of claim 31, assigning one or more orders to one or more fixed-trip vehicles comprises:

assigning one or more orders to one or more fixed-trip vehicles having a predetermined schedule defining when to travel the predetermined geographical route.

33. The method of claim 19, wherein inserting at least one order comprises:

inserting at least one order from the one or more deleted orders into at least one vehicle in the set of vehicles while conforming to one or more hard constraints.

34. The method of claim 33, wherein the hard constraints include one or more of:

incompatibilities between two order types, incompatibilities between an order type and a vehicle type, incompatibilities between a vehicle type and a location, driving capabilities, loading capacities, and fixed start or end locations.

35. The method of claim 19, wherein determining a cost comprises:

determining a cost for the transportation of the products on the set of vehicles based on one or more of the following cost components;

a basic cost per vehicle, a time cost per vehicle, a distance cost per vehicle, a special cost per vehicle, a load cost per vehicle, a stop cost per vehicle, and a penalty cost for violating one or more soft constraints per vehicle.

36. The method of claim 35, wherein the soft constraints include one or more of the following:

delivery or pick up of orders earlier than scheduled, delivery or pick up of orders later than scheduled, and no delivery or pick up of orders.