DELIVERY SUPPORT APPARATUS, DELIVERY SUPPORT METHOD, AND DELIVERY SUPPORT PROGRAM
A delivery support device includes a derivation unit that derives a route of a resource in a delivery apparatus, for minimizing a maximum value of a time during which the resource is exhausted at a plurality of first locations. The derivation unit derives the route on the basis of a branch-and-bound method using a relaxation problem of aggregating a plurality of second locations of which a delivery order is not determined among the plurality of first locations into one point.
1 . A delivery support device comprising:
a derivation unit, including one or more processors, configured to derive a route of a resource in a delivery apparatus, for minimizing a maximum value of a time during which the resource is exhausted at a plurality of first locations, wherein
the derivation unit is configured to derive the route based on a branch-and-bound method using a relaxation problem of aggregating a plurality of second locations of which a delivery order is not determined among the plurality of first locations into one point.
2 . The delivery support device according to claim 1 , wherein
each of the plurality of first locations is associated with an exhaustion time of the resource and a stay time of the delivery apparatus; and
the derivation unit includes:
a first route selection unit, including one or more processors, configured to select a first route for delivering the resource to the plurality of second locations based on a sum of the exhaustion time and the stay time; and
a first calculation unit, including one or more processors, configured to calculate a lower limit value of the maximum value based on the first route.
3 . The delivery support device according to claim 2 , wherein
the stay time is independent among the plurality of first locations.
4 . The delivery support device according to claim 2 , wherein
the derivation unit further includes a second calculation unit, including one or more processors, configured to calculate an idle time associated with each of the plurality of second locations according to a movement time of the delivery apparatus between the plurality of second locations, and
the first calculation unit is configured to calculate the lower limit value further based on the idle time.
5 . The delivery support device according to claim 2 , wherein
the first route is an optimal solution based on a delivery delay time minimization problem in a scheduling problem.
6 . The delivery support device according to claim 2 , wherein
the derivation unit further includes:
a second route selection unit, including one or more processors, configured to select a second route for delivering the resource to the plurality of first locations based on the exhaustion time; and
a third calculation unit, including one or more processors, configured to calculate an upper limit value of the maximum value based on the second route.
7 . A delivery support method comprising:
deriving a route of a resource in a delivery apparatus, for minimizing a maximum value of a time during which the resource is exhausted at a plurality of first locations based on a branch-and-bound method using a relaxation problem of aggregating a plurality of second locations of which a delivery order is not determined among the plurality of first locations into one point.
8 . A delivery support program for causing a computer to function as each unit included in the delivery support device according to claim 1 .