A branch and bound algorithm for the delivery truck problem
branchboundalgor00balu.pdf (2.009Mb)Abstract
The delivery truck problem is one in which a truck is loaded with m packages, one package to be delivered to each of m destinations. The amount of fuel consumed by the truck is directly dependent upon the current total weight of the truck, which includes both the weight of the packages and the amount of fuel remaining in the tank. The problem is to determine a sequence in which to deliver all m packages which will minimize total fuel consumption. A branch and bound algorithm for obtaining optimal solutions to the delivery truck problem is presented, along with several sample problems with their solutions. A brief report of computational experience is included.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Scheduling underway replenishment as a generalized orienteering problem
(Monterey, California. Naval Postgraduate School, 1992-06);The replenishment of a dispersed battle group requires logistic ships to travel long distances between ships in the battle group. When operational requirements limit the amount of time that can be spent conducting ... -
A Multiattribute Supplier Selection and Order Quantity Allocations Model with Green Procurement Considerations
(WDSI, 2017-04);One of the key challenges of current procurement decisions is to consider more than just a single attribute such as cost. Consequently, multiattribute procurement has emerged as an important research direction. This paper ... -
Generalized Orienteering Problem with Resource Dependent Rewards
(2013);We introduce a generalized Orienteering Problem where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, in ...
