Abstract

This paper presents a brief description of some existing models of facility location problems (FLPs) in solid waste management. The study provides salient information on commonly used distance functions in location models along with their corresponding mathematical formulation. Some of the optimization techniques that have been applied to location problems are also presented along with an appropriate pseudocode algorithm for their implementation. Concerning the models and solution techniques, the survey concludes by summarizing some recent studies on the applications of FLPs to waste collection and disposal. It is expected that this paper will contribute in no small measure to an integrated solid waste management system with specific emphasis on issues associated with waste collection, thereby boosting the drive for effective and efficient waste collection systems. The content will also provide early career researchers with some necessary starting information required to formulate and solve problems relating to FLP.

Highlights

  • One of the critical issues that borders on solid waste management in developing countries is centered on the collection of waste

  • Daskin [34] proposed an integer programming (IP) model for the Undesirable Facility Location Problem (UFLP) with the following parameters: P is the number of expected facilities to be opened; σi is the demand of customer i; dij is the distance between customer i and facility j; xj is the same as in Section 4.5.1; yij = 1 if the requirement of customer i is satisfied by facility j, and 0, if otherwise

  • This paper presents a brief survey of literature on facility location problems (FLPs)

Read more

Summary

Introduction

One of the critical issues that borders on solid waste management in developing countries is centered on the collection of waste. An extensive range of models exists in the literature for describing practical problems of optimization involving service point locations in waste management, and some of these mathematical formulations are discussed in this study (see [6,7,8,9,10,11,12,13,14,15,16,17,18] for examples). Technological advancement has made it somewhat easier to design cost-efficient facility locations for municipal solid waste collection especially for large areas.

Methodology
Distance Function in Facility Location
Classification of Facility Location Problems
Solution Techniques for FLP
Branch-and-Bound
Lagrangian Relaxation Heuristic
Constructive and Local Search
Tabu Search
Large Neighborhood Search
Particle Swarm Optimization
Ant Colony Optimization and Variants
Simulated Annealing
Genetic Algorithm
Application of Facility Location Problems in Waste Management
Objective
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call