MODEL AND ALGORITHM DEVELOPMENT FOR DETERMINING FACILITY LOCATION AND VEHICLE ROUTE WITH TIME WINDOWS AND LIMITED HETEROGEN VEHICLES IN WASTE MANAGEMENT SYSTEM

• Main Author: Muhammad Fiqri Achmad, Andi
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/51410
• Institution: Institut Teknologi Bandung

One of the problems experienced by medical waste transportation companies is the increasing number of health care facilities resulting in an increase in the amount of medical waste. This problem has resulted in the company having to add waste management facilities in the form of a waste collection warehouse and processing center / incinerator, as well as reroute waste transport vehicles. The problem that must be faced is how to determine the location of facilities in the form of collection warehouses and waste processing centers and at the same time determining the routes of waste transport vehicles. This is a problem because in general the vehicle bases are located in the same location as the collecting warehouse, or a base that is separate from the processor but does not have a collection warehouse. However, the system studied in this study has separate locations for bases, collection warehouses and waste processing centers. In addition, the existence of the producer time window requires the vehicle to serve producers within a certain time. In addition, the limited capacity and number of waste transport vehicles also causes problems in dealing with the increasing number of waste producers. Based on these problems, this study will develop a mathematical model for determining the location of facilities and vehicle routes that consider time windows, heterogeneous vehicles limited to a waste management system. In addition to a mathematical model, this study also develops an SA algorithm to solve these problems in a shorter time. The result of the developed SA algorithm is able to achieve near optimal solutions. The difference between the solutions produced by the analytic method and the algorithm is 5.87%, while the computation time is 273532.32%