A heuristic approach to solve the postmen routing problem in Bangkok | |
| Author | Anen Aung-Aphinant |
| Call Number | AIT Thesis no.IE-80-03 |
| Subject(s) | Traveling-salesman problem Postal service--Thailand--Bangkok--Letter carriers |
| Note | A thesis submitted in partial fulfilment of the requirement for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | A new heuristic algorithm for solving the postmen routing problem is introduced and applied to the Bangkok 5 postal district as a case study. In this postal area, there are 100 mail boxes which are devised into four groups with four postmen collecting the mails. In the study, another new set of four routes is generated by the proposed algorithm which give a shorter total traveling time, as well as a better (smaller range) distribution of workload for the four postmen, than the present one. Fur~hermore, two interesting aspects which are concerned with the case study are also presented here. One is the discussion on the relative merits of several additional algorithms which have been proposed and why they are not efficient in solving the postmen routing problem. Another is the traveling time model used for estimating the traveling time of a motorcycle ridden in the metropolitan area. The model is constructed by the multiple regression analysis. |
| Year | 1980 |
| Type | Thesis |
| School | School of Engineering and Technology |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Oudheusden, Dirk L. Van |
| Examination Committee(s) | Tang, John C.S. ;Tabucanon, Mario T. |
| Scholarship Donor(s) | The Federal Republic of Germany |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1980 |