AI SearchComputer scheduling of gasoline deliveries from one depot to a number of delivery points
Call Number: AIT Thesis no. IE-92-19 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. IE-92-19Publication details: Bangkok : Asian Institute of Technology, 1992Description: 39, A-62 leavesSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1992 Summary: The study is concerned with the optimum routing and scheduling of a fleet of gasoline delivery trucks between a central depot and a large number of service stations supplied by the depot. The travel time between any two points in the system is assumed given and a total quantity demand for products and a delivery acceptance period are specified for a number of stations within the distribution system. There are two types of time windows that have to be considered. One is according to the specified delivery acceptance period of stations and the other is due to travel regulations of trucks. They can travel only in specific periods. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied within the delivery acceptance period and total time covered by the fleet is a minimum. Additional constraint of travel regulations on trucks may not be violated. A procedure based on a heuristic algorithm is given for obtaining a near optimal solution.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-92-19 (Browse shelf(Opens below)) | 1 | Available | 30050003074498 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-92-19 (Browse shelf(Opens below)) | 2 | Available | 30050003074506 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. IE-92-19 (Browse shelf(Opens below)) | 1 | Available | 30050160075486 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library Archives | AIT Thesis no. IE-92-19 (Browse shelf(Opens below)) | 3 | Available | 30050121004955 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1992
The study is concerned with the optimum routing and scheduling of a fleet of gasoline delivery trucks between a central depot and a large number of service stations supplied by the depot. The travel time between any two points in the system is assumed given and a total quantity demand for products and a delivery acceptance period are specified for a number of stations within the distribution system. There are two types of time windows that have to be considered. One is according to the specified delivery acceptance period of stations and the other is due to travel regulations of trucks. They can travel only in specific periods. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied within the delivery acceptance period and total time covered by the fleet is a minimum. Additional constraint of travel regulations on trucks may not be violated. A procedure based on a heuristic algorithm is given for obtaining a near optimal solution.
There are no comments on this title.