Naval Postgraduate School
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 ... -
Optimized positioning of pre-disaster relief force and assets
(Monterey, California. Naval Postgraduate School, 2006-12);Recent events in the United States of America and Pakistan have exposed the shortcomings of existing planning in relief and humanitarian assistance in the face of large-scale natural disasters. This thesis develops a ... -
A generalized orienteering problem for optimal search and interdiction planning
(Monterey, California: Naval Postgraduate School, 2013-09);In order to support search planning for counterdrug operations, we introduce a generalized Orienteering Problem (OP) where transit on arcs in a network and reward collection at nodes both consume a variable amount of the ...
