Abstract
The obnoxious p-median problem consists of locating p facilities among a set of sites such that the sum distance from any demand to its nearest facility and the dispersion among facilities are maximized. In this paper, the multi-objective colliding bodies optimization algorithm (MOCBO) is utilized to obtain the trade-off curve of the obnoxious p-median problems. The performance of the developed optimization method is investigated for locating obnoxious facilities through two case studies to maximize the two conflicting objectives. The performance of the MOCBO algorithm is further compared with those of the MPSO and NSGA-II algorithms representative of the state of the art in the field of multi-objective optimization. In this study, the MOCBO algorithm showed suitable convergence performance and generalization abilities compared to the MPSO and NSGA-II algorithms.
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.
