| Author | Jongkol Chetbundhit |
| Call Number | AIT Thesis no.IE-90-8 |
| Subject(s) | Scheduling (Management)
|
| Note | A thesis submitted in partial fulfillment of requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | The problem of routing and scheduling gasoline delivery trucks has been studied. The
objectives of the study are to develop an efficient procedure that can route and schedule the trucks
in a systematic way, as well as to computerize routing and scheduling tasks based on the developed
procedure.
Routing and $cheduling trucks have to be done on a daily basis, under the constraints of
delivery acceptance time of customers and. travel regulations for trucks typical for Bangkok. The
gasoline has to be distributed from a central depot to a number of gas stations located in the Greater
Bangkok Area, by a non-homogeneous fleet. The developed procedure consists of three major
parts ( 1) Shortest Path Construction and Travel Time Estimation, (2) Matching which is the proposed
methodology instead of vehicle routing, since it is restricted to route only two customers in one tour,
and (3) Truck Scheduling.
The well known Dijkstra' s algorithm is used to solve the shortest path problem. A regression
analysis based on shortest distance is done to estimate the travel time. The matching and scheduling
are separately done, by combining the customers to be on one tour first. The objective of matching
customers is to maximize saving that can be obtained by matching them. Two approaches are
proposed for matching which are (1) Linear 0-1 programming approach, and (2) Greedy apprdach.
The concept of job scheduling is employed to develop the truck scheduling procedure. The objective
of scheduling is to minimize the makespan of the trucks. The scheduling procedure is developed
in order to suit the special characteristics of the problem.
The developed procedure has been coded in Pascal. The software cap make a schedule of
trucks within a few minutes. In addition, the software is so flexible that the user can vary criteria
and parameters for matching and scheduling to suit the orders of each day. |
| Year | 1990 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Oudheusden, Dirk L. van
|
| Examination Committee(s) | Tang, John C.S. ;
Nagarur, Nagendra N. |
| Scholarship Donor(s) | The Royal Government of Netherlands |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1990 |