Nearest greedy algorithm for solving a single landfill site selection with resource requirements
2020
Nur Azriati Mat | Aida Mauziah Benjamin | Syariza Abdul Rahman
Landfill site selection has appeared to be an important waste management issue for future landfill planning. The selection of suitable landfill sites involves several alternative sites, along with evaluation criteria. Previously, most studies solved the landfill site selection problem by using the geographic information systems (GIS) and the multiple criteria decision making (MCDM) methods. GIS is used to identify suitable sites for a new landfill, while MCDM is used to rank the candidate sites based on the score calculated for each site. With that this paper presents a new approach that ranks the related candidate sites. These candidate sites were ranked based on several vital resource requirements, such as total travel distance to transport collected waste to the landfill, number of vehicles/ drivers required for the collection and total working hours of drivers affect the operating cost of the selected landfill. To be precise, all requirements as described above have been provided when a particular site is selected as the new landfill. These resources are identified by using the heuristic technique, namely nearest greedy. This approach was further tested on a benchmark problem set, namely waste collection vehicle routing problem with time windows. The results serve to aid the waste management team to select the most suitable location for landfill siting, besides listing the influential resource requirements for landfill site selection planning in selecting a new landfill site.
显示更多 [+] 显示较少 [-]