THE TRUCK ASSIGNMENT PROBLEM.
Abstract
Let us consider the following problem: a group of cement-factories produce several types of cement but each factory produces only one type of cement. There is also a group of purchasers and each purchaser may need several types of cement. The amounts supplied and the demands are assumed to be known for each cement factory and each purchaser. Each cement factory has several trucks and there is a general dispatcher for all cars in all cement factories. It is assumed that the whole load of a truck is for one purchaser only. A truck begins its working day by leaving (loaded) its basic depot and ends its day by returning to it. During the day it may also be transporting cement from other cement factories. The distances from different factories to different purchasers are known. The problem to be solved is the following one: to find a truck schedule such that cement in needed quantities be delivered daily to different purchasers and such that the total amount of truck-kilometers will be as small as possible. The paper presents the method of solution, though the assumption of an 8-hour work per day may not be met. On the other hand methods for effecting a variety of cyclic routings are developed which can be used to lend considerable flexibility to the schedules. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1967
- Accession Number
- AD0651813
Entities
People
- Wlodzimierz Szwarc
Organizations
- Carnegie Institute of Technology