| Author | Nisarat Rienwatjanawong. |
| Call Number | AIT Thesis no. ISE-97-46 |
| Subject(s) | Automated tellers
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. ISE-97-46 |
| Abstract | Replenishment operations can be actually decomposed into 2 subproblems, the routing problem and the inventory problem. According to the inventory problem, we proposed the inventory model for variable demand and constant lead time in lost sales case with stockout cost per outage. It can determine for each A TM the amount of cash replenishment, the replenishing point and the average frequency of vehicle visits so that the cash invent01y balances with customer demand. Replenishment routing for Automatic Teller Machines (ATM) is a special case of the vehicle routing with time windows under capacity and time length constraints. fu this thesis study, there are 45 geographically dispersed ATMs and one single depot. The ATM officers must serve a set of ATMs which need the services daily. A truck leaves the cash center once and it must stop at evety A TM on its route according to capacity limitation and time constraints before it returns to the cash center. There is no ATM replenished by more than one vehicle (route). Our proposed optimization model and heuristic algorithm are means that can yield savings on fixed cost of vehicles and variable cost of fuel expenditure. Two measurements that indicate the effectiveness of the algorithm are the quality of result and the time consumption. To achieve good quality of result and sh01t time consumption, a software package of the inse1tion heuristic (III) optimization algorithm was created. The inse1tion heuristic program is designed with highly specialized user friendly interface to provide features of the near-optimal routing solutions with a small time consumption. The results showed that all the test problems solved by inse1tion heuristic program gave good solutions within 1 second only, while the problems solved by LINGO gave optimal solutions within many hours or perhaps days. If the time consumption is limited to 10 minutes, LINGO could only give the feasible solutions which are not so close to the optimal solution as the insertion heuristic can do. Fmthermore, we recommend the bank to apply the invent01y model in order to manage the storing cash plan and to use the routing program to generate the routing solutions for each vehicle. The location of a cash center, the multiple cash centers and the integration of the invent01y and routing models with the ATM information system may be studied further. |
| Year | 1997 |
| Corresponding Series Added Entry | Asian Institute of Technology.|tThesis ; no. ISE-97-46 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Systems Engineering (ISE) |
| Chairperson(s) | Anulark Pinnoi; |
| Examination Committee(s) | Nagarnr, N.N.;Pandey, P.C.; |
| Scholarship Donor(s) | Electricity Generating Authority of Thailand.; |
| Degree | hesis (M.Eng.) - Asian Institute of Technology, 1997 |