Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia

Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia

0.00 Avg rating0 Votes
Article ID: iaor20084236
Country: Netherlands
Volume: 177
Issue: 3
Start Page Number: 1751
End Page Number: 1763
Publication Date: Mar 2007
Journal: European Journal of Operational Research
Authors: , , , ,
Keywords: programming: multiple criteria, location, heuristics: tabu search
Abstract:

In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant).

Reviews

Required fields are marked *. Your email address will not be published.