A Study of Location Problem and Vehicle Routing Problem for the Obnoxious Facility

摘要

A location problem for obnoxious facility and vehicle routing problem are discussed in this paper paper. We focus on finding a feasible area and suitable site for the obnoxious facility and assigning the vehicle routings. A three-stage heuristic algorithm is proposed for solving this model. The first stage screens out infeasible areas for obnoxious facility location .The second stage is searching for a better location for the facility by using a Genetic algorithm. The third stage is to assign vehicle routings using a Tabu algorithm. The solution algorithm has been tested by several examples. Result indicate esult indicates that the algorithm can generate good solutions.