Show simple item record

dc.contributor.advisorHoward, Gilbert T.
dc.contributor.authorBalut, Stephen John
dc.dateJune 1973
dc.date.accessioned2012-11-13T23:50:25Z
dc.date.available2012-11-13T23:50:25Z
dc.date.issued1973-06
dc.identifier.urihttp://hdl.handle.net/10945/16509
dc.description.abstractThe 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.en_US
dc.description.urihttp://archive.org/details/branchboundalgor00balu
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.subject.lcshMathematicsen_US
dc.titleA branch and bound algorithm for the delivery truck problemen_US
dc.typeThesisen_US
dc.contributor.secondreaderDavis, Daniel
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentDepartment of Mathematics
dc.subject.authorSequence dependenten_US
dc.subject.authorRouting problemen_US
dc.subject.authorBranch and bounden_US
dc.subject.authorDelivery truck problemen_US
dc.subject.authorInvestigation theoryen_US
dc.description.serviceLieutenant Commander, United States Navyen_US
etd.thesisdegree.nameM.S. in Mathematicsen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineMathematicsen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record