Accession Number : AD0767658

Title :   A Branch and Bound Algorithm for the Delivery Truck Problem.

Descriptive Note : Master's thesis,

Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF

Personal Author(s) : Balut,Stephen John

Report Date : JUN 1973

Pagination or Media Count : 44

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. (Author)

Descriptors :   (*SCHEDULING, ALGORITHMS), TRANSPORTATION, FUEL CONSUMPTION, MATHEMATICAL MODELS, OPTIMIZATION, THESES, COMPUTER PROGRAMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE