Abstract
This work presents a novel methodology for solving multi-objective facility location problems (mo-FLPs) with the focus on public emergency service stations. Our study is one of a few studies incorporating the objectives of three well-known problems, viz. the p-median problem (pMP), the maximal coverage location problem (MCLP) and the p-center problem (pCP). Aiming to find a set of Pareto optimal solutions and a compromise solution for all three objectives, we have developed an algorithm which solves each individual location problem sequentially. The proposed approach is mainly based on a combination of the branch & bound and iterative goal programming techniques. The performance of the algorithm is demonstrated with numerical examples.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
