Ulaştırma ve Lojistik Kongreleri

A Metaheuristic Algorithm for The Hazardous Waste Perodic Location Routing Problem

Ayyüce Aydemir Karadağ
Dr., Gazi Üniversitesi, Ankara, Türkiye

This paper integrates the periodic routing problem with location decisions in hazardous waste management systems. The problem is to determine the periodic collection schedules of hazardous wastes from waste producers, the locations of processing centers and the routing of waste between centers. We propose a two-step solution approach that first solves a set covering problem to locate the processing centers. Then, the developed meta-heuristic approach generates periodic visit schedules to waste producers. The performance of the proposed approach is tested on several hypothetical problem instances. Computational studies have shown that the solution methodology quickly provides high-quality solutions.

Keywords: Hazardous Waste, Periodic Location Routing Problem, Metaheurictics